{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AT5OJDSHJ6IVTCQTAIQ7OFVIHA","short_pith_number":"pith:AT5OJDSH","schema_version":"1.0","canonical_sha256":"04fae48e474f91598a130221f716a8382ecc4d02eea5e75a561dc34f94d5e880","source":{"kind":"arxiv","id":"2310.02783","version":1},"attestation_state":"computed","paper":{"title":"Computational Entanglement Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rotem Arnon, Thomas Vidick, Zvika Brakerski","submitted_at":"2023-10-04T12:53:04Z","abstract_excerpt":"We initiate a rigorous study of computational entanglement theory, inspired by the emerging usefulness of ideas from quantum information theory in computational complexity. We define new operational computational measures of entanglement -- the computational one-shot entanglement cost and distillable entanglement. We then show that the computational measures are fundamentally different from their information-theoretic counterparts by presenting gaps between them.\n  We proceed by refining and extending the definition of pseudo-entanglement, introduced by Aaronson et al., 2022, using the new ope"},"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":"2310.02783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-04T12:53:04Z","cross_cats_sorted":[],"title_canon_sha256":"a8eb286349f744a700fdb82456ee13ef3f2088b8e5ce8d19d944b9aa60bcaf39","abstract_canon_sha256":"01d627610a5e1f2eae9915e0b12ffed7c572e4017e5533e54f54e10a45f22040"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:21.410664Z","signature_b64":"FkhQrwv3ZMcQJuDpeJKAsXLs/5GQv8XZcKSPlb/e7+d/hQSoaHimQ79fuVW/JVvwNDMKgc7J71mnIoPyPiQKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04fae48e474f91598a130221f716a8382ecc4d02eea5e75a561dc34f94d5e880","last_reissued_at":"2026-07-05T11:17:21.410075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:21.410075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Entanglement Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rotem Arnon, Thomas Vidick, Zvika Brakerski","submitted_at":"2023-10-04T12:53:04Z","abstract_excerpt":"We initiate a rigorous study of computational entanglement theory, inspired by the emerging usefulness of ideas from quantum information theory in computational complexity. We define new operational computational measures of entanglement -- the computational one-shot entanglement cost and distillable entanglement. We then show that the computational measures are fundamentally different from their information-theoretic counterparts by presenting gaps between them.\n  We proceed by refining and extending the definition of pseudo-entanglement, introduced by Aaronson et al., 2022, using the new ope"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.02783","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.02783/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":"2310.02783","created_at":"2026-07-05T11:17:21.410139+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.02783v1","created_at":"2026-07-05T11:17:21.410139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.02783","created_at":"2026-07-05T11:17:21.410139+00:00"},{"alias_kind":"pith_short_12","alias_value":"AT5OJDSHJ6IV","created_at":"2026-07-05T11:17:21.410139+00:00"},{"alias_kind":"pith_short_16","alias_value":"AT5OJDSHJ6IVTCQT","created_at":"2026-07-05T11:17:21.410139+00:00"},{"alias_kind":"pith_short_8","alias_value":"AT5OJDSH","created_at":"2026-07-05T11:17:21.410139+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.14068","citing_title":"Fully Quantum Computational Entropies","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15540","citing_title":"Accessible Quantum Correlations Under Complexity Constraints","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AT5OJDSHJ6IVTCQTAIQ7OFVIHA","json":"https://pith.science/pith/AT5OJDSHJ6IVTCQTAIQ7OFVIHA.json","graph_json":"https://pith.science/api/pith-number/AT5OJDSHJ6IVTCQTAIQ7OFVIHA/graph.json","events_json":"https://pith.science/api/pith-number/AT5OJDSHJ6IVTCQTAIQ7OFVIHA/events.json","paper":"https://pith.science/paper/AT5OJDSH"},"agent_actions":{"view_html":"https://pith.science/pith/AT5OJDSHJ6IVTCQTAIQ7OFVIHA","download_json":"https://pith.science/pith/AT5OJDSHJ6IVTCQTAIQ7OFVIHA.json","view_paper":"https://pith.science/paper/AT5OJDSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.02783&json=true","fetch_graph":"https://pith.science/api/pith-number/AT5OJDSHJ6IVTCQTAIQ7OFVIHA/graph.json","fetch_events":"https://pith.science/api/pith-number/AT5OJDSHJ6IVTCQTAIQ7OFVIHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AT5OJDSHJ6IVTCQTAIQ7OFVIHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AT5OJDSHJ6IVTCQTAIQ7OFVIHA/action/storage_attestation","attest_author":"https://pith.science/pith/AT5OJDSHJ6IVTCQTAIQ7OFVIHA/action/author_attestation","sign_citation":"https://pith.science/pith/AT5OJDSHJ6IVTCQTAIQ7OFVIHA/action/citation_signature","submit_replication":"https://pith.science/pith/AT5OJDSHJ6IVTCQTAIQ7OFVIHA/action/replication_record"}},"created_at":"2026-07-05T11:17:21.410139+00:00","updated_at":"2026-07-05T11:17:21.410139+00:00"}