{"as_of":"2026-08-14T15:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f316173170f90d1954a0b8908e20c6a2abe5629c7a8f57970d5c65dc0da0c8ad","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-14T06:32:32.682623+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-07-12T12:11:39.634286Z","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-04T20:40:08.557006Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.07042","last_updated":"2023-06-27T23:32:38Z","snapshot_observed_at":"2026-08-13T13:43:45.564892Z","submitted_at":"2022-11-13T23:08:27Z","title":"A Local-to-Global Theorem for Congested Shortest Paths","version":2},"cited_work":{"arxiv_id":"2211.07042","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.07042","snapshot_observed_at":"2026-07-04T20:40:08.557006Z","title":"arXiv preprint arXiv:2211.07042 , year=","venue":null,"work_id":"eef70b5e-1970-49ef-aa33-dbffee0c33ed","year":null},"citing_paper":{"arxiv_id":"2606.25827","last_updated":"2026-07-05T00:58:18Z","snapshot_observed_at":"2026-07-12T12:11:32.102991Z","submitted_at":"2026-06-24T13:45:01Z","title":"Paths and Intersections: Recognizing Outerplanar Metrics","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-25T19:48:10.529872Z"},"links":{"cited_paper":"/paper/2211.07042","citing_paper":"/paper/2606.25827"},"observation_digest":"sha256:32d420be65571c0534cd524998018d69aa2ece444eac7a1e8e138edff8e8040d","observation_id":"010951a1-af3d-401d-b221-424aed4a12dd","resolution":{"observed_at":"2026-07-04T20:40:08.558836Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.07042","last_updated":"2023-06-27T23:32:38Z","snapshot_observed_at":"2026-08-13T13:43:45.564892Z","submitted_at":"2022-11-13T23:08:27Z","title":"A Local-to-Global Theorem for Congested Shortest Paths","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.07042","snapshot_observed_at":"2026-07-12T12:11:39.634286Z","title":"A local-to-global theorem for congested shortest paths","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25827","last_updated":"2026-07-05T00:58:18Z","snapshot_observed_at":"2026-07-12T12:11:32.102991Z","submitted_at":"2026-06-24T13:45:01Z","title":"Paths and Intersections: Recognizing Outerplanar Metrics","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T12:11:39.634286Z"},"links":{"cited_paper":"/paper/2211.07042","citing_paper":"/paper/2606.25827"},"observation_digest":"sha256:d2db6f04b9fb7705805052ed2c39ca20353105fd54458851ef3351ee1252b039","observation_id":"53358633-83e9-4f36-8e5d-a41a718272e2","resolution":{"observed_at":"2026-07-12T12:11:39.634286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.07042","last_updated":"2023-06-27T23:32:38Z","snapshot_observed_at":"2026-08-13T13:43:45.564892Z","submitted_at":"2022-11-13T23:08:27Z","title":"A Local-to-Global Theorem for Congested Shortest Paths","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.07042","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:2211.07042 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02883","last_updated":"2026-07-03T02:29:36Z","snapshot_observed_at":"2026-08-13T18:04:35.103910Z","submitted_at":"2026-07-03T02:29:36Z","title":"Paths and Intersections: Minimum Realization of Okamura-Seymour Instances","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/2211.07042","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:6a30a61c57c18c954a19ec65526e143c792cdacc314149a33877d79a2703c9f4","observation_id":"07c0a3cc-e84a-48ea-ae4f-bf7b8f9960b9","resolution":{"observed_at":"2026-07-12T06:25:09.946876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2211.07042/citation-record","integrity":"/paper/2211.07042/integrity","json":"/paper/2211.07042/citation-record.json","paper":"/paper/2211.07042"},"outbound":[],"paper":{"arxiv_id":"2211.07042","last_updated":"2023-06-27T23:32:38Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T13:43:45.564892Z","submitted_at":"2022-11-13T23:08:27Z","title":"A Local-to-Global Theorem for Congested Shortest Paths"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2211.07042."}