{"as_of":"2026-08-05T14:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4089240e8b8b26cffee21442009a2009f9b09df30f0c628548726c81d001dd17","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-05T06:32:48.257954+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.555099Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1706.06086","last_updated":"2017-12-30T17:44:15Z","snapshot_observed_at":"2026-07-06T05:47:27.191725Z","submitted_at":"2017-06-19T17:57:08Z","title":"An exponential lower bound for cut sparsifiers in planar graphs","version":3},"cited_work":{"arxiv_id":"1706.06086","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.06086","snapshot_observed_at":"2026-07-04T20:40:08.555099Z","title":"An exponential lower bound for cut sparsifiers in planar graphs","venue":"cs.DS","work_id":"510f5659-5c74-4dce-b911-26470ec0d6cc","year":2017},"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":65,"source":"arxiv_source","source_observed_at":"2026-06-25T19:48:10.529872Z"},"links":{"cited_paper":"/paper/1706.06086","citing_paper":"/paper/2606.25827"},"observation_digest":"sha256:0d6e845884b075a0523337cc6de39673ddd432032e2aa71be861fc6f6e3e9395","observation_id":"d1254212-1dd3-4500-a386-fdc14964024f","resolution":{"observed_at":"2026-07-04T20:40:08.556728Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.06086","last_updated":"2017-12-30T17:44:15Z","snapshot_observed_at":"2026-07-06T05:47:27.191725Z","submitted_at":"2017-06-19T17:57:08Z","title":"An exponential lower bound for cut sparsifiers in planar graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.06086","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:1706.06086 , 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-03T08:52:32.505827Z","submitted_at":"2026-07-03T02:29:36Z","title":"Paths and Intersections: Minimum Realization of Okamura-Seymour Instances","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/1706.06086","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:b5508f31348d540616b32b53e4856de5702112051a8cdfb4a2eb48bfa719b2e4","observation_id":"f08ffda2-fbb6-4ccf-9028-c3b9ca2c8618","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/1706.06086/citation-record","integrity":"/paper/1706.06086/integrity","json":"/paper/1706.06086/citation-record.json","paper":"/paper/1706.06086"},"outbound":[],"paper":{"arxiv_id":"1706.06086","last_updated":"2017-12-30T17:44:15Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T05:47:27.191725Z","submitted_at":"2017-06-19T17:57:08Z","title":"An exponential lower bound for cut sparsifiers in 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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1706.06086."}