{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PUFWPNTFAGIVWKTO6SYRAGQM55","short_pith_number":"pith:PUFWPNTF","schema_version":"1.0","canonical_sha256":"7d0b67b66501915b2a6ef4b1101a0cef41a9aec2e01cb8447bf55574aba65c40","source":{"kind":"arxiv","id":"1509.01014","version":1},"attestation_state":"computed","paper":{"title":"On the Equivalence among Problems of Bounded Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Yoichi Iwata, Yuichi Yoshida","submitted_at":"2015-09-03T09:58:50Z","abstract_excerpt":"In this paper, we introduce a methodology, called decomposition-based reductions, for showing the equivalence among various problems of bounded-width.\n  First, we show that the following are equivalent for any $\\alpha > 0$:\n  * SAT can be solved in $O^*(2^{\\alpha \\mathrm{tw}})$ time,\n  * 3-SAT can be solved in $O^*(2^{\\alpha \\mathrm{tw}})$ time,\n  * Max 2-SAT can be solved in $O^*(2^{\\alpha \\mathrm{tw}})$ time,\n  * Independent Set can be solved in $O^*(2^{\\alpha \\mathrm{tw}})$ time, and\n  * Independent Set can be solved in $O^*(2^{\\alpha \\mathrm{cw}})$ time, where tw and cw are the tree-width "},"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":"1509.01014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-03T09:58:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"647fab13af30958022f784e2db22b0a1b4bcfee4b292de0a2eb2d51a49939d2e","abstract_canon_sha256":"fb57ac5593ad96bebf4386b1b717cc6fa096297ec63a89ae4482d2f41c55e845"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:04.532177Z","signature_b64":"o47Npm/z7b0Hmu644Si2QMv5GMjr3jc+VsdQFlnjnQIV9CojcbuIfRsKQIuPHcwEm1Vq/t/rHdVA96xr7VBZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d0b67b66501915b2a6ef4b1101a0cef41a9aec2e01cb8447bf55574aba65c40","last_reissued_at":"2026-05-18T01:34:04.531509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:04.531509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Equivalence among Problems of Bounded Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Yoichi Iwata, Yuichi Yoshida","submitted_at":"2015-09-03T09:58:50Z","abstract_excerpt":"In this paper, we introduce a methodology, called decomposition-based reductions, for showing the equivalence among various problems of bounded-width.\n  First, we show that the following are equivalent for any $\\alpha > 0$:\n  * SAT can be solved in $O^*(2^{\\alpha \\mathrm{tw}})$ time,\n  * 3-SAT can be solved in $O^*(2^{\\alpha \\mathrm{tw}})$ time,\n  * Max 2-SAT can be solved in $O^*(2^{\\alpha \\mathrm{tw}})$ time,\n  * Independent Set can be solved in $O^*(2^{\\alpha \\mathrm{tw}})$ time, and\n  * Independent Set can be solved in $O^*(2^{\\alpha \\mathrm{cw}})$ time, where tw and cw are the tree-width "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01014","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":""},"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":"1509.01014","created_at":"2026-05-18T01:34:04.531616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01014v1","created_at":"2026-05-18T01:34:04.531616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01014","created_at":"2026-05-18T01:34:04.531616+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUFWPNTFAGIV","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUFWPNTFAGIVWKTO","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUFWPNTF","created_at":"2026-05-18T12:29:37.295048+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/PUFWPNTFAGIVWKTO6SYRAGQM55","json":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55.json","graph_json":"https://pith.science/api/pith-number/PUFWPNTFAGIVWKTO6SYRAGQM55/graph.json","events_json":"https://pith.science/api/pith-number/PUFWPNTFAGIVWKTO6SYRAGQM55/events.json","paper":"https://pith.science/paper/PUFWPNTF"},"agent_actions":{"view_html":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55","download_json":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55.json","view_paper":"https://pith.science/paper/PUFWPNTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01014&json=true","fetch_graph":"https://pith.science/api/pith-number/PUFWPNTFAGIVWKTO6SYRAGQM55/graph.json","fetch_events":"https://pith.science/api/pith-number/PUFWPNTFAGIVWKTO6SYRAGQM55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55/action/storage_attestation","attest_author":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55/action/author_attestation","sign_citation":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55/action/citation_signature","submit_replication":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55/action/replication_record"}},"created_at":"2026-05-18T01:34:04.531616+00:00","updated_at":"2026-05-18T01:34:04.531616+00:00"}