{"as_of":"2026-08-12T09:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e80f86e68ffa1b0a63b5323ff673aa6648388b833e3693d9d27e4979418001c","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-12T06:34:41.77262+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-01T05:07:02.477011Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.05661","last_updated":"2025-03-31T21:44:54Z","snapshot_observed_at":"2026-08-07T17:21:25.899142Z","submitted_at":"2025-03-07T18:23:40Z","title":"Graph parameters that are coarsely equivalent to path-length","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.05661","snapshot_observed_at":"2026-08-01T05:07:02.477011Z","title":"Dragan and Ekkehard Köhler","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.477011Z"},"links":{"cited_paper":"/paper/2503.05661","citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:e917f3392e2b66e7eb68b3043c1901237a327eb689d784757f77eec02fdea024","observation_id":"7a67f984-0b44-4bb0-bb6d-b909f7a46bcc","resolution":{"observed_at":"2026-08-01T05:07:02.477011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.05661/citation-record","integrity":"/paper/2503.05661/integrity","json":"/paper/2503.05661/citation-record.json","paper":"/paper/2503.05661"},"outbound":[],"paper":{"arxiv_id":"2503.05661","last_updated":"2025-03-31T21:44:54Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T17:21:25.899142Z","submitted_at":"2025-03-07T18:23:40Z","title":"Graph parameters that are coarsely equivalent to path-length"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:2503.05661."}