{"as_of":"2026-08-12T04:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c02ddae08cd9213ecff80dc9b4635af184458afca59ebe854e0d7c8dba8be3e2","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-11T06:34:44.6726+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-10T18:14:07.841052Z","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-10T18:14:08.019025Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1703.03756","last_updated":"2017-03-10T16:41:22Z","snapshot_observed_at":"2026-07-06T05:33:15.258956Z","submitted_at":"2017-03-10T16:41:22Z","title":"A unified treatment of linked and lean tree-decompositions","version":1},"cited_work":{"arxiv_id":"1703.03756","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.03756","snapshot_observed_at":"2026-08-10T18:14:08.019025Z","title":"A unified treatment of linked and lean tree-decompositions","venue":"math.CO","work_id":"577dd5fb-e2c0-45f4-98be-a1ee930268c1","year":2017},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.841052Z"},"links":{"cited_paper":"/paper/1703.03756","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:4f3a8c39c98da55082cabca088d8ce40367127c3b7f6ceb96a8147228374253a","observation_id":"e60af814-97b5-49b3-86ce-aad2a665cea4","resolution":{"observed_at":"2026-08-10T18:14:08.024280Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1703.03756/citation-record","integrity":"/paper/1703.03756/integrity","json":"/paper/1703.03756/citation-record.json","paper":"/paper/1703.03756"},"outbound":[],"paper":{"arxiv_id":"1703.03756","last_updated":"2017-03-10T16:41:22Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T05:33:15.258956Z","submitted_at":"2017-03-10T16:41:22Z","title":"A unified treatment of linked and lean tree-decompositions"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1703.03756."}