{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:6VTMNWANUMKRSDHK6TBY3YW4LD","short_pith_number":"pith:6VTMNWAN","schema_version":"1.0","canonical_sha256":"f566c6d80da315190ceaf4c38de2dc58d1f591ba9a93be1e249f2b663b263424","source":{"kind":"arxiv","id":"0901.2140","version":1},"attestation_state":"computed","paper":{"title":"Efficient reconciliation protocol for discrete-variable quantum key distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Anthony Leverrier, David Elkouss, Joseph Boutros, Romain All\\'eaume","submitted_at":"2009-01-14T23:07:59Z","abstract_excerpt":"Reconciliation is an essential part of any secret-key agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information.\n  In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with Low Density Parity Check (LDPC) codes optimized for the BSC. In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with r"},"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":"0901.2140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-14T23:07:59Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"b93760979431165045b4c3bffd83a3513b6caa81e5bf1acbe73a30c19f411fde","abstract_canon_sha256":"60a715ac32458348e4e383d245522d3b4b7481bb32d94bdbf7c7f08478bbbcb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:26.203596Z","signature_b64":"yXhiclHaimotOwFHMGTX5wpYIfTd4JjN1B5oHL+2+/abSe2FKW+cbOIFB4V16MsbPYNOasUcwnRh/oL5UzC1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f566c6d80da315190ceaf4c38de2dc58d1f591ba9a93be1e249f2b663b263424","last_reissued_at":"2026-05-18T04:25:26.202684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:26.202684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient reconciliation protocol for discrete-variable quantum key distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Anthony Leverrier, David Elkouss, Joseph Boutros, Romain All\\'eaume","submitted_at":"2009-01-14T23:07:59Z","abstract_excerpt":"Reconciliation is an essential part of any secret-key agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information.\n  In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with Low Density Parity Check (LDPC) codes optimized for the BSC. In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.2140","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":""},"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":"0901.2140","created_at":"2026-05-18T04:25:26.202820+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.2140v1","created_at":"2026-05-18T04:25:26.202820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.2140","created_at":"2026-05-18T04:25:26.202820+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VTMNWANUMKR","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VTMNWANUMKRSDHK","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VTMNWAN","created_at":"2026-05-18T12:25:58.837520+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD","json":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD.json","graph_json":"https://pith.science/api/pith-number/6VTMNWANUMKRSDHK6TBY3YW4LD/graph.json","events_json":"https://pith.science/api/pith-number/6VTMNWANUMKRSDHK6TBY3YW4LD/events.json","paper":"https://pith.science/paper/6VTMNWAN"},"agent_actions":{"view_html":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD","download_json":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD.json","view_paper":"https://pith.science/paper/6VTMNWAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.2140&json=true","fetch_graph":"https://pith.science/api/pith-number/6VTMNWANUMKRSDHK6TBY3YW4LD/graph.json","fetch_events":"https://pith.science/api/pith-number/6VTMNWANUMKRSDHK6TBY3YW4LD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD/action/storage_attestation","attest_author":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD/action/author_attestation","sign_citation":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD/action/citation_signature","submit_replication":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD/action/replication_record"}},"created_at":"2026-05-18T04:25:26.202820+00:00","updated_at":"2026-05-18T04:25:26.202820+00:00"}