Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2407.10830.
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-23T06:30:58.430688+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-16T05:32:48.964803Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-16T05:32:49.673794Z
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 acd0faf0-4935-4d9a-bcc3-cc2992523f1b · inbound
Deterministic Dynamic Maximal Matching in Sublinear Update Time cites this paper.
Deterministic Dynamic Maximal Matching in Sublinear Update Time Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
Reference 23
- Resolution
- verified exact
- local_arxiv, observed 2026-08-16T05:32:49.679920Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.