{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TGL36X5Y5XVOM37YEDNKZUKZCH","short_pith_number":"pith:TGL36X5Y","schema_version":"1.0","canonical_sha256":"9997bf5fb8edeae66ff820daacd15911cdfab5b23be056aa2c88485372a71bb4","source":{"kind":"arxiv","id":"1510.00578","version":3},"attestation_state":"computed","paper":{"title":"Dvoretzky's Theorem and the Complexity of Entanglement Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"quant-ph","authors_text":"Guillaume Aubrun, Stanislaw Szarek","submitted_at":"2015-10-02T12:38:59Z","abstract_excerpt":"The well-known Horodecki criterion asserts that a state $\\rho$ on $\\mathbf{C}^d \\otimes \\mathbf{C}^d$ is entangled if and only if there exists a positive map $\\Phi : \\mathsf{M}_d \\to \\mathsf{M}_d$ such that the operator $(\\Phi \\otimes \\mathrm{Id})(\\rho)$ is not positive semi-definite. We show that the number of such maps needed to detect all the robustly entangled states (i.e., states $\\rho$ which remain entangled even in the presence of substantial randomizing noise) exceeds $\\exp(c d^3 / \\log d)$. The proof is based on the 1977 inequality of Figiel--Lindenstrauss--Milman, which ultimately re"},"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":"1510.00578","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-02T12:38:59Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"6ad687a5497a31924164c8c9c21440afc478e53b4827a56b39c6d544b222b797","abstract_canon_sha256":"32842c8d8804b41d6efeed24f085715545a7ccc2403c48f9efa66b691e63fa3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:34.869891Z","signature_b64":"7SNTbVbHikEuzZMGXhwF/UwmpkR33/Vy+N+UF8eqsbpYwGMtgEQuFrfV/WTymC6qG/wKgoCTSp1OEokTK5Z0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9997bf5fb8edeae66ff820daacd15911cdfab5b23be056aa2c88485372a71bb4","last_reissued_at":"2026-05-18T00:49:34.869390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:34.869390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dvoretzky's Theorem and the Complexity of Entanglement Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"quant-ph","authors_text":"Guillaume Aubrun, Stanislaw Szarek","submitted_at":"2015-10-02T12:38:59Z","abstract_excerpt":"The well-known Horodecki criterion asserts that a state $\\rho$ on $\\mathbf{C}^d \\otimes \\mathbf{C}^d$ is entangled if and only if there exists a positive map $\\Phi : \\mathsf{M}_d \\to \\mathsf{M}_d$ such that the operator $(\\Phi \\otimes \\mathrm{Id})(\\rho)$ is not positive semi-definite. We show that the number of such maps needed to detect all the robustly entangled states (i.e., states $\\rho$ which remain entangled even in the presence of substantial randomizing noise) exceeds $\\exp(c d^3 / \\log d)$. The proof is based on the 1977 inequality of Figiel--Lindenstrauss--Milman, which ultimately re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00578","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":""},"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":"1510.00578","created_at":"2026-05-18T00:49:34.869465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00578v3","created_at":"2026-05-18T00:49:34.869465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00578","created_at":"2026-05-18T00:49:34.869465+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGL36X5Y5XVO","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGL36X5Y5XVOM37Y","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGL36X5Y","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH","json":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH.json","graph_json":"https://pith.science/api/pith-number/TGL36X5Y5XVOM37YEDNKZUKZCH/graph.json","events_json":"https://pith.science/api/pith-number/TGL36X5Y5XVOM37YEDNKZUKZCH/events.json","paper":"https://pith.science/paper/TGL36X5Y"},"agent_actions":{"view_html":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH","download_json":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH.json","view_paper":"https://pith.science/paper/TGL36X5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00578&json=true","fetch_graph":"https://pith.science/api/pith-number/TGL36X5Y5XVOM37YEDNKZUKZCH/graph.json","fetch_events":"https://pith.science/api/pith-number/TGL36X5Y5XVOM37YEDNKZUKZCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH/action/storage_attestation","attest_author":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH/action/author_attestation","sign_citation":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH/action/citation_signature","submit_replication":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH/action/replication_record"}},"created_at":"2026-05-18T00:49:34.869465+00:00","updated_at":"2026-05-18T00:49:34.869465+00:00"}