{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PUFWPNTFAGIVWKTO6SYRAGQM55","short_pith_number":"pith:PUFWPNTF","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"},"canonical_sha256":"7d0b67b66501915b2a6ef4b1101a0cef41a9aec2e01cb8447bf55574aba65c40","source":{"kind":"arxiv","id":"1509.01014","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01014","created_at":"2026-05-18T01:34:04Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01014v1","created_at":"2026-05-18T01:34:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01014","created_at":"2026-05-18T01:34:04Z"},{"alias_kind":"pith_short_12","alias_value":"PUFWPNTFAGIV","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PUFWPNTFAGIVWKTO","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PUFWPNTF","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PUFWPNTFAGIVWKTO6SYRAGQM55","target":"record","payload":{"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"},"canonical_sha256":"7d0b67b66501915b2a6ef4b1101a0cef41a9aec2e01cb8447bf55574aba65c40","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"},"source_kind":"arxiv","source_id":"1509.01014","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-05-18T01:34:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XI4yWGDtgXc0KGo8QlcRHXTgCYtck+9WaixAbEQk5pHx0M/hhEBruLrVO37u1SNDilsipq/XaPtvoQLow7zCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:10.564473Z"},"content_sha256":"8747987cfde7a401bbe37a49bf153626a4f6a77a10a234af7e90cbcdb0fad9ab","schema_version":"1.0","event_id":"sha256:8747987cfde7a401bbe37a49bf153626a4f6a77a10a234af7e90cbcdb0fad9ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PUFWPNTFAGIVWKTO6SYRAGQM55","target":"graph","payload":{"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"},"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-05-18T01:34:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bcYNeBYKenrAxh4CsNT2wSTYTP4Tx3Y70jXe55uLis2wWtcabzpk/H+ot2Za8Nr4z8vPYzw/04UqO5KsYBo2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:10.565052Z"},"content_sha256":"29525ba6574572d9f3ccded49c84a0ce39d649bfdc8eb0928580ddcd47e30851","schema_version":"1.0","event_id":"sha256:29525ba6574572d9f3ccded49c84a0ce39d649bfdc8eb0928580ddcd47e30851"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55/bundle.json","state_url":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUFWPNTFAGIVWKTO6SYRAGQM55/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-05-30T06:54:10Z","links":{"resolver":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55","bundle":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55/bundle.json","state":"https://pith.science/pith/PUFWPNTFAGIVWKTO6SYRAGQM55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUFWPNTFAGIVWKTO6SYRAGQM55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PUFWPNTFAGIVWKTO6SYRAGQM55","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":"fb57ac5593ad96bebf4386b1b717cc6fa096297ec63a89ae4482d2f41c55e845","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-03T09:58:50Z","title_canon_sha256":"647fab13af30958022f784e2db22b0a1b4bcfee4b292de0a2eb2d51a49939d2e"},"schema_version":"1.0","source":{"id":"1509.01014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01014","created_at":"2026-05-18T01:34:04Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01014v1","created_at":"2026-05-18T01:34:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01014","created_at":"2026-05-18T01:34:04Z"},{"alias_kind":"pith_short_12","alias_value":"PUFWPNTFAGIV","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PUFWPNTFAGIVWKTO","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PUFWPNTF","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:29525ba6574572d9f3ccded49c84a0ce39d649bfdc8eb0928580ddcd47e30851","target":"graph","created_at":"2026-05-18T01:34: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"},"paper":{"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 ","authors_text":"Yoichi Iwata, Yuichi Yoshida","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-03T09:58:50Z","title":"On the Equivalence among Problems of Bounded Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01014","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:8747987cfde7a401bbe37a49bf153626a4f6a77a10a234af7e90cbcdb0fad9ab","target":"record","created_at":"2026-05-18T01:34: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":"fb57ac5593ad96bebf4386b1b717cc6fa096297ec63a89ae4482d2f41c55e845","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-03T09:58:50Z","title_canon_sha256":"647fab13af30958022f784e2db22b0a1b4bcfee4b292de0a2eb2d51a49939d2e"},"schema_version":"1.0","source":{"id":"1509.01014","kind":"arxiv","version":1}},"canonical_sha256":"7d0b67b66501915b2a6ef4b1101a0cef41a9aec2e01cb8447bf55574aba65c40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d0b67b66501915b2a6ef4b1101a0cef41a9aec2e01cb8447bf55574aba65c40","first_computed_at":"2026-05-18T01:34:04.531509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:04.531509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o47Npm/z7b0Hmu644Si2QMv5GMjr3jc+VsdQFlnjnQIV9CojcbuIfRsKQIuPHcwEm1Vq/t/rHdVA96xr7VBZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:04.532177Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8747987cfde7a401bbe37a49bf153626a4f6a77a10a234af7e90cbcdb0fad9ab","sha256:29525ba6574572d9f3ccded49c84a0ce39d649bfdc8eb0928580ddcd47e30851"],"state_sha256":"988be94220c03a4b38421326328c5307fab0e093bce37f55b6bd8e388375a97c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FoNaK6TnHE6v6i6t/WQSNewY499h6ApEL170Y559us/4yKptvdBI1yvmKUHrBxAmJYJ0QreLP6GHC7aFJ6KVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:54:10.567780Z","bundle_sha256":"7bf543a19f3b83e8f7de9541e180d0d5c52a74c1232d14ba86e5833e7ba33f0d"}}