{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZZ2D7OLDFM3O3PE3B4U4FCIOA2","short_pith_number":"pith:ZZ2D7OLD","canonical_record":{"source":{"id":"1308.5788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-27T08:08:54Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"edbb56a1909a44b5fb93b4f330b9252fb325de58c358e6ea9217de412ad7c971","abstract_canon_sha256":"a5c0773ebf558f1d70721323c6510679fe7d4faffc82ca850d189db764bdbf28"},"schema_version":"1.0"},"canonical_sha256":"ce743fb9632b36edbc9b0f29c2890e06a8d16017b12447255b0ececadf7c3eff","source":{"kind":"arxiv","id":"1308.5788","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5788","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5788v2","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5788","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ2D7OLDFM3O","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ2D7OLDFM3O3PE3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ2D7OLD","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZZ2D7OLDFM3O3PE3B4U4FCIOA2","target":"record","payload":{"canonical_record":{"source":{"id":"1308.5788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-27T08:08:54Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"edbb56a1909a44b5fb93b4f330b9252fb325de58c358e6ea9217de412ad7c971","abstract_canon_sha256":"a5c0773ebf558f1d70721323c6510679fe7d4faffc82ca850d189db764bdbf28"},"schema_version":"1.0"},"canonical_sha256":"ce743fb9632b36edbc9b0f29c2890e06a8d16017b12447255b0ececadf7c3eff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:20.078213Z","signature_b64":"LUoFC9EbIfGnMYxVNc4GIHftiUTtqBosSZZI8SBJN6282EwcVEBQ7WmfNpl7WHVNs9igaskYNjohR+UjsUG0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce743fb9632b36edbc9b0f29c2890e06a8d16017b12447255b0ececadf7c3eff","last_reissued_at":"2026-05-18T02:20:20.077740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:20.077740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.5788","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-18T02:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vH3jml4SZ7/7aTfnE+ZNKfAAe1q2rnBIR4+XLDM9g6LmgWCOxTEWHa1db9fnY4e/+3c0QnQP/7EXVDK6acLqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:14:13.351655Z"},"content_sha256":"e462891d408dcade384dd5424158ca2ec9a2265c0c88d8b18bf31d8c6ab75867","schema_version":"1.0","event_id":"sha256:e462891d408dcade384dd5424158ca2ec9a2265c0c88d8b18bf31d8c6ab75867"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZZ2D7OLDFM3O3PE3B4U4FCIOA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum interactive proofs and the complexity of separability testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Gus Gutoski, Kevin Milner, Mark M. Wilde, Patrick Hayden","submitted_at":"2013-08-27T08:08:54Z","abstract_excerpt":"We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum interactive proof complexity class (including BQP, QMA, QMA(2), and QSZK), there corresponds a natural separability testing problem that is complete for that class. Of particular interest is the fact that the problem of determining whether an isometry can be made to produce a separable state is either QMA-complete or QMA(2)-complete, depending upon whether the dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5788","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-18T02:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wURdEXD1IRsMCf+7b0MmaiwI4jUVhbL9EAO2qrMMvriCZeJfnQ30qaLKPj5qeUj48aojxiOy9/yG2IIhLPySDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:14:13.352287Z"},"content_sha256":"03d6519dea7157319788b351067c38386d45d995d7d6aa8bf3e6a61c35b0c521","schema_version":"1.0","event_id":"sha256:03d6519dea7157319788b351067c38386d45d995d7d6aa8bf3e6a61c35b0c521"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZ2D7OLDFM3O3PE3B4U4FCIOA2/bundle.json","state_url":"https://pith.science/pith/ZZ2D7OLDFM3O3PE3B4U4FCIOA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZ2D7OLDFM3O3PE3B4U4FCIOA2/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-05-25T19:14:13Z","links":{"resolver":"https://pith.science/pith/ZZ2D7OLDFM3O3PE3B4U4FCIOA2","bundle":"https://pith.science/pith/ZZ2D7OLDFM3O3PE3B4U4FCIOA2/bundle.json","state":"https://pith.science/pith/ZZ2D7OLDFM3O3PE3B4U4FCIOA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZ2D7OLDFM3O3PE3B4U4FCIOA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZZ2D7OLDFM3O3PE3B4U4FCIOA2","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":"a5c0773ebf558f1d70721323c6510679fe7d4faffc82ca850d189db764bdbf28","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-27T08:08:54Z","title_canon_sha256":"edbb56a1909a44b5fb93b4f330b9252fb325de58c358e6ea9217de412ad7c971"},"schema_version":"1.0","source":{"id":"1308.5788","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5788","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5788v2","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5788","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ2D7OLDFM3O","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ2D7OLDFM3O3PE3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ2D7OLD","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:03d6519dea7157319788b351067c38386d45d995d7d6aa8bf3e6a61c35b0c521","target":"graph","created_at":"2026-05-18T02:20:20Z","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":"We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum interactive proof complexity class (including BQP, QMA, QMA(2), and QSZK), there corresponds a natural separability testing problem that is complete for that class. Of particular interest is the fact that the problem of determining whether an isometry can be made to produce a separable state is either QMA-complete or QMA(2)-complete, depending upon whether the dist","authors_text":"Gus Gutoski, Kevin Milner, Mark M. Wilde, Patrick Hayden","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-27T08:08:54Z","title":"Quantum interactive proofs and the complexity of separability testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5788","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:e462891d408dcade384dd5424158ca2ec9a2265c0c88d8b18bf31d8c6ab75867","target":"record","created_at":"2026-05-18T02:20:20Z","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":"a5c0773ebf558f1d70721323c6510679fe7d4faffc82ca850d189db764bdbf28","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-27T08:08:54Z","title_canon_sha256":"edbb56a1909a44b5fb93b4f330b9252fb325de58c358e6ea9217de412ad7c971"},"schema_version":"1.0","source":{"id":"1308.5788","kind":"arxiv","version":2}},"canonical_sha256":"ce743fb9632b36edbc9b0f29c2890e06a8d16017b12447255b0ececadf7c3eff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce743fb9632b36edbc9b0f29c2890e06a8d16017b12447255b0ececadf7c3eff","first_computed_at":"2026-05-18T02:20:20.077740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:20.077740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LUoFC9EbIfGnMYxVNc4GIHftiUTtqBosSZZI8SBJN6282EwcVEBQ7WmfNpl7WHVNs9igaskYNjohR+UjsUG0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:20.078213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5788","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e462891d408dcade384dd5424158ca2ec9a2265c0c88d8b18bf31d8c6ab75867","sha256:03d6519dea7157319788b351067c38386d45d995d7d6aa8bf3e6a61c35b0c521"],"state_sha256":"bbf37f7b48243c4fe88d483146deb519a1b313867349f391d78d48277f9f7f72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ok2zEC0Q6bd+FMnTi61+U14q4yOpO6d5aJqD8187LYi56fwaMfy7B2giReCxi7xwNcbQo5Lnfi+jcH9ungHsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:14:13.355759Z","bundle_sha256":"9d748fe934e7c0c198f07afef8d5c4cc96ee4bec90f459cbb829c2651711658e"}}