{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ZPHV4ZR5LPUJCW2BKZFFE6S47A","short_pith_number":"pith:ZPHV4ZR5","schema_version":"1.0","canonical_sha256":"cbcf5e663d5be8915b41564a527a5cf80c929dc3d27182ec9a1cab717a8bb42c","source":{"kind":"arxiv","id":"2207.09930","version":1},"attestation_state":"computed","paper":{"title":"Deep reinforcement learning for key distribution based on quantum repeaters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter van Loock, Simon Daniel Rei{\\ss}","submitted_at":"2022-07-20T14:14:16Z","abstract_excerpt":"This work examines secret key rates of key distribution based on quantum repeaters in a broad parameter space of the communication distance and coherence time of the quantum memories. As the first step in this task, a Markov decision process modeling the distribution of entangled quantum states via quantum repeaters is developed. Based on this model, a simulation is implemented, which is employed to determine secret key rates under naively controlled, limited memory storage times for a wide range of parameters. The complexity of the quantum state evolution in a multiple-segment quantum repeate"},"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":"2207.09930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-20T14:14:16Z","cross_cats_sorted":[],"title_canon_sha256":"a17d0b7616315fb5e8a27370b5c8bbcb7675f0c38d51fb0de0460ef00a3b1998","abstract_canon_sha256":"526eb71e9cf5bed171d5f0584941c20e376f4b4ff50d3c868c934ce9a35f4da9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:32:00.254465Z","signature_b64":"F60IIiR+tAPPfRN90Ft+j2ZQTHq3uNctzEhD1u49egaM/dXoVbx489xR4HHDoEvNfhe2DaG0dFNbosnx6hr9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbcf5e663d5be8915b41564a527a5cf80c929dc3d27182ec9a1cab717a8bb42c","last_reissued_at":"2026-07-05T06:32:00.254110Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:32:00.254110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep reinforcement learning for key distribution based on quantum repeaters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter van Loock, Simon Daniel Rei{\\ss}","submitted_at":"2022-07-20T14:14:16Z","abstract_excerpt":"This work examines secret key rates of key distribution based on quantum repeaters in a broad parameter space of the communication distance and coherence time of the quantum memories. As the first step in this task, a Markov decision process modeling the distribution of entangled quantum states via quantum repeaters is developed. Based on this model, a simulation is implemented, which is employed to determine secret key rates under naively controlled, limited memory storage times for a wide range of parameters. The complexity of the quantum state evolution in a multiple-segment quantum repeate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.09930","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/2207.09930/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":"2207.09930","created_at":"2026-07-05T06:32:00.254171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.09930v1","created_at":"2026-07-05T06:32:00.254171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.09930","created_at":"2026-07-05T06:32:00.254171+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPHV4ZR5LPUJ","created_at":"2026-07-05T06:32:00.254171+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPHV4ZR5LPUJCW2B","created_at":"2026-07-05T06:32:00.254171+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPHV4ZR5","created_at":"2026-07-05T06:32:00.254171+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.04252","citing_title":"A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks","ref_index":87,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZPHV4ZR5LPUJCW2BKZFFE6S47A","json":"https://pith.science/pith/ZPHV4ZR5LPUJCW2BKZFFE6S47A.json","graph_json":"https://pith.science/api/pith-number/ZPHV4ZR5LPUJCW2BKZFFE6S47A/graph.json","events_json":"https://pith.science/api/pith-number/ZPHV4ZR5LPUJCW2BKZFFE6S47A/events.json","paper":"https://pith.science/paper/ZPHV4ZR5"},"agent_actions":{"view_html":"https://pith.science/pith/ZPHV4ZR5LPUJCW2BKZFFE6S47A","download_json":"https://pith.science/pith/ZPHV4ZR5LPUJCW2BKZFFE6S47A.json","view_paper":"https://pith.science/paper/ZPHV4ZR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.09930&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPHV4ZR5LPUJCW2BKZFFE6S47A/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPHV4ZR5LPUJCW2BKZFFE6S47A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPHV4ZR5LPUJCW2BKZFFE6S47A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPHV4ZR5LPUJCW2BKZFFE6S47A/action/storage_attestation","attest_author":"https://pith.science/pith/ZPHV4ZR5LPUJCW2BKZFFE6S47A/action/author_attestation","sign_citation":"https://pith.science/pith/ZPHV4ZR5LPUJCW2BKZFFE6S47A/action/citation_signature","submit_replication":"https://pith.science/pith/ZPHV4ZR5LPUJCW2BKZFFE6S47A/action/replication_record"}},"created_at":"2026-07-05T06:32:00.254171+00:00","updated_at":"2026-07-05T06:32:00.254171+00:00"}