{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FSQE3ICMZMVTCKB4UPERVKBRIC","short_pith_number":"pith:FSQE3ICM","schema_version":"1.0","canonical_sha256":"2ca04da04ccb2b31283ca3c91aa83140b35b5fad95d3bf8b517e6169137d9dae","source":{"kind":"arxiv","id":"1601.00966","version":4},"attestation_state":"computed","paper":{"title":"Capacities of repeater-assisted quantum communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other","math-ph","math.MP","physics.optics"],"primary_cat":"quant-ph","authors_text":"Stefano Pirandola","submitted_at":"2016-01-05T21:00:01Z","abstract_excerpt":"We consider quantum and private communications assisted by repeaters, from the basic scenario of a single repeater chain to the general case of an arbitrarily-complex quantum network, where systems may be routed through single or multiple paths. In this context, we investigate the ultimate rates at which two end-parties may transmit quantum information, distribute entanglement, or generate secret keys. These end-to-end capacities are defined by optimizing over the most general adaptive protocols that are allowed by quantum mechanics. Combining techniques from quantum information and classical "},"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":"1601.00966","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-01-05T21:00:01Z","cross_cats_sorted":["cond-mat.other","math-ph","math.MP","physics.optics"],"title_canon_sha256":"9a3b4bd0651bd3388d12f12dd3c053ddf64a84481618bcfd49f04387d2dc9b67","abstract_canon_sha256":"b47acba68b82aba729b075158b364c9bac672199a589ea0aeb4bccb4c78b23d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:58.750708Z","signature_b64":"phbDIrCHNg5FOQKBBEFn+4Kt+BM67YLJGRf6scAsJIBXYGpahm+5plFfCv5GA9D5SRznqaYycwcIjgiuIBBdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ca04da04ccb2b31283ca3c91aa83140b35b5fad95d3bf8b517e6169137d9dae","last_reissued_at":"2026-05-18T00:37:58.750282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:58.750282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacities of repeater-assisted quantum communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other","math-ph","math.MP","physics.optics"],"primary_cat":"quant-ph","authors_text":"Stefano Pirandola","submitted_at":"2016-01-05T21:00:01Z","abstract_excerpt":"We consider quantum and private communications assisted by repeaters, from the basic scenario of a single repeater chain to the general case of an arbitrarily-complex quantum network, where systems may be routed through single or multiple paths. In this context, we investigate the ultimate rates at which two end-parties may transmit quantum information, distribute entanglement, or generate secret keys. These end-to-end capacities are defined by optimizing over the most general adaptive protocols that are allowed by quantum mechanics. Combining techniques from quantum information and classical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00966","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":""},"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":"1601.00966","created_at":"2026-05-18T00:37:58.750357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00966v4","created_at":"2026-05-18T00:37:58.750357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00966","created_at":"2026-05-18T00:37:58.750357+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSQE3ICMZMVT","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSQE3ICMZMVTCKB4","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSQE3ICM","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.06770","citing_title":"Relaying Quantum Information","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FSQE3ICMZMVTCKB4UPERVKBRIC","json":"https://pith.science/pith/FSQE3ICMZMVTCKB4UPERVKBRIC.json","graph_json":"https://pith.science/api/pith-number/FSQE3ICMZMVTCKB4UPERVKBRIC/graph.json","events_json":"https://pith.science/api/pith-number/FSQE3ICMZMVTCKB4UPERVKBRIC/events.json","paper":"https://pith.science/paper/FSQE3ICM"},"agent_actions":{"view_html":"https://pith.science/pith/FSQE3ICMZMVTCKB4UPERVKBRIC","download_json":"https://pith.science/pith/FSQE3ICMZMVTCKB4UPERVKBRIC.json","view_paper":"https://pith.science/paper/FSQE3ICM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00966&json=true","fetch_graph":"https://pith.science/api/pith-number/FSQE3ICMZMVTCKB4UPERVKBRIC/graph.json","fetch_events":"https://pith.science/api/pith-number/FSQE3ICMZMVTCKB4UPERVKBRIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSQE3ICMZMVTCKB4UPERVKBRIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSQE3ICMZMVTCKB4UPERVKBRIC/action/storage_attestation","attest_author":"https://pith.science/pith/FSQE3ICMZMVTCKB4UPERVKBRIC/action/author_attestation","sign_citation":"https://pith.science/pith/FSQE3ICMZMVTCKB4UPERVKBRIC/action/citation_signature","submit_replication":"https://pith.science/pith/FSQE3ICMZMVTCKB4UPERVKBRIC/action/replication_record"}},"created_at":"2026-05-18T00:37:58.750357+00:00","updated_at":"2026-05-18T00:37:58.750357+00:00"}