{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TK3APU4NYAFRVIRFHUN67DSTRW","short_pith_number":"pith:TK3APU4N","canonical_record":{"source":{"id":"2608.04446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-05T04:47:16Z","cross_cats_sorted":[],"title_canon_sha256":"c33101e04d578aca503d091d861f926f7309abce0c7342dcb04f425b7783df07","abstract_canon_sha256":"07dffbeaff24c0d71a4da8077ebf14bfc82f9139063544b19d44edf66db87deb"},"schema_version":"1.0"},"canonical_sha256":"9ab607d38dc00b1aa2253d1bef8e538d86a4441c868a2c99a1b8dc603c3c8a34","source":{"kind":"arxiv","id":"2608.04446","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04446","created_at":"2026-08-06T01:35:27Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04446v1","created_at":"2026-08-06T01:35:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04446","created_at":"2026-08-06T01:35:27Z"},{"alias_kind":"pith_short_12","alias_value":"TK3APU4NYAFR","created_at":"2026-08-06T01:35:27Z"},{"alias_kind":"pith_short_16","alias_value":"TK3APU4NYAFRVIRF","created_at":"2026-08-06T01:35:27Z"},{"alias_kind":"pith_short_8","alias_value":"TK3APU4N","created_at":"2026-08-06T01:35:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TK3APU4NYAFRVIRFHUN67DSTRW","target":"record","payload":{"canonical_record":{"source":{"id":"2608.04446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-05T04:47:16Z","cross_cats_sorted":[],"title_canon_sha256":"c33101e04d578aca503d091d861f926f7309abce0c7342dcb04f425b7783df07","abstract_canon_sha256":"07dffbeaff24c0d71a4da8077ebf14bfc82f9139063544b19d44edf66db87deb"},"schema_version":"1.0"},"canonical_sha256":"9ab607d38dc00b1aa2253d1bef8e538d86a4441c868a2c99a1b8dc603c3c8a34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:35:27.508346Z","signature_b64":"gt+0EWNcjjC+hWwIvJ+8zYtfDEduY4fIwkqIFmMokMkU+qPpXcSf3JzGvr2TOrQ8fiBTr0d8LK/5DxRiH14ZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ab607d38dc00b1aa2253d1bef8e538d86a4441c868a2c99a1b8dc603c3c8a34","last_reissued_at":"2026-08-06T01:35:27.506670Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:35:27.506670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.04446","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-08-06T01:35:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"giF2qt/LoboJj8Rwkcwb8fmgeTHInRny2qecxX4iJLXvQ1zNHi220kF+Ayfc6ESz9WJ0T+l1XsiVeqRHvK79BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:04:34.023570Z"},"content_sha256":"65920eb54a967a4d1113d39ef3481678a3604c984557f6230bea3f09c197e855","schema_version":"1.0","event_id":"sha256:65920eb54a967a4d1113d39ef3481678a3604c984557f6230bea3f09c197e855"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TK3APU4NYAFRVIRFHUN67DSTRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aneta Neumann, Frank Neumann, Hung Nguyen, Jialiang Li, Mingyu Guo","submitted_at":"2026-08-05T04:47:16Z","abstract_excerpt":"Treewidth is a fundamental graph invariant that quantifies how tree-like a given graph is. It is extensively used with dynamic programming to design fixed-parameter tractable algorithms for many NP-hard graph combinatorial optimization problems. However, despite broad theoretical applicability, treewidth dynamic programming (TDP) does not scale in practice beyond graphs with very small treewidth. Rather than applying TDP as a standalone technique, in this paper, we demonstrate that TDP can serve as a broadly applicable enhancer for a wide range of graph combinatorial optimization algorithms. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04446","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/2608.04446/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-08-06T01:35:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U9U3nDCCJVLehJye3w/DMqYNFkyVXMMmC92NpwrTm956dUjzBb/uqVwpQhC3IK1eNpY6FyyIkr3w7AsE/CFlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:04:34.024147Z"},"content_sha256":"8ed9f86d3cc52cd64bd73d97ffe1bf9c1fd6dd82db01f65a458953bc6527e516","schema_version":"1.0","event_id":"sha256:8ed9f86d3cc52cd64bd73d97ffe1bf9c1fd6dd82db01f65a458953bc6527e516"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW/bundle.json","state_url":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TK3APU4NYAFRVIRFHUN67DSTRW/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-19T05:04:34Z","links":{"resolver":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW","bundle":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW/bundle.json","state":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TK3APU4NYAFRVIRFHUN67DSTRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TK3APU4NYAFRVIRFHUN67DSTRW","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":"07dffbeaff24c0d71a4da8077ebf14bfc82f9139063544b19d44edf66db87deb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-05T04:47:16Z","title_canon_sha256":"c33101e04d578aca503d091d861f926f7309abce0c7342dcb04f425b7783df07"},"schema_version":"1.0","source":{"id":"2608.04446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04446","created_at":"2026-08-06T01:35:27Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04446v1","created_at":"2026-08-06T01:35:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04446","created_at":"2026-08-06T01:35:27Z"},{"alias_kind":"pith_short_12","alias_value":"TK3APU4NYAFR","created_at":"2026-08-06T01:35:27Z"},{"alias_kind":"pith_short_16","alias_value":"TK3APU4NYAFRVIRF","created_at":"2026-08-06T01:35:27Z"},{"alias_kind":"pith_short_8","alias_value":"TK3APU4N","created_at":"2026-08-06T01:35:27Z"}],"graph_snapshots":[{"event_id":"sha256:8ed9f86d3cc52cd64bd73d97ffe1bf9c1fd6dd82db01f65a458953bc6527e516","target":"graph","created_at":"2026-08-06T01:35:27Z","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/2608.04446/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Treewidth is a fundamental graph invariant that quantifies how tree-like a given graph is. It is extensively used with dynamic programming to design fixed-parameter tractable algorithms for many NP-hard graph combinatorial optimization problems. However, despite broad theoretical applicability, treewidth dynamic programming (TDP) does not scale in practice beyond graphs with very small treewidth. Rather than applying TDP as a standalone technique, in this paper, we demonstrate that TDP can serve as a broadly applicable enhancer for a wide range of graph combinatorial optimization algorithms. O","authors_text":"Aneta Neumann, Frank Neumann, Hung Nguyen, Jialiang Li, Mingyu Guo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04446","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:65920eb54a967a4d1113d39ef3481678a3604c984557f6230bea3f09c197e855","target":"record","created_at":"2026-08-06T01:35:27Z","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":"07dffbeaff24c0d71a4da8077ebf14bfc82f9139063544b19d44edf66db87deb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-05T04:47:16Z","title_canon_sha256":"c33101e04d578aca503d091d861f926f7309abce0c7342dcb04f425b7783df07"},"schema_version":"1.0","source":{"id":"2608.04446","kind":"arxiv","version":1}},"canonical_sha256":"9ab607d38dc00b1aa2253d1bef8e538d86a4441c868a2c99a1b8dc603c3c8a34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ab607d38dc00b1aa2253d1bef8e538d86a4441c868a2c99a1b8dc603c3c8a34","first_computed_at":"2026-08-06T01:35:27.506670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-06T01:35:27.506670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gt+0EWNcjjC+hWwIvJ+8zYtfDEduY4fIwkqIFmMokMkU+qPpXcSf3JzGvr2TOrQ8fiBTr0d8LK/5DxRiH14ZBA==","signature_status":"signed_v1","signed_at":"2026-08-06T01:35:27.508346Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.04446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65920eb54a967a4d1113d39ef3481678a3604c984557f6230bea3f09c197e855","sha256:8ed9f86d3cc52cd64bd73d97ffe1bf9c1fd6dd82db01f65a458953bc6527e516"],"state_sha256":"2fdfbde1184ba27af8199d037e087ab93ae8ad20d68fc5b51e407fe14f63b418"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjgH0RRKUU42lGlzqb0koBC5uORyR+8vdk/6tNAwbb1gP+hLrSWuP//Yl+prapnhEXv0LEm6YbjJiPZf1fwOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T05:04:34.028579Z","bundle_sha256":"5bcc8175401f556f5a6e149b81c3241babd8fa1ca4e8e3e0e81b6ffe4bc171ff"}}