{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:MYVABQPTCZKQEW6Z3A7MUCJLGJ","short_pith_number":"pith:MYVABQPT","schema_version":"1.0","canonical_sha256":"662a00c1f31655025bd9d83eca092b324c466c8056b83239f99bc44d9de208d8","source":{"kind":"arxiv","id":"quant-ph/0206097","version":2},"attestation_state":"computed","paper":{"title":"Error exponents for entanglement concentration","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Winter, Fumiaki Morikoshi, Keiji Matsumoto, Masahito Hayashi, Masato Koashi","submitted_at":"2002-06-14T14:42:20Z","abstract_excerpt":"Consider entanglement concentration schemes that convert n identical copies of a pure state into a maximally entangled state of a desired size with success probability being close to one in the asymptotic limit. We give the distillable entanglement, the number of Bell pairs distilled per copy, as a function of an error exponent, which represents the rate of decrease in failure probability as n tends to infinity. The formula fills the gap between the least upper bound of distillable entanglement in probabilistic concentration, which is the well-known entropy of entanglement, and the maximum att"},"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/0206097","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-06-14T14:42:20Z","cross_cats_sorted":[],"title_canon_sha256":"51e99caa84a3621f62525d4d24df9e7a20ab0326b2354f732d42e1b673773a9b","abstract_canon_sha256":"992d5899bc5fbd42eefd4a6a6596484dbaa272d1bba02368175d4085b5aa806c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:36:05.903751Z","signature_b64":"CTRC1MHtdGs3xMGim9wiGfyYfz8vHiPwov+Yqxc0cf74vrXQGoEc+zRI8X7fKU3Y7vMEnX74tDNtFf43BNiSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"662a00c1f31655025bd9d83eca092b324c466c8056b83239f99bc44d9de208d8","last_reissued_at":"2026-07-04T16:36:05.903362Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:36:05.903362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error exponents for entanglement concentration","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Winter, Fumiaki Morikoshi, Keiji Matsumoto, Masahito Hayashi, Masato Koashi","submitted_at":"2002-06-14T14:42:20Z","abstract_excerpt":"Consider entanglement concentration schemes that convert n identical copies of a pure state into a maximally entangled state of a desired size with success probability being close to one in the asymptotic limit. We give the distillable entanglement, the number of Bell pairs distilled per copy, as a function of an error exponent, which represents the rate of decrease in failure probability as n tends to infinity. The formula fills the gap between the least upper bound of distillable entanglement in probabilistic concentration, which is the well-known entropy of entanglement, and the maximum att"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0206097","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0206097/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/0206097","created_at":"2026-07-04T16:36:05.903420+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0206097v2","created_at":"2026-07-04T16:36:05.903420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0206097","created_at":"2026-07-04T16:36:05.903420+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYVABQPTCZKQ","created_at":"2026-07-04T16:36:05.903420+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYVABQPTCZKQEW6Z","created_at":"2026-07-04T16:36:05.903420+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYVABQPT","created_at":"2026-07-04T16:36:05.903420+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13778","citing_title":"Error exponents for tripartite-to-bipartite entanglement transformations","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MYVABQPTCZKQEW6Z3A7MUCJLGJ","json":"https://pith.science/pith/MYVABQPTCZKQEW6Z3A7MUCJLGJ.json","graph_json":"https://pith.science/api/pith-number/MYVABQPTCZKQEW6Z3A7MUCJLGJ/graph.json","events_json":"https://pith.science/api/pith-number/MYVABQPTCZKQEW6Z3A7MUCJLGJ/events.json","paper":"https://pith.science/paper/MYVABQPT"},"agent_actions":{"view_html":"https://pith.science/pith/MYVABQPTCZKQEW6Z3A7MUCJLGJ","download_json":"https://pith.science/pith/MYVABQPTCZKQEW6Z3A7MUCJLGJ.json","view_paper":"https://pith.science/paper/MYVABQPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0206097&json=true","fetch_graph":"https://pith.science/api/pith-number/MYVABQPTCZKQEW6Z3A7MUCJLGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MYVABQPTCZKQEW6Z3A7MUCJLGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYVABQPTCZKQEW6Z3A7MUCJLGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYVABQPTCZKQEW6Z3A7MUCJLGJ/action/storage_attestation","attest_author":"https://pith.science/pith/MYVABQPTCZKQEW6Z3A7MUCJLGJ/action/author_attestation","sign_citation":"https://pith.science/pith/MYVABQPTCZKQEW6Z3A7MUCJLGJ/action/citation_signature","submit_replication":"https://pith.science/pith/MYVABQPTCZKQEW6Z3A7MUCJLGJ/action/replication_record"}},"created_at":"2026-07-04T16:36:05.903420+00:00","updated_at":"2026-07-04T16:36:05.903420+00:00"}