{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4PAQK74EECLNUWGTXXDJGPACQK","short_pith_number":"pith:4PAQK74E","canonical_record":{"source":{"id":"1011.2751","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-11T20:17:17Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6f0a11d56a0df96fce0d35a7c9462cc1793972cde4e1ac935a935aff11e480c0","abstract_canon_sha256":"8556f8b08518ed553397dc59353adc8a77460fec17ff7912422aaff0eee10d91"},"schema_version":"1.0"},"canonical_sha256":"e3c1057f842096da58d3bdc6933c0282a2892f1fcbd9dd61f31e8fab05a706c1","source":{"kind":"arxiv","id":"1011.2751","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2751","created_at":"2026-05-18T04:20:14Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2751v2","created_at":"2026-05-18T04:20:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2751","created_at":"2026-05-18T04:20:14Z"},{"alias_kind":"pith_short_12","alias_value":"4PAQK74EECLN","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4PAQK74EECLNUWGT","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4PAQK74E","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4PAQK74EECLNUWGTXXDJGPACQK","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2751","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-11T20:17:17Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6f0a11d56a0df96fce0d35a7c9462cc1793972cde4e1ac935a935aff11e480c0","abstract_canon_sha256":"8556f8b08518ed553397dc59353adc8a77460fec17ff7912422aaff0eee10d91"},"schema_version":"1.0"},"canonical_sha256":"e3c1057f842096da58d3bdc6933c0282a2892f1fcbd9dd61f31e8fab05a706c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:14.558566Z","signature_b64":"M3usOEafcGKProg6JVsEFeJLtirpYuPQBf2nEgNOBKf8RfkxB+rOZqGYCcMJOUZF2b9lZ8ZfFSJkk/gfsJXIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3c1057f842096da58d3bdc6933c0282a2892f1fcbd9dd61f31e8fab05a706c1","last_reissued_at":"2026-05-18T04:20:14.557988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:14.557988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2751","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-18T04:20:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LbmB9wLBmBoXz7ugro2SCqa4KWBxNmuJPyJa0cSxSeMx0LVsReRb/iO4CxWbLDzqRak6xf8KPqIZ7WGw3i4YBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:07:17.367676Z"},"content_sha256":"b772f4d8b4d382f4fd7545932999fd15731adec2cdf5a932f79e861316802e6a","schema_version":"1.0","event_id":"sha256:b772f4d8b4d382f4fd7545932999fd15731adec2cdf5a932f79e861316802e6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4PAQK74EECLNUWGTXXDJGPACQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A quasipolynomial-time algorithm for the quantum separability problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Fernando G.S.L. Brandao, Jon Yard, Matthias Christandl","submitted_at":"2010-11-11T20:17:17Z","abstract_excerpt":"We present a quasipolynomial-time algorithm for solving the weak membership problem for the convex set of separable, i.e. non-entangled, bipartite density matrices. The algorithm decides whether a density matrix is separable or whether it is eps-away from the set of the separable states in time exp(O(eps^-2 log |A| log |B|)), where |A| and |B| are the local dimensions, and the distance is measured with either the Euclidean norm, or with the so-called LOCC norm. The latter is an operationally motivated norm giving the optimal probability of distinguishing two bipartite quantum states, each shar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2751","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-18T04:20:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AGXFpP4wYNcyaH+dJXkab2J7qGpWCDkqoZDKlk3NQHUC4jR1ODHRaTy0c/X11j636WRK10QL1ZlBn2ruLU7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:07:17.368012Z"},"content_sha256":"c24839be2e2944d32acd5f9a1b0acb76b991bbf884fda7d1e652cedf4da1e05e","schema_version":"1.0","event_id":"sha256:c24839be2e2944d32acd5f9a1b0acb76b991bbf884fda7d1e652cedf4da1e05e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PAQK74EECLNUWGTXXDJGPACQK/bundle.json","state_url":"https://pith.science/pith/4PAQK74EECLNUWGTXXDJGPACQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PAQK74EECLNUWGTXXDJGPACQK/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-02T06:07:17Z","links":{"resolver":"https://pith.science/pith/4PAQK74EECLNUWGTXXDJGPACQK","bundle":"https://pith.science/pith/4PAQK74EECLNUWGTXXDJGPACQK/bundle.json","state":"https://pith.science/pith/4PAQK74EECLNUWGTXXDJGPACQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PAQK74EECLNUWGTXXDJGPACQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4PAQK74EECLNUWGTXXDJGPACQK","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":"8556f8b08518ed553397dc59353adc8a77460fec17ff7912422aaff0eee10d91","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-11T20:17:17Z","title_canon_sha256":"6f0a11d56a0df96fce0d35a7c9462cc1793972cde4e1ac935a935aff11e480c0"},"schema_version":"1.0","source":{"id":"1011.2751","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2751","created_at":"2026-05-18T04:20:14Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2751v2","created_at":"2026-05-18T04:20:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2751","created_at":"2026-05-18T04:20:14Z"},{"alias_kind":"pith_short_12","alias_value":"4PAQK74EECLN","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4PAQK74EECLNUWGT","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4PAQK74E","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:c24839be2e2944d32acd5f9a1b0acb76b991bbf884fda7d1e652cedf4da1e05e","target":"graph","created_at":"2026-05-18T04:20:14Z","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 present a quasipolynomial-time algorithm for solving the weak membership problem for the convex set of separable, i.e. non-entangled, bipartite density matrices. The algorithm decides whether a density matrix is separable or whether it is eps-away from the set of the separable states in time exp(O(eps^-2 log |A| log |B|)), where |A| and |B| are the local dimensions, and the distance is measured with either the Euclidean norm, or with the so-called LOCC norm. The latter is an operationally motivated norm giving the optimal probability of distinguishing two bipartite quantum states, each shar","authors_text":"Fernando G.S.L. Brandao, Jon Yard, Matthias Christandl","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-11T20:17:17Z","title":"A quasipolynomial-time algorithm for the quantum separability problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2751","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:b772f4d8b4d382f4fd7545932999fd15731adec2cdf5a932f79e861316802e6a","target":"record","created_at":"2026-05-18T04:20:14Z","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":"8556f8b08518ed553397dc59353adc8a77460fec17ff7912422aaff0eee10d91","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-11T20:17:17Z","title_canon_sha256":"6f0a11d56a0df96fce0d35a7c9462cc1793972cde4e1ac935a935aff11e480c0"},"schema_version":"1.0","source":{"id":"1011.2751","kind":"arxiv","version":2}},"canonical_sha256":"e3c1057f842096da58d3bdc6933c0282a2892f1fcbd9dd61f31e8fab05a706c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3c1057f842096da58d3bdc6933c0282a2892f1fcbd9dd61f31e8fab05a706c1","first_computed_at":"2026-05-18T04:20:14.557988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:14.557988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M3usOEafcGKProg6JVsEFeJLtirpYuPQBf2nEgNOBKf8RfkxB+rOZqGYCcMJOUZF2b9lZ8ZfFSJkk/gfsJXIAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:14.558566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2751","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b772f4d8b4d382f4fd7545932999fd15731adec2cdf5a932f79e861316802e6a","sha256:c24839be2e2944d32acd5f9a1b0acb76b991bbf884fda7d1e652cedf4da1e05e"],"state_sha256":"e98ca33c9b8be493095a2fad67fe7e423b13f37260e096bc348b23b552aa42db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQKRc1fTz68Gq2pnCk1/eaI6mzQqPMsMG+mIinwSHSrjOuXsfg8ZQ1+9M5itezqaaCKCORix6G/hfqlxefe0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:07:17.369969Z","bundle_sha256":"90298d6cd6eeed4e840c2954d016d423c43312dc7cca82609042bbec00e5a261"}}