{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S6Q3NS4EXEBXG7HMCDQJBPNXNO","short_pith_number":"pith:S6Q3NS4E","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"},"canonical_sha256":"97a1b6cb84b903737cec10e090bdb76bb6e015e754e8dff295a9fb04f4857aef","source":{"kind":"arxiv","id":"1507.05061","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05061","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05061v2","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05061","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"S6Q3NS4EXEBX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S6Q3NS4EXEBXG7HM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S6Q3NS4E","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S6Q3NS4EXEBXG7HMCDQJBPNXNO","target":"record","payload":{"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"},"canonical_sha256":"97a1b6cb84b903737cec10e090bdb76bb6e015e754e8dff295a9fb04f4857aef","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"},"source_kind":"arxiv","source_id":"1507.05061","source_version":2,"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:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AveDkXYTFgjYlpExScvy5nvODhuFOAZg9TwE1ccH6/i4xt4AWYB3fJcXDgRvFRFFyIxfs4x572S2O/qtl+e7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:13:36.118727Z"},"content_sha256":"91acdb41fd6fa0ec6e5c74cf8209a98f3538a0a076fd17e9a974dbab3729ebe4","schema_version":"1.0","event_id":"sha256:91acdb41fd6fa0ec6e5c74cf8209a98f3538a0a076fd17e9a974dbab3729ebe4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S6Q3NS4EXEBXG7HMCDQJBPNXNO","target":"graph","payload":{"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"},"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:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l6Z6vDD/bhvy2F4mlz0Ye9NEjmEuAVwwNdUgdQDx4iFiyqXGGuylil5oP6vg+JzVUylp5bai9mK3BqGttU5RBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:13:36.119101Z"},"content_sha256":"9f7d33f36ac03962721dc3cdada65c800abb48052dce22f162407718fc83db69","schema_version":"1.0","event_id":"sha256:9f7d33f36ac03962721dc3cdada65c800abb48052dce22f162407718fc83db69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO/bundle.json","state_url":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO/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-06-26T17:13:36Z","links":{"resolver":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO","bundle":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO/bundle.json","state":"https://pith.science/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6Q3NS4EXEBXG7HMCDQJBPNXNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S6Q3NS4EXEBXG7HMCDQJBPNXNO","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":"e7c7ca33eb3d993385c64bdae09eb8f8bc84916ad0d0f8ff1c202ccaca3e5228","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-16T10:22:11Z","title_canon_sha256":"248b0c420375f18626dddeaaf6d5694089f01c8a1bec11b9f84b0431b4c44bb1"},"schema_version":"1.0","source":{"id":"1507.05061","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05061","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05061v2","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05061","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"S6Q3NS4EXEBX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S6Q3NS4EXEBXG7HM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S6Q3NS4E","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:9f7d33f36ac03962721dc3cdada65c800abb48052dce22f162407718fc83db69","target":"graph","created_at":"2026-05-18T01:36:17Z","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":"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 ","authors_text":"Ahmed Younes, Jonathan E. Rowe","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-16T10:22:11Z","title":"A Polynomial Time Bounded-error Quantum Algorithm for Boolean Satisfiability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05061","kind":"arxiv","version":2},"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:91acdb41fd6fa0ec6e5c74cf8209a98f3538a0a076fd17e9a974dbab3729ebe4","target":"record","created_at":"2026-05-18T01:36:17Z","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":"e7c7ca33eb3d993385c64bdae09eb8f8bc84916ad0d0f8ff1c202ccaca3e5228","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-16T10:22:11Z","title_canon_sha256":"248b0c420375f18626dddeaaf6d5694089f01c8a1bec11b9f84b0431b4c44bb1"},"schema_version":"1.0","source":{"id":"1507.05061","kind":"arxiv","version":2}},"canonical_sha256":"97a1b6cb84b903737cec10e090bdb76bb6e015e754e8dff295a9fb04f4857aef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97a1b6cb84b903737cec10e090bdb76bb6e015e754e8dff295a9fb04f4857aef","first_computed_at":"2026-05-18T01:36:17.679936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:17.679936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u/8CDtEMQil6gfcQd2RP3nyMEtN06jdZZfSrpI2PbOXHDDLY58Cr4462XWmfV/3lB63bkFsHIFxIWqgUDmk4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:17.680581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05061","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91acdb41fd6fa0ec6e5c74cf8209a98f3538a0a076fd17e9a974dbab3729ebe4","sha256:9f7d33f36ac03962721dc3cdada65c800abb48052dce22f162407718fc83db69"],"state_sha256":"99b9164a9894d3777bb6858608a6dd0d007ccd1af168b54a1a6dae0f757acbd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"czfjko7JvRWg/Msok6pzDK+erzEOO5DSlnRk7XC+8ze4Z+S7UOgIPRzFuZvABFCqQcqzSCDOpmY77ad3JXgLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T17:13:36.121455Z","bundle_sha256":"a84840b190da967a8fb6b8384a7421cef4e26fb818d973f8cef118dc76b19c5d"}}