{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QP2YTZXGLQGPNOGKEAW333NHSG","short_pith_number":"pith:QP2YTZXG","canonical_record":{"source":{"id":"1112.0808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-04T23:00:57Z","cross_cats_sorted":[],"title_canon_sha256":"3a12be85e6182e90584a9b7a3624ef5ac97ab478a444a031d28174ae44997b6b","abstract_canon_sha256":"c8db0684819dba45685fc2e10aa1e0f38f767833d1040932b679858637179204"},"schema_version":"1.0"},"canonical_sha256":"83f589e6e65c0cf6b8ca202dbdeda791993e4ba98d959323df67b7d55e32209c","source":{"kind":"arxiv","id":"1112.0808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0808","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0808v1","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0808","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"pith_short_12","alias_value":"QP2YTZXGLQGP","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QP2YTZXGLQGPNOGK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QP2YTZXG","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QP2YTZXGLQGPNOGKEAW333NHSG","target":"record","payload":{"canonical_record":{"source":{"id":"1112.0808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-04T23:00:57Z","cross_cats_sorted":[],"title_canon_sha256":"3a12be85e6182e90584a9b7a3624ef5ac97ab478a444a031d28174ae44997b6b","abstract_canon_sha256":"c8db0684819dba45685fc2e10aa1e0f38f767833d1040932b679858637179204"},"schema_version":"1.0"},"canonical_sha256":"83f589e6e65c0cf6b8ca202dbdeda791993e4ba98d959323df67b7d55e32209c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:57.749244Z","signature_b64":"bQP/NDjmNbMwSb1PTHOLTH2bADKYi5gB9FniinXGPY2Nb1qwsOlMVZvNrR7nT6Zxlf9bm7HeSl3u5wOwnRnuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83f589e6e65c0cf6b8ca202dbdeda791993e4ba98d959323df67b7d55e32209c","last_reissued_at":"2026-05-18T04:06:57.748701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:57.748701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.0808","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-18T04:06:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jxc4dKvO5+kamwm3OrWjqPLivKOdJP6qW13y2jp4HUrt/aDuEFKig8y8tCQcEI2quv7dHrK6U5H6T+mBoWZgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:50:21.345552Z"},"content_sha256":"cd7d6c39f4a57791528dd78e0d3f8549813fe98736c8e65ea28a199e520b74e2","schema_version":"1.0","event_id":"sha256:cd7d6c39f4a57791528dd78e0d3f8549813fe98736c8e65ea28a199e520b74e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QP2YTZXGLQGPNOGKEAW333NHSG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Epsilon-net method for optimizations over separable states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Xiaodi Wu, Yaoyun Shi","submitted_at":"2011-12-04T23:00:57Z","abstract_excerpt":"We give algorithms for the optimization problem: $\\max_\\rho \\ip{Q}{\\rho}$, where $Q$ is a Hermitian matrix, and the variable $\\rho$ is a bipartite {\\em separable} quantum state. This problem lies at the heart of several problems in quantum computation and information, such as the complexity of QMA(2). While the problem is NP-hard, our algorithms are better than brute force for several instances of interest. In particular, they give PSPACE upper bounds on promise problems admitting a QMA(2) protocol in which the verifier performs only logarithmic number of elementary gate on both proofs, as wel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0808","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-18T04:06:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GN298GDqGD2HZ4wykQxXQS6lDE10Id+t5zB2V8JRNHfn/tvFhivtO2D3XD6cFv9+vWBtGUM7kTbkDab2+iDzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:50:21.346216Z"},"content_sha256":"59d942a5ad3ac324f8bee288f73209b7bda4dfb9fd5c924930a3f6e7d9a7c968","schema_version":"1.0","event_id":"sha256:59d942a5ad3ac324f8bee288f73209b7bda4dfb9fd5c924930a3f6e7d9a7c968"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QP2YTZXGLQGPNOGKEAW333NHSG/bundle.json","state_url":"https://pith.science/pith/QP2YTZXGLQGPNOGKEAW333NHSG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QP2YTZXGLQGPNOGKEAW333NHSG/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-22T11:50:21Z","links":{"resolver":"https://pith.science/pith/QP2YTZXGLQGPNOGKEAW333NHSG","bundle":"https://pith.science/pith/QP2YTZXGLQGPNOGKEAW333NHSG/bundle.json","state":"https://pith.science/pith/QP2YTZXGLQGPNOGKEAW333NHSG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QP2YTZXGLQGPNOGKEAW333NHSG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QP2YTZXGLQGPNOGKEAW333NHSG","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":"c8db0684819dba45685fc2e10aa1e0f38f767833d1040932b679858637179204","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-04T23:00:57Z","title_canon_sha256":"3a12be85e6182e90584a9b7a3624ef5ac97ab478a444a031d28174ae44997b6b"},"schema_version":"1.0","source":{"id":"1112.0808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0808","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0808v1","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0808","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"pith_short_12","alias_value":"QP2YTZXGLQGP","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QP2YTZXGLQGPNOGK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QP2YTZXG","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:59d942a5ad3ac324f8bee288f73209b7bda4dfb9fd5c924930a3f6e7d9a7c968","target":"graph","created_at":"2026-05-18T04:06:57Z","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 give algorithms for the optimization problem: $\\max_\\rho \\ip{Q}{\\rho}$, where $Q$ is a Hermitian matrix, and the variable $\\rho$ is a bipartite {\\em separable} quantum state. This problem lies at the heart of several problems in quantum computation and information, such as the complexity of QMA(2). While the problem is NP-hard, our algorithms are better than brute force for several instances of interest. In particular, they give PSPACE upper bounds on promise problems admitting a QMA(2) protocol in which the verifier performs only logarithmic number of elementary gate on both proofs, as wel","authors_text":"Xiaodi Wu, Yaoyun Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-04T23:00:57Z","title":"Epsilon-net method for optimizations over separable states"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0808","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:cd7d6c39f4a57791528dd78e0d3f8549813fe98736c8e65ea28a199e520b74e2","target":"record","created_at":"2026-05-18T04:06:57Z","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":"c8db0684819dba45685fc2e10aa1e0f38f767833d1040932b679858637179204","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-04T23:00:57Z","title_canon_sha256":"3a12be85e6182e90584a9b7a3624ef5ac97ab478a444a031d28174ae44997b6b"},"schema_version":"1.0","source":{"id":"1112.0808","kind":"arxiv","version":1}},"canonical_sha256":"83f589e6e65c0cf6b8ca202dbdeda791993e4ba98d959323df67b7d55e32209c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83f589e6e65c0cf6b8ca202dbdeda791993e4ba98d959323df67b7d55e32209c","first_computed_at":"2026-05-18T04:06:57.748701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:57.748701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bQP/NDjmNbMwSb1PTHOLTH2bADKYi5gB9FniinXGPY2Nb1qwsOlMVZvNrR7nT6Zxlf9bm7HeSl3u5wOwnRnuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:57.749244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd7d6c39f4a57791528dd78e0d3f8549813fe98736c8e65ea28a199e520b74e2","sha256:59d942a5ad3ac324f8bee288f73209b7bda4dfb9fd5c924930a3f6e7d9a7c968"],"state_sha256":"6cb5d028520f9dc60ef824a67033231ff1cb76bf3ad26b162914aa042d933982"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xjiOiD3NSyR8LPZUuBKcA+ZDz8Kjzw7DDEnzPLMUQ4tuVh7vDfAEVEEO6ZaQxbnF93XGLOMzSKz57CV8hxbCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T11:50:21.349644Z","bundle_sha256":"a1d0eba511203b69b9148774a493cda181a9772170c551a6375bb50ecbdcf257"}}