Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2004.08432.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-02T09:01:30.614825Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-03T01:27:30.723975Z
0 of 0 outbound references displayed
External citation measurements
No source-named external measurement is stored.
No outbound reference observations are available for this paper version.
Observation 32f802cb-380c-480b-9503-1947022d1887 · inbound
Quantum Cut Sparsifiers Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 3cc0e090-cd7b-4d45-84f8-b59ecd9646f7 · inbound
Approximate Single Source Dual Fault Tolerant Distance Oracle Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
Reference 42
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ea9e2302-848a-4372-b798-15468b412212 · inbound
Approximate Single Source Dual Fault Tolerant Distance Oracle Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
Reference 42
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 555a86f5-7851-4612-840e-7939a194f6b7 · inbound
$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
Reference 35
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 32c2700b-eaaf-4afc-8285-5c39dd9d2cb2 · inbound
An Online Sparsification Algorithm from the Book Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
Reference 32
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f4b1d516-74f8-40da-aa4b-116768184f09 · inbound
Sharp Bounds on Ground State Energy of the SYK Model Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
Reference 17
Source-reported events for the cited work
Unavailable: canonical work link unavailable.