{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:NJGOV474V6QWOQYDYRMDGZF3JP","short_pith_number":"pith:NJGOV474","canonical_record":{"source":{"id":"quant-ph/0611021","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-11-02T01:20:42Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"59625aa9ce303de07b99b2259f3f92e13b90e6dcb4fb86491b8f44fee76b8ea2","abstract_canon_sha256":"5ad285f1199e6667a34c8689f9544ab2356edc6a50dc4365a5fb4f0e2b0272aa"},"schema_version":"1.0"},"canonical_sha256":"6a4ceaf3fcafa1674303c4583364bb4bea2a7ad2b24403ecf096fca22a697ff1","source":{"kind":"arxiv","id":"quant-ph/0611021","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0611021","created_at":"2026-07-04T14:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0611021v2","created_at":"2026-07-04T14:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0611021","created_at":"2026-07-04T14:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"NJGOV474V6QW","created_at":"2026-07-04T14:58:08Z"},{"alias_kind":"pith_short_16","alias_value":"NJGOV474V6QWOQYD","created_at":"2026-07-04T14:58:08Z"},{"alias_kind":"pith_short_8","alias_value":"NJGOV474","created_at":"2026-07-04T14:58:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:NJGOV474V6QWOQYDYRMDGZF3JP","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0611021","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-11-02T01:20:42Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"59625aa9ce303de07b99b2259f3f92e13b90e6dcb4fb86491b8f44fee76b8ea2","abstract_canon_sha256":"5ad285f1199e6667a34c8689f9544ab2356edc6a50dc4365a5fb4f0e2b0272aa"},"schema_version":"1.0"},"canonical_sha256":"6a4ceaf3fcafa1674303c4583364bb4bea2a7ad2b24403ecf096fca22a697ff1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:58:08.477202Z","signature_b64":"kdqpd7HPMN7go7FoxIidH4RotqjYdSBklwiy3O0FxNrJuqjFX3clm1rKN0oUdpRz6gxjSNobPtpFSpbcqWU+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a4ceaf3fcafa1674303c4583364bb4bea2a7ad2b24403ecf096fca22a697ff1","last_reissued_at":"2026-07-04T14:58:08.476829Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:58:08.476829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0611021","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-07-04T14:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+1iT9FYwe4W3GrTY9lTuVcid4HuZF/W9iL+fHZCkERObBdiwnTzPJMIVctui0CUPwXo5BrO1+2qNnleo0OZ/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:46:32.930765Z"},"content_sha256":"558a0617e39fcbe5862e20bf0180f3d4e048c53a0c209b02bfca0b0574562adf","schema_version":"1.0","event_id":"sha256:558a0617e39fcbe5862e20bf0180f3d4e048c53a0c209b02bfca0b0574562adf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:NJGOV474V6QWOQYDYRMDGZF3JP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Merlin-Arthur Games and Stoquastic Complexity","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Arvid J. Bessen, Barbara M. Terhal, Sergey Bravyi","submitted_at":"2006-11-02T01:20:42Z","abstract_excerpt":"MA is a class of decision problems for which `yes'-instances have a proof that can be efficiently checked by a classical randomized algorithm. We prove that MA has a natural complete problem which we call the stoquastic k-SAT problem. This is a matrix-valued analogue of the satisfiability problem in which clauses are k-qubit projectors with non-negative matrix elements, while a satisfying assignment is a vector that belongs to the space spanned by these projectors. Stoquastic k-SAT is the first non-trivial example of a MA-complete problem. We also study the minimum eigenvalue problem for local"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0611021","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0611021/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFJm9eBBUfYqz9vsjivYXw/Rt8TUMq+kpBHECLvT2etlgkbWBC/6NHuxMZe7UA0VtFFv8FuJWkKU6Ek1q4vmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:46:32.932079Z"},"content_sha256":"abbe565c3b0f4e3c98d69769a1b40f7d3a019fcd4448c91fa84b92358b9eaa9e","schema_version":"1.0","event_id":"sha256:abbe565c3b0f4e3c98d69769a1b40f7d3a019fcd4448c91fa84b92358b9eaa9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJGOV474V6QWOQYDYRMDGZF3JP/bundle.json","state_url":"https://pith.science/pith/NJGOV474V6QWOQYDYRMDGZF3JP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJGOV474V6QWOQYDYRMDGZF3JP/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-08-09T15:46:32Z","links":{"resolver":"https://pith.science/pith/NJGOV474V6QWOQYDYRMDGZF3JP","bundle":"https://pith.science/pith/NJGOV474V6QWOQYDYRMDGZF3JP/bundle.json","state":"https://pith.science/pith/NJGOV474V6QWOQYDYRMDGZF3JP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJGOV474V6QWOQYDYRMDGZF3JP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:NJGOV474V6QWOQYDYRMDGZF3JP","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":"5ad285f1199e6667a34c8689f9544ab2356edc6a50dc4365a5fb4f0e2b0272aa","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"2006-11-02T01:20:42Z","title_canon_sha256":"59625aa9ce303de07b99b2259f3f92e13b90e6dcb4fb86491b8f44fee76b8ea2"},"schema_version":"1.0","source":{"id":"quant-ph/0611021","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0611021","created_at":"2026-07-04T14:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0611021v2","created_at":"2026-07-04T14:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0611021","created_at":"2026-07-04T14:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"NJGOV474V6QW","created_at":"2026-07-04T14:58:08Z"},{"alias_kind":"pith_short_16","alias_value":"NJGOV474V6QWOQYD","created_at":"2026-07-04T14:58:08Z"},{"alias_kind":"pith_short_8","alias_value":"NJGOV474","created_at":"2026-07-04T14:58:08Z"}],"graph_snapshots":[{"event_id":"sha256:abbe565c3b0f4e3c98d69769a1b40f7d3a019fcd4448c91fa84b92358b9eaa9e","target":"graph","created_at":"2026-07-04T14:58:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0611021/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"MA is a class of decision problems for which `yes'-instances have a proof that can be efficiently checked by a classical randomized algorithm. We prove that MA has a natural complete problem which we call the stoquastic k-SAT problem. This is a matrix-valued analogue of the satisfiability problem in which clauses are k-qubit projectors with non-negative matrix elements, while a satisfying assignment is a vector that belongs to the space spanned by these projectors. Stoquastic k-SAT is the first non-trivial example of a MA-complete problem. We also study the minimum eigenvalue problem for local","authors_text":"Arvid J. Bessen, Barbara M. Terhal, Sergey Bravyi","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2006-11-02T01:20:42Z","title":"Merlin-Arthur Games and Stoquastic Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0611021","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:558a0617e39fcbe5862e20bf0180f3d4e048c53a0c209b02bfca0b0574562adf","target":"record","created_at":"2026-07-04T14:58:08Z","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":"5ad285f1199e6667a34c8689f9544ab2356edc6a50dc4365a5fb4f0e2b0272aa","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"2006-11-02T01:20:42Z","title_canon_sha256":"59625aa9ce303de07b99b2259f3f92e13b90e6dcb4fb86491b8f44fee76b8ea2"},"schema_version":"1.0","source":{"id":"quant-ph/0611021","kind":"arxiv","version":2}},"canonical_sha256":"6a4ceaf3fcafa1674303c4583364bb4bea2a7ad2b24403ecf096fca22a697ff1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a4ceaf3fcafa1674303c4583364bb4bea2a7ad2b24403ecf096fca22a697ff1","first_computed_at":"2026-07-04T14:58:08.476829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:58:08.476829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kdqpd7HPMN7go7FoxIidH4RotqjYdSBklwiy3O0FxNrJuqjFX3clm1rKN0oUdpRz6gxjSNobPtpFSpbcqWU+Bw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:58:08.477202Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0611021","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:558a0617e39fcbe5862e20bf0180f3d4e048c53a0c209b02bfca0b0574562adf","sha256:abbe565c3b0f4e3c98d69769a1b40f7d3a019fcd4448c91fa84b92358b9eaa9e"],"state_sha256":"9a9388f69f60ffb995a5d77f292793cb3f04a77330df6a7d34e122bafead0099"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/eUbAXPLLaFLjJor28Zq2IHEduOWiJqCvApPmgqXckiFRuXS89RBb406yB0ob8KR39OvzG5KO7l+/42rNzsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T15:46:32.945375Z","bundle_sha256":"21eb4093cb2d108317a2afee438c28479afceff8205ddfa705c75fcd4c11c112"}}