Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space
As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1807.08745.
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-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-16T11:21:03.179204Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-14T15:14:34.233863Z
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 dda86800-8af4-4b20-82c0-84ad4400cac3 · inbound
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds cites this paper.
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space
Reference 2017
- Resolution
- verified exact
- local_arxiv, observed 2026-08-14T15:14:34.241062Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation efd21560-bf1a-4b9a-8c11-6fc3dcf02242 · inbound
Fully Scalable MPC Algorithms for Euclidean k-Center cites this paper.
Fully Scalable MPC Algorithms for Euclidean k-Center Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space
Reference 46
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:21:03.179204Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 53ed5b4c-b653-4202-9b9c-bebe8450c073 · inbound
Lower Bounds for Non-adaptive Local Computation Algorithms cites this paper.
Lower Bounds for Non-adaptive Local Computation Algorithms Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space
Reference 26
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T04:47:55.481437Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.