{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3QR7MHLMURLJ6GZMM5EZCRVCUW","short_pith_number":"pith:3QR7MHLM","schema_version":"1.0","canonical_sha256":"dc23f61d6ca4569f1b2c67499146a2a5a9030379f37f97ef6e53b6cae0dee819","source":{"kind":"arxiv","id":"2202.11090","version":1},"attestation_state":"computed","paper":{"title":"Total insecurity of communication via strong converse for quantum privacy amplification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Nilanjana Datta, Robert Salzmann","submitted_at":"2022-02-22T18:34:59Z","abstract_excerpt":"Quantum privacy amplification is a central task in quantum cryptography. Given shared randomness, which is initially correlated with a quantum system held by an eavesdropper, the goal is to extract uniform randomness which is decoupled from the latter. The optimal rate for this task is known to satisfy the strong converse property and we provide a lower bound on the corresponding strong converse exponent. In the strong converse region, the distance of the final state of the protocol from the desired decoupled state converges exponentially fast to its maximal value, in the asymptotic limit. We "},"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":"2202.11090","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-02-22T18:34:59Z","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"title_canon_sha256":"cd10920c10738b1a02250ec94f73036b5e44a94daaec9fc4671d95fac724fe24","abstract_canon_sha256":"842a03a7018a765a51a1432fc9b4f54ebd37094637977bd89cb975ebb482e10a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:59:11.176943Z","signature_b64":"W98nS7dVbUKZSrj1OS6YptI97+BkmiDlDf/Tf4vyWU6ZjEHKnlE9EHPWUPdkgCj/7CozCQ5o6S4+dmHEYClGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc23f61d6ca4569f1b2c67499146a2a5a9030379f37f97ef6e53b6cae0dee819","last_reissued_at":"2026-07-05T03:59:11.176525Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:59:11.176525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total insecurity of communication via strong converse for quantum privacy amplification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Nilanjana Datta, Robert Salzmann","submitted_at":"2022-02-22T18:34:59Z","abstract_excerpt":"Quantum privacy amplification is a central task in quantum cryptography. Given shared randomness, which is initially correlated with a quantum system held by an eavesdropper, the goal is to extract uniform randomness which is decoupled from the latter. The optimal rate for this task is known to satisfy the strong converse property and we provide a lower bound on the corresponding strong converse exponent. In the strong converse region, the distance of the final state of the protocol from the desired decoupled state converges exponentially fast to its maximal value, in the asymptotic limit. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.11090","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/2202.11090/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":"2202.11090","created_at":"2026-07-05T03:59:11.176584+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.11090v1","created_at":"2026-07-05T03:59:11.176584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.11090","created_at":"2026-07-05T03:59:11.176584+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QR7MHLMURLJ","created_at":"2026-07-05T03:59:11.176584+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QR7MHLMURLJ6GZM","created_at":"2026-07-05T03:59:11.176584+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QR7MHLM","created_at":"2026-07-05T03:59:11.176584+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.06050","citing_title":"Strong converse Exponents of Partially Smoothed Information Measures","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3QR7MHLMURLJ6GZMM5EZCRVCUW","json":"https://pith.science/pith/3QR7MHLMURLJ6GZMM5EZCRVCUW.json","graph_json":"https://pith.science/api/pith-number/3QR7MHLMURLJ6GZMM5EZCRVCUW/graph.json","events_json":"https://pith.science/api/pith-number/3QR7MHLMURLJ6GZMM5EZCRVCUW/events.json","paper":"https://pith.science/paper/3QR7MHLM"},"agent_actions":{"view_html":"https://pith.science/pith/3QR7MHLMURLJ6GZMM5EZCRVCUW","download_json":"https://pith.science/pith/3QR7MHLMURLJ6GZMM5EZCRVCUW.json","view_paper":"https://pith.science/paper/3QR7MHLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.11090&json=true","fetch_graph":"https://pith.science/api/pith-number/3QR7MHLMURLJ6GZMM5EZCRVCUW/graph.json","fetch_events":"https://pith.science/api/pith-number/3QR7MHLMURLJ6GZMM5EZCRVCUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QR7MHLMURLJ6GZMM5EZCRVCUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QR7MHLMURLJ6GZMM5EZCRVCUW/action/storage_attestation","attest_author":"https://pith.science/pith/3QR7MHLMURLJ6GZMM5EZCRVCUW/action/author_attestation","sign_citation":"https://pith.science/pith/3QR7MHLMURLJ6GZMM5EZCRVCUW/action/citation_signature","submit_replication":"https://pith.science/pith/3QR7MHLMURLJ6GZMM5EZCRVCUW/action/replication_record"}},"created_at":"2026-07-05T03:59:11.176584+00:00","updated_at":"2026-07-05T03:59:11.176584+00:00"}