{"as_of":"2026-08-22T21:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8f9d12e351177ee962f26cd4074cb23d98ce7238922a305e7c14ed566180f8a","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:32:48.927587Z","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-14T23:39:54.419483Z","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-16T05:32:48.927587Z","title":"Fully-dynamic graph sparsifiers against an adaptive adversary","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.927587Z"},"links":{"cited_paper":"/paper/2004.08432","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:674cb8faf2f42e8b524101fe54166942c83a56d252a67990d49de4de470cdb52","observation_id":"6611cc94-1805-4d1c-b5a0-04d81e2265e0","resolution":{"observed_at":"2026-08-16T05:32:48.927587Z","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-14T23:39:54.419483Z","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-12T19:31:50.792782Z","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:e8463079e40327e2a10b308fb3b56602fdb4a23ac2fba3d149aab581a8108d50","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-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-14T23:39:54.419483Z","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-18T00:12:17.051992Z","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:9967ce1028a293e0033a2b003f068ebee29dc23f99bdd0f1feb0edc08b89fdb2","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-14T23:39:54.419483Z","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-18T00:12:17.051992Z","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:a12df732ed72cc86e76c941a771ad161e85d3e12a970e798fb404fce4ba7fd78","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-14T23:39:54.419483Z","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:28078e24c62b3b21e8af3f7d67ccd0f0b15c89736a2f90a63a9fa1bd12464505","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-14T23:39:54.419483Z","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-18T18:59:42.786300Z","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:fe12e49e534b1e32a2b9c0e5671022f093da9394a22855c380292dec64bc9a6d","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-14T23:39:54.419483Z","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-20T02:04:04.115784Z","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:1789c3f316dc242f407157436eb320b7751c8b28580e05f40312a610027bc830","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-14T23:39:54.419483Z","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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"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."}