Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2005.02368.
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-22T06:32:14.747728+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-06-28T12:40:07.999650Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-02T01:06:24.439338Z
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 80de5377-f73c-445d-8678-5a5f9eb5575c · inbound
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs cites this paper.
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
Reference 10
- Resolution
- verified exact
- arxiv_id, observed 2026-07-02T01:06:24.441628Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.