{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:S6Q3NS4EXEBXG7HMCDQJBPNXNO","short_pith_number":"pith:S6Q3NS4E","schema_version":"1.0","canonical_sha256":"97a1b6cb84b903737cec10e090bdb76bb6e015e754e8dff295a9fb04f4857aef","source":{"kind":"arxiv","id":"1507.05061","version":2},"attestation_state":"computed","paper":{"title":"A Polynomial Time Bounded-error Quantum Algorithm for Boolean Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ahmed Younes, Jonathan E. Rowe","submitted_at":"2015-07-16T10:22:11Z","abstract_excerpt":"The aim of the paper is to answer a long-standing open problem on the relationship between NP and BQP. The paper shows that BQP contains NP by proposing a BQP quantum algorithm for the MAX-E3-SAT problem which is a fundamental NP-hard problem. Given an E3-CNF Boolean formula, the aim of the MAX-E3-SAT problem is to find the variable assignment that maximizes the number of satisfied clauses. The proposed algorithm runs in $O(m^2)$ for an E3-CNF Boolean formula with $m$ clauses and in the worst case runs in $O(n^6)$ for an E3-CNF Boolean formula with $n$ inputs. The proposed algorithm maximizes "},"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":"1507.05061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-16T10:22:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"248b0c420375f18626dddeaaf6d5694089f01c8a1bec11b9f84b0431b4c44bb1","abstract_canon_sha256":"e7c7ca33eb3d993385c64bdae09eb8f8bc84916ad0d0f8ff1c202ccaca3e5228"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:17.680581Z","signature_b64":"u/8CDtEMQil6gfcQd2RP3nyMEtN06jdZZfSrpI2PbOXHDDLY58Cr4462XWmfV/3lB63bkFsHIFxIWqgUDmk4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97a1b6cb84b903737cec10e090bdb76bb6e015e754e8dff295a9fb04f4857aef","last_reissued_at":"2026-05-18T01:36:17.679936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:17.679936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Polynomial Time Bounded-error Quantum Algorithm for Boolean Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ahmed Younes, Jonathan E. Rowe","submitted_at":"2015-07-16T10:22:11Z","abstract_excerpt":"The aim of the paper is to answer a long-standing open problem on the relationship between NP and BQP. The paper shows that BQP contains NP by proposing a BQP quantum algorithm for the MAX-E3-SAT problem which is a fundamental NP-hard problem. Given an E3-CNF Boolean formula, the aim of the MAX-E3-SAT problem is to find the variable assignment that maximizes the number of satisfied clauses. The proposed algorithm runs in $O(m^2)$ for an E3-CNF Boolean formula with $m$ clauses and in the worst case runs in $O(n^6)$ for an E3-CNF Boolean formula with $n$ inputs. The proposed algorithm maximizes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05061","kind":"arxiv","version":2},"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":"1507.05061","created_at":"2026-05-18T01:36:17.680043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05061v2","created_at":"2026-05-18T01:36:17.680043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05061","created_at":"2026-05-18T01:36:17.680043+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6Q3NS4EXEBX","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6Q3NS4EXEBXG7HM","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6Q3NS4E","created_at":"2026-05-18T12:29:39.896362+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/S6Q3NS4EXEBXG7HMCDQJBPNXNO","json":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO.json","graph_json":"https://pith.science/api/pith-number/S6Q3NS4EXEBXG7HMCDQJBPNXNO/graph.json","events_json":"https://pith.science/api/pith-number/S6Q3NS4EXEBXG7HMCDQJBPNXNO/events.json","paper":"https://pith.science/paper/S6Q3NS4E"},"agent_actions":{"view_html":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO","download_json":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO.json","view_paper":"https://pith.science/paper/S6Q3NS4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05061&json=true","fetch_graph":"https://pith.science/api/pith-number/S6Q3NS4EXEBXG7HMCDQJBPNXNO/graph.json","fetch_events":"https://pith.science/api/pith-number/S6Q3NS4EXEBXG7HMCDQJBPNXNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO/action/storage_attestation","attest_author":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO/action/author_attestation","sign_citation":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO/action/citation_signature","submit_replication":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO/action/replication_record"}},"created_at":"2026-05-18T01:36:17.680043+00:00","updated_at":"2026-05-18T01:36:17.680043+00:00"}