{"as_of":"2026-08-15T08:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ecd46c326c4f5c953bbe665cbd740428d07cdc37a5d8e45e49e14485be20164b","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-15T06:32:42.880941+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-08-06T19:27:17.190884Z","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-05T10:39:26.679082Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.14775","last_updated":"2025-04-01T17:40:16Z","snapshot_observed_at":"2026-08-07T18:01:14.574531Z","submitted_at":"2025-02-20T17:59:36Z","title":"Every Graph is Essential to Large Treewidth","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14775","snapshot_observed_at":"2026-08-06T19:27:17.190884Z","title":"Every graph is essential to large treewidth","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.06169","last_updated":"2026-07-05T14:32:07Z","snapshot_observed_at":"2026-08-09T20:13:40.579719Z","submitted_at":"2025-07-08T16:50:13Z","title":"A simple layered-wheel-like construction","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:27:17.190884Z"},"links":{"cited_paper":"/paper/2502.14775","citing_paper":"/paper/2507.06169"},"observation_digest":"sha256:e6b540266aa13e784c96985fae4b54a4c28d29fe697c81668c84d634ecfb4822","observation_id":"8355d40c-55bb-42b5-a7b4-78f5f816407f","resolution":{"observed_at":"2026-08-06T19:27:17.190884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14775","last_updated":"2025-04-01T17:40:16Z","snapshot_observed_at":"2026-08-07T18:01:14.574531Z","submitted_at":"2025-02-20T17:59:36Z","title":"Every Graph is Essential to Large Treewidth","version":3},"cited_work":{"arxiv_id":"2502.14775","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.14775","snapshot_observed_at":"2026-08-05T10:39:26.679082Z","title":"Every Graph is Essential to Large Treewidth","venue":"math.CO","work_id":"5b88dfa5-ffee-4a7e-95f5-202891f3a715","year":2025},"citing_paper":{"arxiv_id":"2509.04026","last_updated":"2025-09-04T09:00:07Z","snapshot_observed_at":"2026-08-15T07:34:04.288432Z","submitted_at":"2025-09-04T09:00:07Z","title":"Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T10:39:25.488537Z"},"links":{"cited_paper":"/paper/2502.14775","citing_paper":"/paper/2509.04026"},"observation_digest":"sha256:593bdf19fa4c7a162d0ab5fffdba2b9dd2c8ea879b74f8fc32017c6826a66509","observation_id":"11ad81b1-17dd-482c-836e-0af68dc66cb5","resolution":{"observed_at":"2026-08-05T10:39:26.685744Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.14775/citation-record","integrity":"/paper/2502.14775/integrity","json":"/paper/2502.14775/citation-record.json","paper":"/paper/2502.14775"},"outbound":[],"paper":{"arxiv_id":"2502.14775","last_updated":"2025-04-01T17:40:16Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T18:01:14.574531Z","submitted_at":"2025-02-20T17:59:36Z","title":"Every Graph is Essential to Large Treewidth"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.14775."}