{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6BWG5EMU6KFJOPIETASCFLPXG3","short_pith_number":"pith:6BWG5EMU","canonical_record":{"source":{"id":"2607.27601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T02:43:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5d47f8ac4aa7c336186b45bdb73631d1836950f190908c62af1c2b7a282b5248","abstract_canon_sha256":"e6b22a88fa259d56e2f69c16bc36934b0ec08c8e3310ff9259139f7c55ec7e65"},"schema_version":"1.0"},"canonical_sha256":"f06c6e9194f28a973d04982422adf736cea9686afaea33984e7cc706b76ca3af","source":{"kind":"arxiv","id":"2607.27601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27601","created_at":"2026-07-31T01:27:04Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27601v1","created_at":"2026-07-31T01:27:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27601","created_at":"2026-07-31T01:27:04Z"},{"alias_kind":"pith_short_12","alias_value":"6BWG5EMU6KFJ","created_at":"2026-07-31T01:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"6BWG5EMU6KFJOPIE","created_at":"2026-07-31T01:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"6BWG5EMU","created_at":"2026-07-31T01:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6BWG5EMU6KFJOPIETASCFLPXG3","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T02:43:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5d47f8ac4aa7c336186b45bdb73631d1836950f190908c62af1c2b7a282b5248","abstract_canon_sha256":"e6b22a88fa259d56e2f69c16bc36934b0ec08c8e3310ff9259139f7c55ec7e65"},"schema_version":"1.0"},"canonical_sha256":"f06c6e9194f28a973d04982422adf736cea9686afaea33984e7cc706b76ca3af","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f06c6e9194f28a973d04982422adf736cea9686afaea33984e7cc706b76ca3af","last_reissued_at":"2026-07-31T01:27:04.045299Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:27:04.045299Z"},"source_kind":"arxiv","source_id":"2607.27601","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-07-31T01:27:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fhxlQZxd6dHJywf7dTGfyGYSmfhON3AhznKdcjV6jzCM084Gyhc3WvQUJPvZakF8yvLid2klyv8SeqG765x7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:02:42.461814Z"},"content_sha256":"0c67a80d2e08b6c889722cb82083c75d38c12d9afe782b61ab5f8f24362c50c0","schema_version":"1.0","event_id":"sha256:0c67a80d2e08b6c889722cb82083c75d38c12d9afe782b61ab5f8f24362c50c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6BWG5EMU6KFJOPIETASCFLPXG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal tree-decompositions with bags of bounded pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood, J\\k{e}drzej Hodor, Kevin Hendrey, Robert Hickingbotham","submitted_at":"2026-07-30T02:43:49Z","abstract_excerpt":"We show that every planar graph has a tree-decomposition with optimal width such that the subgraph induced by each bag has pathwidth at most 3. This bound is best possible, and for tree-decompositions that satisfy a certain minimality condition, we in fact give a precise description of the possible structures in each bag. Moreover, we show that the union of any $k$ bags has pathwidth $O(k)$. We also show that graphs excluding a fixed double-apex-forest minor have a tree-decomposition with optimal width such that the subgraph induced by each bag has bounded pathwidth. This includes graphs embed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27601","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/2607.27601/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-07-31T01:27:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVBPYSS6S6z36yOo7wtOCbdRacu7K9WHpKpPsc28RWjXoI4yWYcM62MDmuQMmUYvm9ZM+SWqon2SgejvbKFcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:02:42.462342Z"},"content_sha256":"26215158a133b061660e434982b674e25edb8e544ee87693773076504d85f189","schema_version":"1.0","event_id":"sha256:26215158a133b061660e434982b674e25edb8e544ee87693773076504d85f189"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BWG5EMU6KFJOPIETASCFLPXG3/bundle.json","state_url":"https://pith.science/pith/6BWG5EMU6KFJOPIETASCFLPXG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BWG5EMU6KFJOPIETASCFLPXG3/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-05T07:02:42Z","links":{"resolver":"https://pith.science/pith/6BWG5EMU6KFJOPIETASCFLPXG3","bundle":"https://pith.science/pith/6BWG5EMU6KFJOPIETASCFLPXG3/bundle.json","state":"https://pith.science/pith/6BWG5EMU6KFJOPIETASCFLPXG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BWG5EMU6KFJOPIETASCFLPXG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6BWG5EMU6KFJOPIETASCFLPXG3","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":"e6b22a88fa259d56e2f69c16bc36934b0ec08c8e3310ff9259139f7c55ec7e65","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T02:43:49Z","title_canon_sha256":"5d47f8ac4aa7c336186b45bdb73631d1836950f190908c62af1c2b7a282b5248"},"schema_version":"1.0","source":{"id":"2607.27601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27601","created_at":"2026-07-31T01:27:04Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27601v1","created_at":"2026-07-31T01:27:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27601","created_at":"2026-07-31T01:27:04Z"},{"alias_kind":"pith_short_12","alias_value":"6BWG5EMU6KFJ","created_at":"2026-07-31T01:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"6BWG5EMU6KFJOPIE","created_at":"2026-07-31T01:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"6BWG5EMU","created_at":"2026-07-31T01:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:26215158a133b061660e434982b674e25edb8e544ee87693773076504d85f189","target":"graph","created_at":"2026-07-31T01:27:04Z","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/2607.27601/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that every planar graph has a tree-decomposition with optimal width such that the subgraph induced by each bag has pathwidth at most 3. This bound is best possible, and for tree-decompositions that satisfy a certain minimality condition, we in fact give a precise description of the possible structures in each bag. Moreover, we show that the union of any $k$ bags has pathwidth $O(k)$. We also show that graphs excluding a fixed double-apex-forest minor have a tree-decomposition with optimal width such that the subgraph induced by each bag has bounded pathwidth. This includes graphs embed","authors_text":"David R. Wood, J\\k{e}drzej Hodor, Kevin Hendrey, Robert Hickingbotham","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27601","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:0c67a80d2e08b6c889722cb82083c75d38c12d9afe782b61ab5f8f24362c50c0","target":"record","created_at":"2026-07-31T01:27:04Z","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":"e6b22a88fa259d56e2f69c16bc36934b0ec08c8e3310ff9259139f7c55ec7e65","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T02:43:49Z","title_canon_sha256":"5d47f8ac4aa7c336186b45bdb73631d1836950f190908c62af1c2b7a282b5248"},"schema_version":"1.0","source":{"id":"2607.27601","kind":"arxiv","version":1}},"canonical_sha256":"f06c6e9194f28a973d04982422adf736cea9686afaea33984e7cc706b76ca3af","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f06c6e9194f28a973d04982422adf736cea9686afaea33984e7cc706b76ca3af","first_computed_at":"2026-07-31T01:27:04.045299Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:27:04.045299Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c67a80d2e08b6c889722cb82083c75d38c12d9afe782b61ab5f8f24362c50c0","sha256:26215158a133b061660e434982b674e25edb8e544ee87693773076504d85f189"],"state_sha256":"64fcf0dbd38225019a1e969d2eadaa72b955fc03a24364692a804fa3db9a9517"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8iwJZvOBimogKGcmtN81XC0/pBU0iMNW651Nt12J7FLv6ElbFFkvcqLuue+BBw3tDUMqXO8bCj8jNURYiYOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T07:02:42.468930Z","bundle_sha256":"47e1cd8bfcbafe98d9e9c8cc39f1e910b35de7434702b993a63cb60b1ba19a3d"}}