{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:TMGLJA4SNV7GWFNRE2WC3PFXLK","short_pith_number":"pith:TMGLJA4S","canonical_record":{"source":{"id":"quant-ph/0310097","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-10-14T21:30:38Z","cross_cats_sorted":[],"title_canon_sha256":"60e4d97a9b68641f6319ec8a86521589ea8642fbb309add957ec883dd3ab02a4","abstract_canon_sha256":"c95c3fe7d6cd851dae2a24ea54f92ac050392165f542c3a5394cc06c6155d524"},"schema_version":"1.0"},"canonical_sha256":"9b0cb483926d7e6b15b126ac2dbcb75ab7682eb25ebe51e023349ad4db02a019","source":{"kind":"arxiv","id":"quant-ph/0310097","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0310097","created_at":"2026-07-04T15:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0310097v4","created_at":"2026-07-04T15:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0310097","created_at":"2026-07-04T15:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"TMGLJA4SNV7G","created_at":"2026-07-04T15:05:25Z"},{"alias_kind":"pith_short_16","alias_value":"TMGLJA4SNV7GWFNR","created_at":"2026-07-04T15:05:25Z"},{"alias_kind":"pith_short_8","alias_value":"TMGLJA4S","created_at":"2026-07-04T15:05:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:TMGLJA4SNV7GWFNRE2WC3PFXLK","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0310097","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-10-14T21:30:38Z","cross_cats_sorted":[],"title_canon_sha256":"60e4d97a9b68641f6319ec8a86521589ea8642fbb309add957ec883dd3ab02a4","abstract_canon_sha256":"c95c3fe7d6cd851dae2a24ea54f92ac050392165f542c3a5394cc06c6155d524"},"schema_version":"1.0"},"canonical_sha256":"9b0cb483926d7e6b15b126ac2dbcb75ab7682eb25ebe51e023349ad4db02a019","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:05:25.559496Z","signature_b64":"2x/DHrrr6aAeqpsFH7Y+X2hLTGKMhgjynRUhXAZ3NpBLBAc7Q/JZ8pOl92O7fxYhdqO1CgekRjrEYL/mbfAxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b0cb483926d7e6b15b126ac2dbcb75ab7682eb25ebe51e023349ad4db02a019","last_reissued_at":"2026-07-04T15:05:25.559101Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:05:25.559101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0310097","source_version":4,"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-07-04T15:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2YJ6wtCpLBeIoPQ5FHUIHVWkJ9tvaRTjApz0ajg0a/EDhMHpB4uhWPwRlGOmBckfnYu1sOfrOLsorPj5yNGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:03:13.695665Z"},"content_sha256":"30d44dfdf60355bc1c0d19f4217c81edeb510908ccd6466a0bd3e46437fe7ac0","schema_version":"1.0","event_id":"sha256:30d44dfdf60355bc1c0d19f4217c81edeb510908ccd6466a0bd3e46437fe7ac0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:TMGLJA4SNV7GWFNRE2WC3PFXLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Minimum Distance Problem for Two-Way Entanglement Purification","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Daniel Gottesman","submitted_at":"2003-10-14T21:30:38Z","abstract_excerpt":"Entanglement purification takes a number of noisy EPR pairs and processes them to produce a smaller number of more reliable pairs. If this is done with only a forward classical side channel, the procedure is equivalent to using a quantum error-correcting code (QECC). We instead investigate entanglement purification protocols with two-way classical side channels (2-EPPs) for finite block sizes. In particular, we consider the analog of the minimum distance problem for QECCs, and show that 2-EPPs can exceed the quantum Hamming bound and the quantum Singleton bound. We also show that 2-EPPs can ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0310097","kind":"arxiv","version":4},"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/0310097/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"},"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-07-04T15:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRUZGolXGRR0vXUhCWuwCw2yAFF4B6p6i+NDlgpRbzTWpaZpa/3YUCFovD+qQjPlgWrZsc6g+R2dw7JoJ/rtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:03:13.696136Z"},"content_sha256":"5a14ef7ded772a69ce4bd7a5928b6bf3a377d9694bd941a5d7a09011105c8bde","schema_version":"1.0","event_id":"sha256:5a14ef7ded772a69ce4bd7a5928b6bf3a377d9694bd941a5d7a09011105c8bde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK/bundle.json","state_url":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK/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-08-07T10:03:13Z","links":{"resolver":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK","bundle":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK/bundle.json","state":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:TMGLJA4SNV7GWFNRE2WC3PFXLK","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":"c95c3fe7d6cd851dae2a24ea54f92ac050392165f542c3a5394cc06c6155d524","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-10-14T21:30:38Z","title_canon_sha256":"60e4d97a9b68641f6319ec8a86521589ea8642fbb309add957ec883dd3ab02a4"},"schema_version":"1.0","source":{"id":"quant-ph/0310097","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0310097","created_at":"2026-07-04T15:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0310097v4","created_at":"2026-07-04T15:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0310097","created_at":"2026-07-04T15:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"TMGLJA4SNV7G","created_at":"2026-07-04T15:05:25Z"},{"alias_kind":"pith_short_16","alias_value":"TMGLJA4SNV7GWFNR","created_at":"2026-07-04T15:05:25Z"},{"alias_kind":"pith_short_8","alias_value":"TMGLJA4S","created_at":"2026-07-04T15:05:25Z"}],"graph_snapshots":[{"event_id":"sha256:5a14ef7ded772a69ce4bd7a5928b6bf3a377d9694bd941a5d7a09011105c8bde","target":"graph","created_at":"2026-07-04T15:05:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0310097/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Entanglement purification takes a number of noisy EPR pairs and processes them to produce a smaller number of more reliable pairs. If this is done with only a forward classical side channel, the procedure is equivalent to using a quantum error-correcting code (QECC). We instead investigate entanglement purification protocols with two-way classical side channels (2-EPPs) for finite block sizes. In particular, we consider the analog of the minimum distance problem for QECCs, and show that 2-EPPs can exceed the quantum Hamming bound and the quantum Singleton bound. We also show that 2-EPPs can ac","authors_text":"Andris Ambainis, Daniel Gottesman","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2003-10-14T21:30:38Z","title":"The Minimum Distance Problem for Two-Way Entanglement Purification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0310097","kind":"arxiv","version":4},"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:30d44dfdf60355bc1c0d19f4217c81edeb510908ccd6466a0bd3e46437fe7ac0","target":"record","created_at":"2026-07-04T15:05:25Z","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":"c95c3fe7d6cd851dae2a24ea54f92ac050392165f542c3a5394cc06c6155d524","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-10-14T21:30:38Z","title_canon_sha256":"60e4d97a9b68641f6319ec8a86521589ea8642fbb309add957ec883dd3ab02a4"},"schema_version":"1.0","source":{"id":"quant-ph/0310097","kind":"arxiv","version":4}},"canonical_sha256":"9b0cb483926d7e6b15b126ac2dbcb75ab7682eb25ebe51e023349ad4db02a019","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b0cb483926d7e6b15b126ac2dbcb75ab7682eb25ebe51e023349ad4db02a019","first_computed_at":"2026-07-04T15:05:25.559101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:05:25.559101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2x/DHrrr6aAeqpsFH7Y+X2hLTGKMhgjynRUhXAZ3NpBLBAc7Q/JZ8pOl92O7fxYhdqO1CgekRjrEYL/mbfAxAw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:05:25.559496Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0310097","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30d44dfdf60355bc1c0d19f4217c81edeb510908ccd6466a0bd3e46437fe7ac0","sha256:5a14ef7ded772a69ce4bd7a5928b6bf3a377d9694bd941a5d7a09011105c8bde"],"state_sha256":"f84747a1cbb00c62dbfacf775fe15497f0eef76cd12bcd8ac64bb22a6dadbc40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTeIeIfNqjQ4ChcbjdUpFwycxmT2W6xryRaG5ji5XRWn3/SPkzLtRFOmMOfoHxKmT2k5fpTh3NopVNoi4smpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T10:03:13.701586Z","bundle_sha256":"bca7af3db47a108bbb320b2430e7e5ab73786878ed806a5f63ef8c3eb89fb656"}}