{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TY7LG6Z3JGGTBNFYJK5CAOD2OH","short_pith_number":"pith:TY7LG6Z3","schema_version":"1.0","canonical_sha256":"9e3eb37b3b498d30b4b84aba20387a71dd59a41d9dc26cb74cf2da1fc8d3d7ec","source":{"kind":"arxiv","id":"1108.2385","version":1},"attestation_state":"computed","paper":{"title":"Width-parameterized SAT: Time-Space Tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bangsheng Tang, Periklis Papakonstantinou, Shiteng Chen, Tiancheng Lou","submitted_at":"2011-08-11T12:18:26Z","abstract_excerpt":"Width parameterizations of SAT, such as tree-width and path-width, enable the study of computationally more tractable and practical SAT instances. We give two simple algorithms. One that runs simultaneously in time-space $(O^*(2^{2tw(\\phi)}), O^*(2^{tw(\\phi)}))$ and another that runs in time-space $(O^*(3^{tw(\\phi)\\log{|\\phi|}}),|\\phi|^{O(1)})$, where $tw(\\phi)$ is the tree-width of a formula $\\phi$ with $|\\phi|$ many clauses and variables. This partially answers the question of Alekhnovitch and Razborov, who also gave algorithms exponential both in time and space, and asked whether the space "},"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":"1108.2385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-11T12:18:26Z","cross_cats_sorted":[],"title_canon_sha256":"9122e550ada3fba8349017114813b4590726075c7e3cd4af9354a8390a6a6a7c","abstract_canon_sha256":"9c6a8b5e6be8d5ef6d605593b195a43f791cf7daafd18f0051ee816510dcb88d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:37.853163Z","signature_b64":"oPlkJnOOjpG/D+hfKcOI7UrBBV2MN79LriE5m3/aRm2m5qEqMU94i3yH7a4oGLIdsGkwdXqs5Kgm503ZGvH8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e3eb37b3b498d30b4b84aba20387a71dd59a41d9dc26cb74cf2da1fc8d3d7ec","last_reissued_at":"2026-05-18T04:15:37.852353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:37.852353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Width-parameterized SAT: Time-Space Tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bangsheng Tang, Periklis Papakonstantinou, Shiteng Chen, Tiancheng Lou","submitted_at":"2011-08-11T12:18:26Z","abstract_excerpt":"Width parameterizations of SAT, such as tree-width and path-width, enable the study of computationally more tractable and practical SAT instances. We give two simple algorithms. One that runs simultaneously in time-space $(O^*(2^{2tw(\\phi)}), O^*(2^{tw(\\phi)}))$ and another that runs in time-space $(O^*(3^{tw(\\phi)\\log{|\\phi|}}),|\\phi|^{O(1)})$, where $tw(\\phi)$ is the tree-width of a formula $\\phi$ with $|\\phi|$ many clauses and variables. This partially answers the question of Alekhnovitch and Razborov, who also gave algorithms exponential both in time and space, and asked whether the space "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2385","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":"1108.2385","created_at":"2026-05-18T04:15:37.852488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2385v1","created_at":"2026-05-18T04:15:37.852488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2385","created_at":"2026-05-18T04:15:37.852488+00:00"},{"alias_kind":"pith_short_12","alias_value":"TY7LG6Z3JGGT","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TY7LG6Z3JGGTBNFY","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TY7LG6Z3","created_at":"2026-05-18T12:26:42.757692+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/TY7LG6Z3JGGTBNFYJK5CAOD2OH","json":"https://pith.science/pith/TY7LG6Z3JGGTBNFYJK5CAOD2OH.json","graph_json":"https://pith.science/api/pith-number/TY7LG6Z3JGGTBNFYJK5CAOD2OH/graph.json","events_json":"https://pith.science/api/pith-number/TY7LG6Z3JGGTBNFYJK5CAOD2OH/events.json","paper":"https://pith.science/paper/TY7LG6Z3"},"agent_actions":{"view_html":"https://pith.science/pith/TY7LG6Z3JGGTBNFYJK5CAOD2OH","download_json":"https://pith.science/pith/TY7LG6Z3JGGTBNFYJK5CAOD2OH.json","view_paper":"https://pith.science/paper/TY7LG6Z3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2385&json=true","fetch_graph":"https://pith.science/api/pith-number/TY7LG6Z3JGGTBNFYJK5CAOD2OH/graph.json","fetch_events":"https://pith.science/api/pith-number/TY7LG6Z3JGGTBNFYJK5CAOD2OH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TY7LG6Z3JGGTBNFYJK5CAOD2OH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TY7LG6Z3JGGTBNFYJK5CAOD2OH/action/storage_attestation","attest_author":"https://pith.science/pith/TY7LG6Z3JGGTBNFYJK5CAOD2OH/action/author_attestation","sign_citation":"https://pith.science/pith/TY7LG6Z3JGGTBNFYJK5CAOD2OH/action/citation_signature","submit_replication":"https://pith.science/pith/TY7LG6Z3JGGTBNFYJK5CAOD2OH/action/replication_record"}},"created_at":"2026-05-18T04:15:37.852488+00:00","updated_at":"2026-05-18T04:15:37.852488+00:00"}