Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler
As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2001.10809.
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-15T06:32:42.880941+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-14T04:18:58.400262Z
A source-named dated measurement, never combined with another source.
Source: cited_works
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 b4492091-b8ba-40fa-8716-84817938b98a · inbound
TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability cites this paper.
TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler
Reference 62
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T04:18:58.400262Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.