{"as_of":"2026-08-09T20:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f95af05db9afb2c4a2c4bf1604f80cdfcba8152bd90ecba14145e163c6613008","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T09:01:30.614825Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T01:27:30.723975Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.08432","last_updated":"2020-11-10T09:27:32Z","snapshot_observed_at":"2026-08-09T15:10:39.159531Z","submitted_at":"2020-04-17T19:51:47Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary","version":3},"cited_work":{"arxiv_id":"2004.08432","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2004.08432","snapshot_observed_at":"2026-07-03T01:27:30.723975Z","title":"arXiv preprint arXiv:2004.08432 , year=","venue":null,"work_id":"28aa50b3-f3ed-482a-b1c2-d5c5a6aab56a","year":2004},"citing_paper":{"arxiv_id":"2606.09728","last_updated":"2026-06-08T16:51:08Z","snapshot_observed_at":"2026-08-08T08:47:55.006855Z","submitted_at":"2026-06-08T16:51:08Z","title":"Quantum Cut Sparsifiers","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T16:35:11.234441Z"},"links":{"cited_paper":"/paper/2004.08432","citing_paper":"/paper/2606.09728"},"observation_digest":"sha256:7e42d71fd9adfc5dcbfe4ea9d4829c1edaecbf951c20a88543f830592d74763c","observation_id":"32f802cb-380c-480b-9503-1947022d1887","resolution":{"observed_at":"2026-07-03T01:27:30.725532Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.08432","last_updated":"2020-11-10T09:27:32Z","snapshot_observed_at":"2026-08-09T15:10:39.159531Z","submitted_at":"2020-04-17T19:51:47Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.08432","snapshot_observed_at":"2026-07-12T05:33:05.084614Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary , year =","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-12T05:33:05.084614Z"},"links":{"cited_paper":"/paper/2004.08432","citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:dd8f76282cd6a6b18cbccaef3f80a710c37188925974e88f97006c90b8a2863c","observation_id":"3cc0e090-cd7b-4d45-84f8-b59ecd9646f7","resolution":{"observed_at":"2026-07-12T05:33:05.084614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.08432","last_updated":"2020-11-10T09:27:32Z","snapshot_observed_at":"2026-08-09T15:10:39.159531Z","submitted_at":"2020-04-17T19:51:47Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.08432","snapshot_observed_at":"2026-08-02T09:01:30.614825Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary , year =","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.614825Z"},"links":{"cited_paper":"/paper/2004.08432","citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:7e750d1753f8d933bf73fd1ee4139ed50c9fad8523e07b58fa6abac5d641e4dd","observation_id":"ea9e2302-848a-4372-b798-15468b412212","resolution":{"observed_at":"2026-08-02T09:01:30.614825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.08432","last_updated":"2020-11-10T09:27:32Z","snapshot_observed_at":"2026-08-09T15:10:39.159531Z","submitted_at":"2020-04-17T19:51:47Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.08432","snapshot_observed_at":"2026-08-01T14:44:10.888950Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary , year =","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:10.888950Z"},"links":{"cited_paper":"/paper/2004.08432","citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:f1767c600d7e0f105e5ee222ef56662698c1d6e723b54e41d26b23cbaacc60c1","observation_id":"555a86f5-7851-4612-840e-7939a194f6b7","resolution":{"observed_at":"2026-08-01T14:44:10.888950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.08432","last_updated":"2020-11-10T09:27:32Z","snapshot_observed_at":"2026-08-09T15:10:39.159531Z","submitted_at":"2020-04-17T19:51:47Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.08432","snapshot_observed_at":"2026-08-01T03:55:26.794812Z","title":"arXiv preprint arXiv:2004.08432 , year=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.23098","last_updated":"2026-07-25T08:17:55Z","snapshot_observed_at":"2026-08-09T15:10:57.333215Z","submitted_at":"2026-07-25T08:17:55Z","title":"An Online Sparsification Algorithm from the Book","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T03:55:26.794812Z"},"links":{"cited_paper":"/paper/2004.08432","citing_paper":"/paper/2607.23098"},"observation_digest":"sha256:6992f35466ab4d4398824299986e2c6cc504e048d347a649ccc00d0802f26263","observation_id":"32c2700b-eaaf-4afc-8285-5c39dd9d2cb2","resolution":{"observed_at":"2026-08-01T03:55:26.794812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.08432","last_updated":"2020-11-10T09:27:32Z","snapshot_observed_at":"2026-08-09T15:10:39.159531Z","submitted_at":"2020-04-17T19:51:47Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.08432","snapshot_observed_at":"2026-07-30T10:55:24.923366Z","title":"arXiv preprint arXiv:2004.08432 , year=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.27185","last_updated":"2026-07-29T17:54:18Z","snapshot_observed_at":"2026-08-07T23:11:07.108425Z","submitted_at":"2026-07-29T17:54:18Z","title":"Sharp Bounds on Ground State Energy of the SYK Model","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-30T10:55:24.923366Z"},"links":{"cited_paper":"/paper/2004.08432","citing_paper":"/paper/2607.27185"},"observation_digest":"sha256:c214009c6ab0d44ebe292745be673cb7f64706288ba8d34a79118ab97827e389","observation_id":"f4b1d516-74f8-40da-aa4b-116768184f09","resolution":{"observed_at":"2026-07-30T10:55:24.923366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2004.08432/citation-record","integrity":"/paper/2004.08432/integrity","json":"/paper/2004.08432/citation-record.json","paper":"/paper/2004.08432"},"outbound":[],"paper":{"arxiv_id":"2004.08432","last_updated":"2020-11-10T09:27:32Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T15:10:39.159531Z","submitted_at":"2020-04-17T19:51:47Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"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."}