{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VRW5GA5LWVPZX6LWR2NGMEL6BQ","short_pith_number":"pith:VRW5GA5L","schema_version":"1.0","canonical_sha256":"ac6dd303abb55f9bf9768e9a66117e0c0302c2c5fe6a08ed44c168835298ebdc","source":{"kind":"arxiv","id":"2309.05100","version":1},"attestation_state":"computed","paper":{"title":"A shorter proof of the path-width theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P. Seymour","submitted_at":"2023-09-10T18:06:04Z","abstract_excerpt":"A graph has {\\em path-width} at most $w$ if it can be built from a sequence of graphs each with at most $w+1$ vertices, by overlapping consecutive terms. Every graph with path-width at least $w-1$ contains every $w$-vertex forest as a minor: this was originally proved by Bienstock, Robertson, Thomas and the author, and was given a short proof by Diestel. Here we give a proof even shorter and simpler than that of Diestel."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2309.05100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-10T18:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"d6f963eb0ef536a5e8c3cdd1a0972f12699ef88a72ea6b4359910e0ddb35d7dc","abstract_canon_sha256":"93b72812fa2f5a7d85cb13884ea56c620c00580de3659361f173ce3532d17b8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:49:30.970836Z","signature_b64":"XSjZS9ioyPTkbHEsnTl0InuV+oUgOyu8qyMDNnrRMQb6PborGcyUQbzqJa+VyPggdbpSicPi5F8jAQh9J8bDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac6dd303abb55f9bf9768e9a66117e0c0302c2c5fe6a08ed44c168835298ebdc","last_reissued_at":"2026-07-05T06:49:30.970403Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:49:30.970403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A shorter proof of the path-width theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P. Seymour","submitted_at":"2023-09-10T18:06:04Z","abstract_excerpt":"A graph has {\\em path-width} at most $w$ if it can be built from a sequence of graphs each with at most $w+1$ vertices, by overlapping consecutive terms. Every graph with path-width at least $w-1$ contains every $w$-vertex forest as a minor: this was originally proved by Bienstock, Robertson, Thomas and the author, and was given a short proof by Diestel. Here we give a proof even shorter and simpler than that of Diestel."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.05100","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.05100/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.05100","created_at":"2026-07-05T06:49:30.970481+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.05100v1","created_at":"2026-07-05T06:49:30.970481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.05100","created_at":"2026-07-05T06:49:30.970481+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRW5GA5LWVPZ","created_at":"2026-07-05T06:49:30.970481+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRW5GA5LWVPZX6LW","created_at":"2026-07-05T06:49:30.970481+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRW5GA5L","created_at":"2026-07-05T06:49:30.970481+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VRW5GA5LWVPZX6LWR2NGMEL6BQ","json":"https://pith.science/pith/VRW5GA5LWVPZX6LWR2NGMEL6BQ.json","graph_json":"https://pith.science/api/pith-number/VRW5GA5LWVPZX6LWR2NGMEL6BQ/graph.json","events_json":"https://pith.science/api/pith-number/VRW5GA5LWVPZX6LWR2NGMEL6BQ/events.json","paper":"https://pith.science/paper/VRW5GA5L"},"agent_actions":{"view_html":"https://pith.science/pith/VRW5GA5LWVPZX6LWR2NGMEL6BQ","download_json":"https://pith.science/pith/VRW5GA5LWVPZX6LWR2NGMEL6BQ.json","view_paper":"https://pith.science/paper/VRW5GA5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.05100&json=true","fetch_graph":"https://pith.science/api/pith-number/VRW5GA5LWVPZX6LWR2NGMEL6BQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VRW5GA5LWVPZX6LWR2NGMEL6BQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRW5GA5LWVPZX6LWR2NGMEL6BQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRW5GA5LWVPZX6LWR2NGMEL6BQ/action/storage_attestation","attest_author":"https://pith.science/pith/VRW5GA5LWVPZX6LWR2NGMEL6BQ/action/author_attestation","sign_citation":"https://pith.science/pith/VRW5GA5LWVPZX6LWR2NGMEL6BQ/action/citation_signature","submit_replication":"https://pith.science/pith/VRW5GA5LWVPZX6LWR2NGMEL6BQ/action/replication_record"}},"created_at":"2026-07-05T06:49:30.970481+00:00","updated_at":"2026-07-05T06:49:30.970481+00:00"}