{"as_of":"2026-08-08T11:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c09f2dafd56c30ef9d88f1d5b81050929b28136dd392cca3591a599babad3800","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-08T06:32:00.761636+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-08-07T11:33:03.548072Z","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-08-07T18:16:16.850658Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1301.5896","last_updated":"2013-01-24T20:54:38Z","snapshot_observed_at":"2026-07-06T03:04:50.149153Z","submitted_at":"2013-01-24T20:54:38Z","title":"Computing bounded-width tree and branch decompositions of k-outerplanar graphs","version":1},"cited_work":{"arxiv_id":"1301.5896","doi":"10.48550/arxiv.1301.5896","metadata_source":"pith","pith_arxiv_id":"1301.5896","snapshot_observed_at":"2026-08-07T18:16:16.850658Z","title":"Computing bounded-width tree and branch decompositions of k-outerplanar graphs","venue":"cs.DS","work_id":"67cb1e6c-5b9d-45d7-8f7a-d8c5ef4bba6b","year":2013},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:03.548072Z"},"links":{"cited_paper":"/paper/1301.5896","citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:c947b477ebcc357b5e2453f218e6e1770ac2ab6d6778a0eb5dbf65f6f56823b6","observation_id":"35b86b4f-4256-4949-8242-052c7a23ce3d","resolution":{"observed_at":"2026-08-07T11:33:07.021313Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1301.5896/citation-record","integrity":"/paper/1301.5896/integrity","json":"/paper/1301.5896/citation-record.json","paper":"/paper/1301.5896"},"outbound":[],"paper":{"arxiv_id":"1301.5896","last_updated":"2013-01-24T20:54:38Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T03:04:50.149153Z","submitted_at":"2013-01-24T20:54:38Z","title":"Computing bounded-width tree and branch decompositions of k-outerplanar 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1301.5896."}