{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3CCWYAMIO6KTTT5JXNCLYVKCYJ","short_pith_number":"pith:3CCWYAMI","schema_version":"1.0","canonical_sha256":"d8856c0188779539cfa9bb44bc5542c27a7542fa9fe1bb8419135073383c9954","source":{"kind":"arxiv","id":"2203.10318","version":1},"attestation_state":"computed","paper":{"title":"Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Evgeny Shchukin, Frank Schmidt, Lars Kamin, Peter van Loock","submitted_at":"2022-03-19T12:55:56Z","abstract_excerpt":"We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. One of our main motivations is to address the question whether simply placing quantum memories along a quantum communication channel can be beneficial in a realistic setting. The underlying model assumes deterministic entanglement swapping of single-spin quantum memories and it excludes probabilistic entanglement distillation, and thus two-way classical communication, on higher nesting levels. Within this framework, we identify the essential properties of any optim"},"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.10318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-19T12:55:56Z","cross_cats_sorted":[],"title_canon_sha256":"1e8c0e091a84cd5d966d0e064c604682810ad9035c15588f858db3cbb1291f49","abstract_canon_sha256":"f6d7cfdbc883fb34dd9e8b204567404425a3f432e70bf83790a89bd130697510"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:51.601449Z","signature_b64":"K/gV85LlvqqYjueXj75/utCjIGiEOism7uTFXW8WSF6NFHQSBNZAmU3hI7l5V8yVBD6HYwgi6vGYv0zYIuyADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8856c0188779539cfa9bb44bc5542c27a7542fa9fe1bb8419135073383c9954","last_reissued_at":"2026-07-05T04:06:51.600967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:51.600967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Evgeny Shchukin, Frank Schmidt, Lars Kamin, Peter van Loock","submitted_at":"2022-03-19T12:55:56Z","abstract_excerpt":"We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. One of our main motivations is to address the question whether simply placing quantum memories along a quantum communication channel can be beneficial in a realistic setting. The underlying model assumes deterministic entanglement swapping of single-spin quantum memories and it excludes probabilistic entanglement distillation, and thus two-way classical communication, on higher nesting levels. Within this framework, we identify the essential properties of any optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.10318","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/2203.10318/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.10318","created_at":"2026-07-05T04:06:51.601025+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.10318v1","created_at":"2026-07-05T04:06:51.601025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.10318","created_at":"2026-07-05T04:06:51.601025+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CCWYAMIO6KT","created_at":"2026-07-05T04:06:51.601025+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CCWYAMIO6KTTT5J","created_at":"2026-07-05T04:06:51.601025+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CCWYAMI","created_at":"2026-07-05T04:06:51.601025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.12582","citing_title":"A Modular Quantum Network Architecture for Integrating Network Scheduling with Local Program Execution","ref_index":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3CCWYAMIO6KTTT5JXNCLYVKCYJ","json":"https://pith.science/pith/3CCWYAMIO6KTTT5JXNCLYVKCYJ.json","graph_json":"https://pith.science/api/pith-number/3CCWYAMIO6KTTT5JXNCLYVKCYJ/graph.json","events_json":"https://pith.science/api/pith-number/3CCWYAMIO6KTTT5JXNCLYVKCYJ/events.json","paper":"https://pith.science/paper/3CCWYAMI"},"agent_actions":{"view_html":"https://pith.science/pith/3CCWYAMIO6KTTT5JXNCLYVKCYJ","download_json":"https://pith.science/pith/3CCWYAMIO6KTTT5JXNCLYVKCYJ.json","view_paper":"https://pith.science/paper/3CCWYAMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.10318&json=true","fetch_graph":"https://pith.science/api/pith-number/3CCWYAMIO6KTTT5JXNCLYVKCYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3CCWYAMIO6KTTT5JXNCLYVKCYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CCWYAMIO6KTTT5JXNCLYVKCYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CCWYAMIO6KTTT5JXNCLYVKCYJ/action/storage_attestation","attest_author":"https://pith.science/pith/3CCWYAMIO6KTTT5JXNCLYVKCYJ/action/author_attestation","sign_citation":"https://pith.science/pith/3CCWYAMIO6KTTT5JXNCLYVKCYJ/action/citation_signature","submit_replication":"https://pith.science/pith/3CCWYAMIO6KTTT5JXNCLYVKCYJ/action/replication_record"}},"created_at":"2026-07-05T04:06:51.601025+00:00","updated_at":"2026-07-05T04:06:51.601025+00:00"}