{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:JVJVPYBYUFVM3ZV5Q7BLD57PVA","short_pith_number":"pith:JVJVPYBY","schema_version":"1.0","canonical_sha256":"4d5357e038a16acde6bd87c2b1f7efa816d2249183a2267e7779eb1716bc6655","source":{"kind":"arxiv","id":"quant-ph/0308032","version":3},"attestation_state":"computed","paper":{"title":"A complete family of separability criteria","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew C. Doherty, Federico M. Spedalieri, Pablo A. Parrilo","submitted_at":"2003-08-05T22:15:04Z","abstract_excerpt":"We introduce a new family of separability criteria that are based on the existence of extensions of a bipartite quantum state $\\rho$ to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all separable states have the required extensions, so the non-existence of such an extension for a particular state implies that the state is entangled. One of the main advantages of this approach is that searching for the extension can be cast as a convex optimization problem known as a semidefinite program (SDP). Whenever an extension does not exist, the dual optim"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/0308032","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-08-05T22:15:04Z","cross_cats_sorted":[],"title_canon_sha256":"44f3043b437b795b7800b9d7ca8295960da782fee211dc932fad3b6dfaa40929","abstract_canon_sha256":"782fc7f43bbf7ecc4a70b7881cc05db5748e95009709d6da8a1c6befcbeda4e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:22.928424Z","signature_b64":"Da1VfXoDBbvGwDnbXY/prgaTWiV+luGKXVD56MD2ifqqytTlba4fzEWdejU2S9tmBDphjogdi5399jucrrntDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d5357e038a16acde6bd87c2b1f7efa816d2249183a2267e7779eb1716bc6655","last_reissued_at":"2026-07-04T14:46:22.928050Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:22.928050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A complete family of separability criteria","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew C. Doherty, Federico M. Spedalieri, Pablo A. Parrilo","submitted_at":"2003-08-05T22:15:04Z","abstract_excerpt":"We introduce a new family of separability criteria that are based on the existence of extensions of a bipartite quantum state $\\rho$ to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all separable states have the required extensions, so the non-existence of such an extension for a particular state implies that the state is entangled. One of the main advantages of this approach is that searching for the extension can be cast as a convex optimization problem known as a semidefinite program (SDP). Whenever an extension does not exist, the dual optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0308032","kind":"arxiv","version":3},"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/0308032/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0308032","created_at":"2026-07-04T14:46:22.928105+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0308032v3","created_at":"2026-07-04T14:46:22.928105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0308032","created_at":"2026-07-04T14:46:22.928105+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVJVPYBYUFVM","created_at":"2026-07-04T14:46:22.928105+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVJVPYBYUFVM3ZV5","created_at":"2026-07-04T14:46:22.928105+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVJVPYBY","created_at":"2026-07-04T14:46:22.928105+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.30600","citing_title":"Hankel and Multiplication Tensor Completions for Cactus Rank","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16249","citing_title":"The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JVJVPYBYUFVM3ZV5Q7BLD57PVA","json":"https://pith.science/pith/JVJVPYBYUFVM3ZV5Q7BLD57PVA.json","graph_json":"https://pith.science/api/pith-number/JVJVPYBYUFVM3ZV5Q7BLD57PVA/graph.json","events_json":"https://pith.science/api/pith-number/JVJVPYBYUFVM3ZV5Q7BLD57PVA/events.json","paper":"https://pith.science/paper/JVJVPYBY"},"agent_actions":{"view_html":"https://pith.science/pith/JVJVPYBYUFVM3ZV5Q7BLD57PVA","download_json":"https://pith.science/pith/JVJVPYBYUFVM3ZV5Q7BLD57PVA.json","view_paper":"https://pith.science/paper/JVJVPYBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0308032&json=true","fetch_graph":"https://pith.science/api/pith-number/JVJVPYBYUFVM3ZV5Q7BLD57PVA/graph.json","fetch_events":"https://pith.science/api/pith-number/JVJVPYBYUFVM3ZV5Q7BLD57PVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVJVPYBYUFVM3ZV5Q7BLD57PVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVJVPYBYUFVM3ZV5Q7BLD57PVA/action/storage_attestation","attest_author":"https://pith.science/pith/JVJVPYBYUFVM3ZV5Q7BLD57PVA/action/author_attestation","sign_citation":"https://pith.science/pith/JVJVPYBYUFVM3ZV5Q7BLD57PVA/action/citation_signature","submit_replication":"https://pith.science/pith/JVJVPYBYUFVM3ZV5Q7BLD57PVA/action/replication_record"}},"created_at":"2026-07-04T14:46:22.928105+00:00","updated_at":"2026-07-04T14:46:22.928105+00:00"}