{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AAYNSQUVMDSQX6JCBJCIAUXI2W","short_pith_number":"pith:AAYNSQUV","schema_version":"1.0","canonical_sha256":"0030d9429560e50bf9220a448052e8d58f0ae34005aefa4ff6e1b86a050066d4","source":{"kind":"arxiv","id":"1302.0290","version":1},"attestation_state":"computed","paper":{"title":"Quantum 3-SAT is QMA1-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daniel Nagaj, David Gosset","submitted_at":"2013-02-01T21:07:21Z","abstract_excerpt":"Quantum satisfiability is a constraint satisfaction problem that generalizes classical boolean satisfiability. In the quantum k-SAT problem, each constraint is specified by a k-local projector and is satisfied by any state in its nullspace. Bravyi showed that quantum 2-SAT can be solved efficiently on a classical computer and that quantum k-SAT with k greater than or equal to 4 is QMA1-complete. Quantum 3-SAT was known to be contained in QMA1, but its computational hardness was unknown until now. We prove that quantum 3-SAT is QMA1-hard, and therefore complete for this complexity class."},"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":"1302.0290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-01T21:07:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7e6b3fe9dc200373158efe78cca3d33b2554908693a0cd7ea381f199a68fe233","abstract_canon_sha256":"8a57b4f25cbe60e0d645d200bc071faa8b4f43bfd99e48e76ec526277120a37f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:54.342106Z","signature_b64":"dqSyTHtrcToJeYWeET5ejpV0otl2DUVsueDLtzqkSTy+/0dLLHljkld/yUKAd5dt8hL8YLbAF2AcQpcMr2pZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0030d9429560e50bf9220a448052e8d58f0ae34005aefa4ff6e1b86a050066d4","last_reissued_at":"2026-05-18T02:39:54.341552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:54.341552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum 3-SAT is QMA1-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daniel Nagaj, David Gosset","submitted_at":"2013-02-01T21:07:21Z","abstract_excerpt":"Quantum satisfiability is a constraint satisfaction problem that generalizes classical boolean satisfiability. In the quantum k-SAT problem, each constraint is specified by a k-local projector and is satisfied by any state in its nullspace. Bravyi showed that quantum 2-SAT can be solved efficiently on a classical computer and that quantum k-SAT with k greater than or equal to 4 is QMA1-complete. Quantum 3-SAT was known to be contained in QMA1, but its computational hardness was unknown until now. We prove that quantum 3-SAT is QMA1-hard, and therefore complete for this complexity class."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0290","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":"1302.0290","created_at":"2026-05-18T02:39:54.341646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0290v1","created_at":"2026-05-18T02:39:54.341646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0290","created_at":"2026-05-18T02:39:54.341646+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAYNSQUVMDSQ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAYNSQUVMDSQX6JC","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAYNSQUV","created_at":"2026-05-18T12:27:38.830355+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/AAYNSQUVMDSQX6JCBJCIAUXI2W","json":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W.json","graph_json":"https://pith.science/api/pith-number/AAYNSQUVMDSQX6JCBJCIAUXI2W/graph.json","events_json":"https://pith.science/api/pith-number/AAYNSQUVMDSQX6JCBJCIAUXI2W/events.json","paper":"https://pith.science/paper/AAYNSQUV"},"agent_actions":{"view_html":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W","download_json":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W.json","view_paper":"https://pith.science/paper/AAYNSQUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0290&json=true","fetch_graph":"https://pith.science/api/pith-number/AAYNSQUVMDSQX6JCBJCIAUXI2W/graph.json","fetch_events":"https://pith.science/api/pith-number/AAYNSQUVMDSQX6JCBJCIAUXI2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W/action/storage_attestation","attest_author":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W/action/author_attestation","sign_citation":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W/action/citation_signature","submit_replication":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W/action/replication_record"}},"created_at":"2026-05-18T02:39:54.341646+00:00","updated_at":"2026-05-18T02:39:54.341646+00:00"}