{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2BOOGVVAWD7QJANNRN4VUM3PDL","short_pith_number":"pith:2BOOGVVA","schema_version":"1.0","canonical_sha256":"d05ce356a0b0ff0481ad8b795a336f1ae004e910b0b817356e96bd0b0df123d0","source":{"kind":"arxiv","id":"1512.00859","version":2},"attestation_state":"computed","paper":{"title":"Faster than Classical Quantum Algorithm for dense Formulas of Exact Satisfiability and Occupation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, Gian Giacomo Guerreschi, Salvatore Mandr\\`a","submitted_at":"2015-12-02T21:00:10Z","abstract_excerpt":"We present an exact quantum algorithm for solving the Exact Satisfiability (XSAT) problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: First, the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the XSAT; Second, a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to certify that no solution exists) or to count the total number of valid assignments. The query comple"},"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":"1512.00859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-02T21:00:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3c97bb6fba852286cc101cb82a5d93c3af7300b318deb6b6184df05725f56272","abstract_canon_sha256":"e431a33c5bcb3f8007dbd3c20e56a7ee514188d0edd70d176979f056313f73a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:49.045025Z","signature_b64":"ZoFLAfXhwQObggPrmkgeBrLDPI8DWjzUz9ZKUqQZuwziwI+fHPDdiXvC7E8pR6K42gqKF57vIMinMrMHv/wbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d05ce356a0b0ff0481ad8b795a336f1ae004e910b0b817356e96bd0b0df123d0","last_reissued_at":"2026-05-18T01:07:49.044535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:49.044535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster than Classical Quantum Algorithm for dense Formulas of Exact Satisfiability and Occupation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, Gian Giacomo Guerreschi, Salvatore Mandr\\`a","submitted_at":"2015-12-02T21:00:10Z","abstract_excerpt":"We present an exact quantum algorithm for solving the Exact Satisfiability (XSAT) problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: First, the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the XSAT; Second, a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to certify that no solution exists) or to count the total number of valid assignments. The query comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00859","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":"1512.00859","created_at":"2026-05-18T01:07:49.044610+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.00859v2","created_at":"2026-05-18T01:07:49.044610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00859","created_at":"2026-05-18T01:07:49.044610+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BOOGVVAWD7Q","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BOOGVVAWD7QJANN","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BOOGVVA","created_at":"2026-05-18T12:28:59.999130+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/2BOOGVVAWD7QJANNRN4VUM3PDL","json":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL.json","graph_json":"https://pith.science/api/pith-number/2BOOGVVAWD7QJANNRN4VUM3PDL/graph.json","events_json":"https://pith.science/api/pith-number/2BOOGVVAWD7QJANNRN4VUM3PDL/events.json","paper":"https://pith.science/paper/2BOOGVVA"},"agent_actions":{"view_html":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL","download_json":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL.json","view_paper":"https://pith.science/paper/2BOOGVVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.00859&json=true","fetch_graph":"https://pith.science/api/pith-number/2BOOGVVAWD7QJANNRN4VUM3PDL/graph.json","fetch_events":"https://pith.science/api/pith-number/2BOOGVVAWD7QJANNRN4VUM3PDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL/action/storage_attestation","attest_author":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL/action/author_attestation","sign_citation":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL/action/citation_signature","submit_replication":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL/action/replication_record"}},"created_at":"2026-05-18T01:07:49.044610+00:00","updated_at":"2026-05-18T01:07:49.044610+00:00"}