{"as_of":"2026-08-23T00:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:66dfb56292664909be0a58480fe1fa36393993d58e7fa92ed600860794ddf8f4","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T12:40:07.999650Z","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-02T01:06:24.439338Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.02368","last_updated":"2020-05-05T17:52:01Z","snapshot_observed_at":"2026-08-03T17:10:17.357873Z","submitted_at":"2020-05-05T17:52:01Z","title":"Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers","version":1},"cited_work":{"arxiv_id":"2005.02368","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2005.02368","snapshot_observed_at":"2026-07-02T01:06:24.439338Z","title":null,"venue":null,"work_id":"d5662b21-c74f-4537-8bc4-c226adf3ec1c","year":2005},"citing_paper":{"arxiv_id":"2606.01809","last_updated":"2026-06-01T07:27:10Z","snapshot_observed_at":"2026-08-13T05:30:31.959922Z","submitted_at":"2026-06-01T07:27:10Z","title":"A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T12:40:07.999650Z"},"links":{"cited_paper":"/paper/2005.02368","citing_paper":"/paper/2606.01809"},"observation_digest":"sha256:244f60013af1c7c9ee8e5922079ff5864cec7b5b6f1a49a1710f415e06b1372b","observation_id":"80de5377-f73c-445d-8678-5a5f9eb5575c","resolution":{"observed_at":"2026-07-02T01:06:24.441628Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2005.02368/citation-record","integrity":"/paper/2005.02368/integrity","json":"/paper/2005.02368/citation-record.json","paper":"/paper/2005.02368"},"outbound":[],"paper":{"arxiv_id":"2005.02368","last_updated":"2020-05-05T17:52:01Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-03T17:10:17.357873Z","submitted_at":"2020-05-05T17:52:01Z","title":"Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers"},"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 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2005.02368."}