{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JVO4VPOZOWXIKEMZDXVO3V4K6G","short_pith_number":"pith:JVO4VPOZ","canonical_record":{"source":{"id":"2605.27780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T00:00:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0e9d38156cd9e9aa6c801e27b71030cb8cfc26128dee7ff82a457753d8b00873","abstract_canon_sha256":"1356bb4e5f4f638bbfc36d6941be62301bf35a57aa25b1eb06a8778c677f6d00"},"schema_version":"1.0"},"canonical_sha256":"4d5dcabdd975ae8511991deaedd78af1b51b16bd865db91665b65d5eebdb655a","source":{"kind":"arxiv","id":"2605.27780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27780","created_at":"2026-05-28T01:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27780v1","created_at":"2026-05-28T01:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27780","created_at":"2026-05-28T01:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"JVO4VPOZOWXI","created_at":"2026-05-28T01:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"JVO4VPOZOWXIKEMZ","created_at":"2026-05-28T01:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"JVO4VPOZ","created_at":"2026-05-28T01:04:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JVO4VPOZOWXIKEMZDXVO3V4K6G","target":"record","payload":{"canonical_record":{"source":{"id":"2605.27780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T00:00:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0e9d38156cd9e9aa6c801e27b71030cb8cfc26128dee7ff82a457753d8b00873","abstract_canon_sha256":"1356bb4e5f4f638bbfc36d6941be62301bf35a57aa25b1eb06a8778c677f6d00"},"schema_version":"1.0"},"canonical_sha256":"4d5dcabdd975ae8511991deaedd78af1b51b16bd865db91665b65d5eebdb655a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:48.584995Z","signature_b64":"Eje7GAorfLbHzrrRttrsgqE8YkpqPRqBFu0NraLOXznKWF9CNiSTQRpvFARGQFVunY/4zMdWrGlsqwmRJfbKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d5dcabdd975ae8511991deaedd78af1b51b16bd865db91665b65d5eebdb655a","last_reissued_at":"2026-05-28T01:04:48.584675Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:48.584675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.27780","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CeFyZk0lh6CMHYIef+KGkuOpxO9q6Ln0pm6tUzJOe8LdapSkXb/e3jCKjRJ1AeHNzvFDDR61+yCm4wR3ZHhbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:09:47.483047Z"},"content_sha256":"ee97b73265b92868ddce2e7d25b2002d3a7e17551be365218ee1091664d48eec","schema_version":"1.0","event_id":"sha256:ee97b73265b92868ddce2e7d25b2002d3a7e17551be365218ee1091664d48eec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JVO4VPOZOWXIKEMZDXVO3V4K6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-partitions of graphs with given pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood","submitted_at":"2026-05-27T00:00:21Z","abstract_excerpt":"Graphs with bounded treewidth and bounded maximum degree are known to have tree-partitions of bounded width. What can be said if the bounded treewidth assumption is strengthened to bounded pathwidth? We prove that every graph with bounded pathwidth and bounded maximum degree has a tree-partition of bounded width, with the extra property that the underlying tree has bounded pathwidth. Moreover, we prove a lower bound showing that the bound on the pathwidth of the underlying tree is within a constant factor of optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27780","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/2605.27780/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrJchgZxXruyWOzPmFg5Mjrm0qRKqrn3K601udUQszZ6mD7WpNnpxv/VkvJhn02oNLlHwXBZ/ta146X8m8VfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:09:47.483605Z"},"content_sha256":"bfde7fe726de17e5045fe848d9cc33e947647ecbf773de1c75f27c584b977736","schema_version":"1.0","event_id":"sha256:bfde7fe726de17e5045fe848d9cc33e947647ecbf773de1c75f27c584b977736"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVO4VPOZOWXIKEMZDXVO3V4K6G/bundle.json","state_url":"https://pith.science/pith/JVO4VPOZOWXIKEMZDXVO3V4K6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVO4VPOZOWXIKEMZDXVO3V4K6G/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T18:09:47Z","links":{"resolver":"https://pith.science/pith/JVO4VPOZOWXIKEMZDXVO3V4K6G","bundle":"https://pith.science/pith/JVO4VPOZOWXIKEMZDXVO3V4K6G/bundle.json","state":"https://pith.science/pith/JVO4VPOZOWXIKEMZDXVO3V4K6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVO4VPOZOWXIKEMZDXVO3V4K6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JVO4VPOZOWXIKEMZDXVO3V4K6G","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":"1356bb4e5f4f638bbfc36d6941be62301bf35a57aa25b1eb06a8778c677f6d00","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T00:00:21Z","title_canon_sha256":"0e9d38156cd9e9aa6c801e27b71030cb8cfc26128dee7ff82a457753d8b00873"},"schema_version":"1.0","source":{"id":"2605.27780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27780","created_at":"2026-05-28T01:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27780v1","created_at":"2026-05-28T01:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27780","created_at":"2026-05-28T01:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"JVO4VPOZOWXI","created_at":"2026-05-28T01:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"JVO4VPOZOWXIKEMZ","created_at":"2026-05-28T01:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"JVO4VPOZ","created_at":"2026-05-28T01:04:48Z"}],"graph_snapshots":[{"event_id":"sha256:bfde7fe726de17e5045fe848d9cc33e947647ecbf773de1c75f27c584b977736","target":"graph","created_at":"2026-05-28T01:04:48Z","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/2605.27780/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graphs with bounded treewidth and bounded maximum degree are known to have tree-partitions of bounded width. What can be said if the bounded treewidth assumption is strengthened to bounded pathwidth? We prove that every graph with bounded pathwidth and bounded maximum degree has a tree-partition of bounded width, with the extra property that the underlying tree has bounded pathwidth. Moreover, we prove a lower bound showing that the bound on the pathwidth of the underlying tree is within a constant factor of optimal.","authors_text":"David R. Wood","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27780","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:ee97b73265b92868ddce2e7d25b2002d3a7e17551be365218ee1091664d48eec","target":"record","created_at":"2026-05-28T01:04:48Z","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":"1356bb4e5f4f638bbfc36d6941be62301bf35a57aa25b1eb06a8778c677f6d00","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T00:00:21Z","title_canon_sha256":"0e9d38156cd9e9aa6c801e27b71030cb8cfc26128dee7ff82a457753d8b00873"},"schema_version":"1.0","source":{"id":"2605.27780","kind":"arxiv","version":1}},"canonical_sha256":"4d5dcabdd975ae8511991deaedd78af1b51b16bd865db91665b65d5eebdb655a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d5dcabdd975ae8511991deaedd78af1b51b16bd865db91665b65d5eebdb655a","first_computed_at":"2026-05-28T01:04:48.584675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:48.584675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eje7GAorfLbHzrrRttrsgqE8YkpqPRqBFu0NraLOXznKWF9CNiSTQRpvFARGQFVunY/4zMdWrGlsqwmRJfbKAg==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:48.584995Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.27780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee97b73265b92868ddce2e7d25b2002d3a7e17551be365218ee1091664d48eec","sha256:bfde7fe726de17e5045fe848d9cc33e947647ecbf773de1c75f27c584b977736"],"state_sha256":"8146d76cc2635cbaca2970087a2b2540a93bf8bc7550ebe147eab540a7dc37e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgoQoC5Z1Z8PlEsgWlhjPKGInx5UPyFVVqgo4o3SmxhjlYW4lC3qsAbbq2lhhx9jvyU5XPSMA2CpTP/VlxC/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T18:09:47.488867Z","bundle_sha256":"b2dd0e28c865c1473e47568ede17b4efcb253f3ffe5ba2fc420021a03c1348a3"}}