Collected sources and patterns will appear here. Add from search, explore, or the patterns library.
Tuple[NodeID, Timestamp, int] -> List[TemporalNeighbor]
Retrieve the K most recent temporal neighbors and their associated interaction timestamps for a set of nodes.
Problem it solves
Dynamic graphs grow infinitely over time, requiring a bounded slice of local temporal neighbors to remain computationally tractable.
Consumes
Emits
The real projects this mechanism was found in. Attribution is the point — this is how the best teams actually do it.