{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FYPFXBOS7PJ6S2ACAQDMQ6TP3B","short_pith_number":"pith:FYPFXBOS","schema_version":"1.0","canonical_sha256":"2e1e5b85d2fbd3e968020406c87a6fd8703d0813289219725906cadda5e9df0e","source":{"kind":"arxiv","id":"2203.04993","version":2},"attestation_state":"computed","paper":{"title":"Security of quantum key distribution from generalised entropy accumulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Renato Renner, Tony Metger","submitted_at":"2022-03-09T19:00:07Z","abstract_excerpt":"The goal of quantum key distribution (QKD) is to establish a secure key between two parties connected by an insecure quantum channel. To use a QKD protocol in practice, one has to prove that a finite size key is secure against general attacks: no matter the adversary's attack, they cannot gain useful information about the key. A much simpler task is to prove security against collective attacks, where the adversary is assumed to behave identically and independently in each round. In this work, we provide a formal framework for general QKD protocols and show that for any protocol that can be exp"},"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.04993","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-09T19:00:07Z","cross_cats_sorted":[],"title_canon_sha256":"7a5650d5974b91214b8f42f0af4cbdc2460fdbe9929b474d4e4b743ef1cf6523","abstract_canon_sha256":"873c30d40ade7053b3e73580e7ba662b38b7d70bb449cf92da58222617e730dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:05.169100Z","signature_b64":"B4oblKIZ0cqKCQ4apOCBRFFDj3Ifef+vA5i+WVasCG1M15xt4jp9azwsPDYwvJOsAq4SJkKTqWCWn/X0SLulBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e1e5b85d2fbd3e968020406c87a6fd8703d0813289219725906cadda5e9df0e","last_reissued_at":"2026-07-05T07:14:05.168682Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:05.168682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Security of quantum key distribution from generalised entropy accumulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Renato Renner, Tony Metger","submitted_at":"2022-03-09T19:00:07Z","abstract_excerpt":"The goal of quantum key distribution (QKD) is to establish a secure key between two parties connected by an insecure quantum channel. To use a QKD protocol in practice, one has to prove that a finite size key is secure against general attacks: no matter the adversary's attack, they cannot gain useful information about the key. A much simpler task is to prove security against collective attacks, where the adversary is assumed to behave identically and independently in each round. In this work, we provide a formal framework for general QKD protocols and show that for any protocol that can be exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04993","kind":"arxiv","version":2},"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.04993/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.04993","created_at":"2026-07-05T07:14:05.168738+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.04993v2","created_at":"2026-07-05T07:14:05.168738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04993","created_at":"2026-07-05T07:14:05.168738+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYPFXBOS7PJ6","created_at":"2026-07-05T07:14:05.168738+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYPFXBOS7PJ6S2AC","created_at":"2026-07-05T07:14:05.168738+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYPFXBOS","created_at":"2026-07-05T07:14:05.168738+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.10584","citing_title":"Finite-size quantum key distribution rates from R\\'enyi entropies using conic optimization","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FYPFXBOS7PJ6S2ACAQDMQ6TP3B","json":"https://pith.science/pith/FYPFXBOS7PJ6S2ACAQDMQ6TP3B.json","graph_json":"https://pith.science/api/pith-number/FYPFXBOS7PJ6S2ACAQDMQ6TP3B/graph.json","events_json":"https://pith.science/api/pith-number/FYPFXBOS7PJ6S2ACAQDMQ6TP3B/events.json","paper":"https://pith.science/paper/FYPFXBOS"},"agent_actions":{"view_html":"https://pith.science/pith/FYPFXBOS7PJ6S2ACAQDMQ6TP3B","download_json":"https://pith.science/pith/FYPFXBOS7PJ6S2ACAQDMQ6TP3B.json","view_paper":"https://pith.science/paper/FYPFXBOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.04993&json=true","fetch_graph":"https://pith.science/api/pith-number/FYPFXBOS7PJ6S2ACAQDMQ6TP3B/graph.json","fetch_events":"https://pith.science/api/pith-number/FYPFXBOS7PJ6S2ACAQDMQ6TP3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYPFXBOS7PJ6S2ACAQDMQ6TP3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYPFXBOS7PJ6S2ACAQDMQ6TP3B/action/storage_attestation","attest_author":"https://pith.science/pith/FYPFXBOS7PJ6S2ACAQDMQ6TP3B/action/author_attestation","sign_citation":"https://pith.science/pith/FYPFXBOS7PJ6S2ACAQDMQ6TP3B/action/citation_signature","submit_replication":"https://pith.science/pith/FYPFXBOS7PJ6S2ACAQDMQ6TP3B/action/replication_record"}},"created_at":"2026-07-05T07:14:05.168738+00:00","updated_at":"2026-07-05T07:14:05.168738+00:00"}