{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:65QWRSVH4KG42R2OP4DITBM5Y2","short_pith_number":"pith:65QWRSVH","schema_version":"1.0","canonical_sha256":"f76168caa7e28dcd474e7f0689859dc6868bde4a21e89a95cf2ea3ace78da222","source":{"kind":"arxiv","id":"2203.13924","version":4},"attestation_state":"computed","paper":{"title":"Achieving the ultimate end-to-end rates of lossy quantum communication networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Joshua J. Guanzon, Matthew S. Winnel, Nedasadat Hosseinidehaj, Timothy C. Ralph","submitted_at":"2022-03-25T22:02:32Z","abstract_excerpt":"The field of quantum communications promises the faithful distribution of quantum information, quantum entanglement, and absolutely secret keys, however, the highest rates of these tasks are fundamentally limited by the transmission distance between quantum repeaters. The ultimate end-to-end rates of quantum communication networks are known to be achievable by an optimal entanglement distillation protocol followed by teleportation. In this work, we give a practical design for this achievability. Our ultimate design is an iterative approach, where each purification step operates on shared entan"},"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":"2203.13924","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-25T22:02:32Z","cross_cats_sorted":[],"title_canon_sha256":"b7d6bd180092c5609704e61ee3ffede8cfee4d91a0b6f67f336b8fc3496b25d8","abstract_canon_sha256":"648bdc02ac494e5067b3eaa626f6f60b78c96df34ba47ed5ed1e79361c4c122f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:16:50.458924Z","signature_b64":"ksLLwq/np9ZmH25XKroL6rQA+1/bTY9+NAuiha2YpsyZpZ/dUcjhObEl39pvN27lbTU4Kln8J64H8Oy70DUNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f76168caa7e28dcd474e7f0689859dc6868bde4a21e89a95cf2ea3ace78da222","last_reissued_at":"2026-07-05T05:16:50.458476Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:16:50.458476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving the ultimate end-to-end rates of lossy quantum communication networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Joshua J. Guanzon, Matthew S. Winnel, Nedasadat Hosseinidehaj, Timothy C. Ralph","submitted_at":"2022-03-25T22:02:32Z","abstract_excerpt":"The field of quantum communications promises the faithful distribution of quantum information, quantum entanglement, and absolutely secret keys, however, the highest rates of these tasks are fundamentally limited by the transmission distance between quantum repeaters. The ultimate end-to-end rates of quantum communication networks are known to be achievable by an optimal entanglement distillation protocol followed by teleportation. In this work, we give a practical design for this achievability. Our ultimate design is an iterative approach, where each purification step operates on shared entan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.13924","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/2203.13924/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":"2203.13924","created_at":"2026-07-05T05:16:50.458530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.13924v4","created_at":"2026-07-05T05:16:50.458530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.13924","created_at":"2026-07-05T05:16:50.458530+00:00"},{"alias_kind":"pith_short_12","alias_value":"65QWRSVH4KG4","created_at":"2026-07-05T05:16:50.458530+00:00"},{"alias_kind":"pith_short_16","alias_value":"65QWRSVH4KG42R2O","created_at":"2026-07-05T05:16:50.458530+00:00"},{"alias_kind":"pith_short_8","alias_value":"65QWRSVH","created_at":"2026-07-05T05:16:50.458530+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26874","citing_title":"Convex combinations of bosonic pure-loss channels","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/65QWRSVH4KG42R2OP4DITBM5Y2","json":"https://pith.science/pith/65QWRSVH4KG42R2OP4DITBM5Y2.json","graph_json":"https://pith.science/api/pith-number/65QWRSVH4KG42R2OP4DITBM5Y2/graph.json","events_json":"https://pith.science/api/pith-number/65QWRSVH4KG42R2OP4DITBM5Y2/events.json","paper":"https://pith.science/paper/65QWRSVH"},"agent_actions":{"view_html":"https://pith.science/pith/65QWRSVH4KG42R2OP4DITBM5Y2","download_json":"https://pith.science/pith/65QWRSVH4KG42R2OP4DITBM5Y2.json","view_paper":"https://pith.science/paper/65QWRSVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.13924&json=true","fetch_graph":"https://pith.science/api/pith-number/65QWRSVH4KG42R2OP4DITBM5Y2/graph.json","fetch_events":"https://pith.science/api/pith-number/65QWRSVH4KG42R2OP4DITBM5Y2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65QWRSVH4KG42R2OP4DITBM5Y2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65QWRSVH4KG42R2OP4DITBM5Y2/action/storage_attestation","attest_author":"https://pith.science/pith/65QWRSVH4KG42R2OP4DITBM5Y2/action/author_attestation","sign_citation":"https://pith.science/pith/65QWRSVH4KG42R2OP4DITBM5Y2/action/citation_signature","submit_replication":"https://pith.science/pith/65QWRSVH4KG42R2OP4DITBM5Y2/action/replication_record"}},"created_at":"2026-07-05T05:16:50.458530+00:00","updated_at":"2026-07-05T05:16:50.458530+00:00"}