Pith. sign in

Paper Citation Record · LEDGER

Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2004.08432.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2004.08432 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 7 of 7 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 7 of 7 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T05:32:48.927587Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-03T01:27:30.723975Z

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 6611cc94-1805-4d1c-b5a0-04d81e2265e0 · inbound

Deterministic Dynamic Maximal Matching in Sublinear Update Time cites this paper.

Deterministic Dynamic Maximal Matching in Sublinear Update Time Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-16T05:32:48.927587Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T05:32:48.927587Z digest=sha256:674cb8faf2f42e8b524101fe54166942c83a56d252a67990d49de4de470cdb52

Observation 32f802cb-380c-480b-9503-1947022d1887 · inbound

Quantum Cut Sparsifiers cites this paper.

Quantum Cut Sparsifiers Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-07-03T01:27:30.725532Z

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.

source=arxiv_source observed=2026-06-27T16:35:11.234441Z digest=sha256:e8463079e40327e2a10b308fb3b56602fdb4a23ac2fba3d149aab581a8108d50

Observation 3cc0e090-cd7b-4d45-84f8-b59ecd9646f7 · inbound

Approximate Single Source Dual Fault Tolerant Distance Oracle cites this paper.

Approximate Single Source Dual Fault Tolerant Distance Oracle Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Reference 42

Resolution
unresolved
no resolver link, observed 2026-07-12T05:33:05.084614Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-12T05:33:05.084614Z digest=sha256:9967ce1028a293e0033a2b003f068ebee29dc23f99bdd0f1feb0edc08b89fdb2

Observation ea9e2302-848a-4372-b798-15468b412212 · inbound

Approximate Single Source Dual Fault Tolerant Distance Oracle cites this paper.

Approximate Single Source Dual Fault Tolerant Distance Oracle Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.614825Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.614825Z digest=sha256:a12df732ed72cc86e76c941a771ad161e85d3e12a970e798fb404fce4ba7fd78

Observation 555a86f5-7851-4612-840e-7939a194f6b7 · inbound

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost cites this paper.

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-01T14:44:10.888950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:44:10.888950Z digest=sha256:28078e24c62b3b21e8af3f7d67ccd0f0b15c89736a2f90a63a9fa1bd12464505

Observation 32c2700b-eaaf-4afc-8285-5c39dd9d2cb2 · inbound

An Online Sparsification Algorithm from the Book cites this paper.

An Online Sparsification Algorithm from the Book Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-01T03:55:26.794812Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T03:55:26.794812Z digest=sha256:fe12e49e534b1e32a2b9c0e5671022f093da9394a22855c380292dec64bc9a6d

Observation f4b1d516-74f8-40da-aa4b-116768184f09 · inbound

Sharp Bounds on Ground State Energy of the SYK Model cites this paper.

Sharp Bounds on Ground State Energy of the SYK Model Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Reference 17

Resolution
unresolved
no resolver link, observed 2026-07-30T10:55:24.923366Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T10:55:24.923366Z digest=sha256:1789c3f316dc242f407157436eb320b7751c8b28580e05f40312a610027bc830