{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TK3APU4NYAFRVIRFHUN67DSTRW","short_pith_number":"pith:TK3APU4N","schema_version":"1.0","canonical_sha256":"9ab607d38dc00b1aa2253d1bef8e538d86a4441c868a2c99a1b8dc603c3c8a34","source":{"kind":"arxiv","id":"2608.04446","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.04446","created_at":"2026-08-06T01:35:27.508479+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.04446v1","created_at":"2026-08-06T01:35:27.508479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04446","created_at":"2026-08-06T01:35:27.508479+00:00"},{"alias_kind":"pith_short_12","alias_value":"TK3APU4NYAFR","created_at":"2026-08-06T01:35:27.508479+00:00"},{"alias_kind":"pith_short_16","alias_value":"TK3APU4NYAFRVIRF","created_at":"2026-08-06T01:35:27.508479+00:00"},{"alias_kind":"pith_short_8","alias_value":"TK3APU4N","created_at":"2026-08-06T01:35:27.508479+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/TK3APU4NYAFRVIRFHUN67DSTRW","json":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW.json","graph_json":"https://pith.science/api/pith-number/TK3APU4NYAFRVIRFHUN67DSTRW/graph.json","events_json":"https://pith.science/api/pith-number/TK3APU4NYAFRVIRFHUN67DSTRW/events.json","paper":"https://pith.science/paper/TK3APU4N"},"agent_actions":{"view_html":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW","download_json":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW.json","view_paper":"https://pith.science/paper/TK3APU4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.04446&json=true","fetch_graph":"https://pith.science/api/pith-number/TK3APU4NYAFRVIRFHUN67DSTRW/graph.json","fetch_events":"https://pith.science/api/pith-number/TK3APU4NYAFRVIRFHUN67DSTRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW/action/storage_attestation","attest_author":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW/action/author_attestation","sign_citation":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW/action/citation_signature","submit_replication":"https://pith.science/pith/TK3APU4NYAFRVIRFHUN67DSTRW/action/replication_record"}},"created_at":"2026-08-06T01:35:27.508479+00:00","updated_at":"2026-08-06T01:35:27.508479+00:00"}