{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TGL36X5Y5XVOM37YEDNKZUKZCH","short_pith_number":"pith:TGL36X5Y","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"},"canonical_sha256":"9997bf5fb8edeae66ff820daacd15911cdfab5b23be056aa2c88485372a71bb4","source":{"kind":"arxiv","id":"1510.00578","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00578","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00578v3","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00578","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"pith_short_12","alias_value":"TGL36X5Y5XVO","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TGL36X5Y5XVOM37Y","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TGL36X5Y","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TGL36X5Y5XVOM37YEDNKZUKZCH","target":"record","payload":{"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"},"canonical_sha256":"9997bf5fb8edeae66ff820daacd15911cdfab5b23be056aa2c88485372a71bb4","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"},"source_kind":"arxiv","source_id":"1510.00578","source_version":3,"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-18T00:49:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qb6AQoNuzM0l54lp2kYHVX5rw/ZyrmyzjIO9z48Anyh0kcc5ywzOI1Cz7cdMJ0wTbaBCdtu5nKvhczeY6uqhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:08:42.776665Z"},"content_sha256":"d569bd02fef8edf4913f892111f31df99d4660e66b98c74c68ad4fe843b344aa","schema_version":"1.0","event_id":"sha256:d569bd02fef8edf4913f892111f31df99d4660e66b98c74c68ad4fe843b344aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TGL36X5Y5XVOM37YEDNKZUKZCH","target":"graph","payload":{"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"},"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-18T00:49:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wlo7TQkrP4oLVgFQb/0feKq+icccsOyoqrIwN1MCxgkg9PdjRoA/gr6R51hR+uBu6ISUK0QetG9Kar6er+1WCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:08:42.777002Z"},"content_sha256":"42c7a0d5c48cc61b029697f88739d68cf30904dd717bbcdcf394942533b7ed61","schema_version":"1.0","event_id":"sha256:42c7a0d5c48cc61b029697f88739d68cf30904dd717bbcdcf394942533b7ed61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH/bundle.json","state_url":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGL36X5Y5XVOM37YEDNKZUKZCH/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-29T07:08:42Z","links":{"resolver":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH","bundle":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH/bundle.json","state":"https://pith.science/pith/TGL36X5Y5XVOM37YEDNKZUKZCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGL36X5Y5XVOM37YEDNKZUKZCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TGL36X5Y5XVOM37YEDNKZUKZCH","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":"32842c8d8804b41d6efeed24f085715545a7ccc2403c48f9efa66b691e63fa3a","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-02T12:38:59Z","title_canon_sha256":"6ad687a5497a31924164c8c9c21440afc478e53b4827a56b39c6d544b222b797"},"schema_version":"1.0","source":{"id":"1510.00578","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00578","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00578v3","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00578","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"pith_short_12","alias_value":"TGL36X5Y5XVO","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TGL36X5Y5XVOM37Y","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TGL36X5Y","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:42c7a0d5c48cc61b029697f88739d68cf30904dd717bbcdcf394942533b7ed61","target":"graph","created_at":"2026-05-18T00:49:34Z","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":"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","authors_text":"Guillaume Aubrun, Stanislaw Szarek","cross_cats":["math.FA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-02T12:38:59Z","title":"Dvoretzky's Theorem and the Complexity of Entanglement Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00578","kind":"arxiv","version":3},"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:d569bd02fef8edf4913f892111f31df99d4660e66b98c74c68ad4fe843b344aa","target":"record","created_at":"2026-05-18T00:49:34Z","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":"32842c8d8804b41d6efeed24f085715545a7ccc2403c48f9efa66b691e63fa3a","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-02T12:38:59Z","title_canon_sha256":"6ad687a5497a31924164c8c9c21440afc478e53b4827a56b39c6d544b222b797"},"schema_version":"1.0","source":{"id":"1510.00578","kind":"arxiv","version":3}},"canonical_sha256":"9997bf5fb8edeae66ff820daacd15911cdfab5b23be056aa2c88485372a71bb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9997bf5fb8edeae66ff820daacd15911cdfab5b23be056aa2c88485372a71bb4","first_computed_at":"2026-05-18T00:49:34.869390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:34.869390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7SNTbVbHikEuzZMGXhwF/UwmpkR33/Vy+N+UF8eqsbpYwGMtgEQuFrfV/WTymC6qG/wKgoCTSp1OEokTK5Z0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:34.869891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00578","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d569bd02fef8edf4913f892111f31df99d4660e66b98c74c68ad4fe843b344aa","sha256:42c7a0d5c48cc61b029697f88739d68cf30904dd717bbcdcf394942533b7ed61"],"state_sha256":"d579840420f0b4b020a8e4e38e257b0a52bb9ecea8f6fd13b2137de1bb92eaef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wHlMPpGzoOllNBG5spI79L3xNpSq3jIG8DaGoO90W0X81qj8+Y/mU0kIEbpwKan5/d+7QW/UFimYWLyGrXQpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T07:08:42.778896Z","bundle_sha256":"4eecfa7cc5ee46df2b756996361bea31d1f373731415ceef2efe496d9126ce1b"}}