{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VRW5GA5LWVPZX6LWR2NGMEL6BQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"93b72812fa2f5a7d85cb13884ea56c620c00580de3659361f173ce3532d17b8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-10T18:06:04Z","title_canon_sha256":"d6f963eb0ef536a5e8c3cdd1a0972f12699ef88a72ea6b4359910e0ddb35d7dc"},"schema_version":"1.0","source":{"id":"2309.05100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.05100","created_at":"2026-07-05T06:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"2309.05100v1","created_at":"2026-07-05T06:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.05100","created_at":"2026-07-05T06:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"VRW5GA5LWVPZ","created_at":"2026-07-05T06:49:30Z"},{"alias_kind":"pith_short_16","alias_value":"VRW5GA5LWVPZX6LW","created_at":"2026-07-05T06:49:30Z"},{"alias_kind":"pith_short_8","alias_value":"VRW5GA5L","created_at":"2026-07-05T06:49:30Z"}],"graph_snapshots":[{"event_id":"sha256:d5a4a6744cb21edd51e37df67753507d7d58c63fc7a74a7d07372d27fb5ea8a9","target":"graph","created_at":"2026-07-05T06:49:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.05100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"P. Seymour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-10T18:06:04Z","title":"A shorter proof of the path-width theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.05100","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e293cfd8cf2de948b33b2c2ca47aebdce1619410d686dc6917544cf0445e59ef","target":"record","created_at":"2026-07-05T06:49:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"93b72812fa2f5a7d85cb13884ea56c620c00580de3659361f173ce3532d17b8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-10T18:06:04Z","title_canon_sha256":"d6f963eb0ef536a5e8c3cdd1a0972f12699ef88a72ea6b4359910e0ddb35d7dc"},"schema_version":"1.0","source":{"id":"2309.05100","kind":"arxiv","version":1}},"canonical_sha256":"ac6dd303abb55f9bf9768e9a66117e0c0302c2c5fe6a08ed44c168835298ebdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac6dd303abb55f9bf9768e9a66117e0c0302c2c5fe6a08ed44c168835298ebdc","first_computed_at":"2026-07-05T06:49:30.970403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:49:30.970403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XSjZS9ioyPTkbHEsnTl0InuV+oUgOyu8qyMDNnrRMQb6PborGcyUQbzqJa+VyPggdbpSicPi5F8jAQh9J8bDBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:49:30.970836Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.05100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e293cfd8cf2de948b33b2c2ca47aebdce1619410d686dc6917544cf0445e59ef","sha256:d5a4a6744cb21edd51e37df67753507d7d58c63fc7a74a7d07372d27fb5ea8a9"],"state_sha256":"1d6434d46df7f7d86460098f42247ad5054547c776c6e70a01a5413066101b5d"}