{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2FYE7UUQGZGKCMT4QLZS2B53AY","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":"b95e1425713c1304a58562434909354d68e8753a4996f5786b1022532d751cf3","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T11:28:40Z","title_canon_sha256":"8ed53f627ecf884699e69f907aba89440e4069a049436f3bccce901f4e756545"},"schema_version":"1.0","source":{"id":"2605.17396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17396","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17396v1","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17396","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"2FYE7UUQGZGK","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"pith_short_16","alias_value":"2FYE7UUQGZGKCMT4","created_at":"2026-05-20T00:03:56Z"},{"alias_kind":"pith_short_8","alias_value":"2FYE7UUQ","created_at":"2026-05-20T00:03:56Z"}],"graph_snapshots":[{"event_id":"sha256:7cf553a28a29d3e563527f606a782f9d30053f79613b835bbfa530895c410daa","target":"graph","created_at":"2026-05-20T00:03:56Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The basic algorithm computes the branchwidth of an n-vertex hypergraph in O*(4^n) time; this is the first single-exponential time algorithm for hypergraphs. The first graph algorithm runs in O(3.293^n) time, improving the previous O(3.4652^n) bound."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The recurrence relations correctly compute branchwidth when evaluated over all subsets (or a suitable subset family) of vertices; the paper assumes the standard definition of branchwidth via separations and that the dynamic-programming table entries can be combined without additional hidden costs."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Presents the first single-exponential algorithm for hypergraph branchwidth at O*(4^n) and an improved O(3.293^n) algorithm for graphs that also outperforms prior practical implementations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"New algorithms compute the branchwidth of hypergraphs in O*(4^n) time and graphs in O(3.293^n) time."}],"snapshot_sha256":"e1beb5d2ba320751e4d0255c954089196649231071ea790cfb31fe3de7b89dcc"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"04c09a9edbf0f93e24fd661a9a414d83838c2e7c725d04aa4341d4ba33d955b8"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:19.988097Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:12:51.348383Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.757820Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.699612Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17396/integrity.json","findings":[],"snapshot_sha256":"f9bfe03d6532979b9b3a8a56cefea92ae95f8aaed9437107f9dbc3453db23b1e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present exact exponential algorithms for computing branchwidth that are fast both in theory and in practice. The running times of these algorithms are single-exponential in the number of vertices. Our basic algorithm is based on a conceptually simple recurrence on vertex sets and computes the branchwidth of an $n$-vertex hypergraph in time $\\mathcal{O}^*(4^n)$. This is the first single-exponential time algorithm for hypergraphs.\n  We have two algorithms tailored specifically for graphs. The first algorithm runs in time $\\mathcal{O}(3.293^n)$, improving upon the previously bes","authors_text":"Hisao Tamaki, Taiki Kaneda, Yasuaki Kobayashi","cross_cats":[],"headline":"New algorithms compute the branchwidth of hypergraphs in O*(4^n) time and graphs in O(3.293^n) time.","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T11:28:40Z","title":"Fast and Practical Single-Exponential Algorithms for Branchwidth"},"references":{"count":28,"internal_anchors":0,"resolved_work":28,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"CoRR , volume =","work_id":"1cd79799-ee0b-48cb-ab71-52a1a9a95b3c","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"2019 , doi =","work_id":"d8b238c0-7ead-4e1f-a278-bc95ec123527","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Computing rank-width exactly , journal =","work_id":"76eb9f99-296c-422e-9a97-317cd6496e6e","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Fedor V. Fomin and Fr. Computing branchwidth via efficient triangulations and blocks , journal =. 2009 , doi =","work_id":"a658c3e9-80e5-4877-b48f-b8fdbecf4bbf","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Hicks , title =","work_id":"bb2f8693-9455-4c0f-b860-30249a9cbdfc","year":2005}],"snapshot_sha256":"70b06c5c4049bcbcdee4c489e3eaa42541509124ea2e31db339b2f0b655b5e80"},"source":{"id":"2605.17396","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:00:42.074260Z","id":"8c5715e0-09e5-4497-b6f7-7bf95926c492","model_set":{"reader":"grok-4.3"},"one_line_summary":"Presents the first single-exponential algorithm for hypergraph branchwidth at O*(4^n) and an improved O(3.293^n) algorithm for graphs that also outperforms prior practical implementations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"New algorithms compute the branchwidth of hypergraphs in O*(4^n) time and graphs in O(3.293^n) time.","strongest_claim":"The basic algorithm computes the branchwidth of an n-vertex hypergraph in O*(4^n) time; this is the first single-exponential time algorithm for hypergraphs. The first graph algorithm runs in O(3.293^n) time, improving the previous O(3.4652^n) bound.","weakest_assumption":"The recurrence relations correctly compute branchwidth when evaluated over all subsets (or a suitable subset family) of vertices; the paper assumes the standard definition of branchwidth via separations and that the dynamic-programming table entries can be combined without additional hidden costs."}},"verdict_id":"8c5715e0-09e5-4497-b6f7-7bf95926c492"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0016dd463b0a244110dac3f8fd51ed7921e5b4705e5b5db6c76f82027e6138e3","target":"record","created_at":"2026-05-20T00:03:56Z","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":"b95e1425713c1304a58562434909354d68e8753a4996f5786b1022532d751cf3","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T11:28:40Z","title_canon_sha256":"8ed53f627ecf884699e69f907aba89440e4069a049436f3bccce901f4e756545"},"schema_version":"1.0","source":{"id":"2605.17396","kind":"arxiv","version":1}},"canonical_sha256":"d1704fd290364ca1327c82f32d07bb060c886739efd2335069a7de2e7dd141fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1704fd290364ca1327c82f32d07bb060c886739efd2335069a7de2e7dd141fe","first_computed_at":"2026-05-20T00:03:56.386924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:56.386924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5BrHWeUqEOpEj8kLUJNh3N7T7FPtHfwswtEdwiJzl45FGpp3ainOb+kvOhlwbr9+YpgnwZqwc/bAy+ib1GaoBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:56.387715Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0016dd463b0a244110dac3f8fd51ed7921e5b4705e5b5db6c76f82027e6138e3","sha256:7cf553a28a29d3e563527f606a782f9d30053f79613b835bbfa530895c410daa"],"state_sha256":"0b8682e013d87f227921da97e04ba2733244301ac397611870cb7c35521ea11d"}