{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AAYNSQUVMDSQX6JCBJCIAUXI2W","short_pith_number":"pith:AAYNSQUV","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"},"canonical_sha256":"0030d9429560e50bf9220a448052e8d58f0ae34005aefa4ff6e1b86a050066d4","source":{"kind":"arxiv","id":"1302.0290","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0290","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0290v1","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0290","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"AAYNSQUVMDSQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AAYNSQUVMDSQX6JC","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AAYNSQUV","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AAYNSQUVMDSQX6JCBJCIAUXI2W","target":"record","payload":{"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"},"canonical_sha256":"0030d9429560e50bf9220a448052e8d58f0ae34005aefa4ff6e1b86a050066d4","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"},"source_kind":"arxiv","source_id":"1302.0290","source_version":1,"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-18T02:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZgFW3kLGSXvUKwHVe186a4FrudHgPs23Lwmk0XsCFngcBwCkFfGZRcGsA1lKey7YfSthUvOt5fq0dsgU+o6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:35:03.072643Z"},"content_sha256":"0ee93e8d1d4b8298705200cae4bd16e39fd73ce238deefee9efff8e184925fd7","schema_version":"1.0","event_id":"sha256:0ee93e8d1d4b8298705200cae4bd16e39fd73ce238deefee9efff8e184925fd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AAYNSQUVMDSQX6JCBJCIAUXI2W","target":"graph","payload":{"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"},"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-18T02:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AeWTdoJV3N2QCs6pNJjrwf6IXUsJ7xK5Sw9zur4e1PgzIBCr12VVWz7OXcDzCARk+oEOOMRjTxPw2P+ohEhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:35:03.073302Z"},"content_sha256":"1144025ad868b6f2d0af95d9c891eb4a957c2f20bb52839c9761d0e6af29a999","schema_version":"1.0","event_id":"sha256:1144025ad868b6f2d0af95d9c891eb4a957c2f20bb52839c9761d0e6af29a999"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W/bundle.json","state_url":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W/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-08T09:35:03Z","links":{"resolver":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W","bundle":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W/bundle.json","state":"https://pith.science/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AAYNSQUVMDSQX6JCBJCIAUXI2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AAYNSQUVMDSQX6JCBJCIAUXI2W","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":"8a57b4f25cbe60e0d645d200bc071faa8b4f43bfd99e48e76ec526277120a37f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-01T21:07:21Z","title_canon_sha256":"7e6b3fe9dc200373158efe78cca3d33b2554908693a0cd7ea381f199a68fe233"},"schema_version":"1.0","source":{"id":"1302.0290","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0290","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0290v1","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0290","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"AAYNSQUVMDSQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AAYNSQUVMDSQX6JC","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AAYNSQUV","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:1144025ad868b6f2d0af95d9c891eb4a957c2f20bb52839c9761d0e6af29a999","target":"graph","created_at":"2026-05-18T02:39:54Z","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":"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.","authors_text":"Daniel Nagaj, David Gosset","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-01T21:07:21Z","title":"Quantum 3-SAT is QMA1-complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0290","kind":"arxiv","version":1},"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:0ee93e8d1d4b8298705200cae4bd16e39fd73ce238deefee9efff8e184925fd7","target":"record","created_at":"2026-05-18T02:39:54Z","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":"8a57b4f25cbe60e0d645d200bc071faa8b4f43bfd99e48e76ec526277120a37f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-01T21:07:21Z","title_canon_sha256":"7e6b3fe9dc200373158efe78cca3d33b2554908693a0cd7ea381f199a68fe233"},"schema_version":"1.0","source":{"id":"1302.0290","kind":"arxiv","version":1}},"canonical_sha256":"0030d9429560e50bf9220a448052e8d58f0ae34005aefa4ff6e1b86a050066d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0030d9429560e50bf9220a448052e8d58f0ae34005aefa4ff6e1b86a050066d4","first_computed_at":"2026-05-18T02:39:54.341552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:54.341552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dqSyTHtrcToJeYWeET5ejpV0otl2DUVsueDLtzqkSTy+/0dLLHljkld/yUKAd5dt8hL8YLbAF2AcQpcMr2pZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:54.342106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0290","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ee93e8d1d4b8298705200cae4bd16e39fd73ce238deefee9efff8e184925fd7","sha256:1144025ad868b6f2d0af95d9c891eb4a957c2f20bb52839c9761d0e6af29a999"],"state_sha256":"9baeb47ce9a538cdce738ac938441bd2de6225e4ced2185084f5e3080a65bb5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23n5lqTPr/2L4ZuCpa12aYBiig+d3cY7ogLDHIlhI69yji//zAmIfMEmQGOC3WaWsw7Fc7QptkpN5yzOD1kPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:35:03.076988Z","bundle_sha256":"ad7ada5eb2870fba3fab3002f3e32d2ad63c7d67d8bcc4ea00dc6f8cb6e834f4"}}