Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2211.12101.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T00:49:28.566491Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-24T08:34:11.942883Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation bde5209a-5bd7-4cd5-af36-efa8918dd67a · inbound
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs cites this paper.
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams
Reference 56
- Resolution
- verified exact
- arxiv_id, observed 2026-05-24T08:34:11.945006Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 6d12c744-6709-4050-a2c9-2ab1d0fec784 · inbound
Efficient Approximate Temporal Triangle Counting in Streaming with Predictions cites this paper.
Efficient Approximate Temporal Triangle Counting in Streaming with Predictions Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams
Reference 57
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T00:49:28.566491Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.