{"as_of":"2026-08-10T22:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:791a6a5159462b2f43424f5a5d83b69866adcb58406673c16b5c9bd54f4d7191","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T09:01:28.948253Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":2,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.03456","last_updated":"2025-05-20T06:32:21Z","snapshot_observed_at":"2026-08-02T07:41:10.608026Z","submitted_at":"2022-03-07T15:15:09Z","title":"Negative-Weight Single-Source Shortest Paths in Near-linear Time","version":6},"cited_work":{"arxiv_id":"2203.03456","doi":"10.48550/arxiv.2203.03456","metadata_source":"pith","pith_arxiv_id":"2203.03456","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Negative-Weight Single-Source Shortest Paths in Near-linear Time","venue":"cs.DS","work_id":"873edc57-cbe9-49c7-8460-9e5751ea32ef","year":2022},"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":28,"source":"arxiv_source","source_observed_at":"2026-07-12T05:33:05.084614Z"},"links":{"cited_paper":"/paper/2203.03456","citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:7da88451a1b4263ab430eec6a4a6a5c4699f536672b118805c4e2a8d42f42531","observation_id":"45c80683-d529-4490-8940-38c7eb6247e6","resolution":{"observed_at":"2026-07-12T05:38:34.965025Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-13T23:19:48.653069+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T23:19:48.653069+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.03456","last_updated":"2025-05-20T06:32:21Z","snapshot_observed_at":"2026-08-02T07:41:10.608026Z","submitted_at":"2022-03-07T15:15:09Z","title":"Negative-Weight Single-Source Shortest Paths in Near-linear Time","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.03456","snapshot_observed_at":"2026-08-02T09:01:28.948253Z","title":"CoRR , title =","venue":null,"work_id":null,"year":2022},"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":28,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:28.948253Z"},"links":{"cited_paper":"/paper/2203.03456","citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:d8fcd07256686786b59b299e84637dcfb061ca05b0bfd4134a692e0e42204096","observation_id":"091d6c5d-edfd-4cdd-be44-a46f47d6aeea","resolution":{"observed_at":"2026-08-02T09:01:28.948253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.03456","last_updated":"2025-05-20T06:32:21Z","snapshot_observed_at":"2026-08-02T07:41:10.608026Z","submitted_at":"2022-03-07T15:15:09Z","title":"Negative-Weight Single-Source Shortest Paths in Near-linear Time","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.03456","snapshot_observed_at":"2026-08-01T14:44:09.161187Z","title":"CoRR , title =","venue":null,"work_id":null,"year":2022},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:09.161187Z"},"links":{"cited_paper":"/paper/2203.03456","citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:52614ce75a07ac1ca2e2a4acfef7641e100d869afd1eeb0656df3d6bbdaef234","observation_id":"bd1e2cb5-4666-4dd4-a0f4-b8b876d8dfac","resolution":{"observed_at":"2026-08-01T14:44:09.161187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2203.03456/citation-record","integrity":"/paper/2203.03456/integrity","json":"/paper/2203.03456/citation-record.json","paper":"/paper/2203.03456"},"outbound":[],"paper":{"arxiv_id":"2203.03456","last_updated":"2025-05-20T06:32:21Z","latest_version":6,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-02T07:41:10.608026Z","submitted_at":"2022-03-07T15:15:09Z","title":"Negative-Weight Single-Source Shortest Paths in Near-linear Time"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2203.03456."}