{"as_of":"2026-08-20T10:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:052f18fbfb2c136193ff324ac3b47bd20f6f52e3d4ff31449db347851a6acbde","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T06:25:09.946876Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T20:40:08.525382Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1807.01478","last_updated":"2018-07-04T08:26:37Z","snapshot_observed_at":"2026-08-14T18:55:53.914749Z","submitted_at":"2018-07-04T08:26:37Z","title":"Near-Optimal Distance Emulator for Planar Graphs","version":1},"cited_work":{"arxiv_id":"1807.01478","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.01478","snapshot_observed_at":"2026-07-04T20:40:08.525382Z","title":"Near-Optimal Distance Emulator for Planar Graphs","venue":"cs.DS","work_id":"12485c56-88ca-4087-858e-1b19909521c5","year":2018},"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":4,"source":"arxiv_source","source_observed_at":"2026-06-25T19:48:10.529872Z"},"links":{"cited_paper":"/paper/1807.01478","citing_paper":"/paper/2606.25827"},"observation_digest":"sha256:32e3962d6341b3d945d58271867234b0f8c57dbae5d170450e62498111e72f05","observation_id":"77d59987-1c19-496d-879b-1804292f075f","resolution":{"observed_at":"2026-07-04T20:40:08.528168Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.01478","last_updated":"2018-07-04T08:26:37Z","snapshot_observed_at":"2026-08-14T18:55:53.914749Z","submitted_at":"2018-07-04T08:26:37Z","title":"Near-Optimal Distance Emulator for Planar Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.01478","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:1807.01478 , 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":10,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/1807.01478","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:1f278f6b10c12ea5f164acd4c9a17a304f9dde63ca218b9d389540b00900eb3f","observation_id":"4baa6728-ef7a-41c9-822f-debcf5d7d230","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/1807.01478/citation-record","integrity":"/paper/1807.01478/integrity","json":"/paper/1807.01478/citation-record.json","paper":"/paper/1807.01478"},"outbound":[],"paper":{"arxiv_id":"1807.01478","last_updated":"2018-07-04T08:26:37Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T18:55:53.914749Z","submitted_at":"2018-07-04T08:26:37Z","title":"Near-Optimal Distance Emulator for Planar Graphs"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1807.01478."}