{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:6VTMNWANUMKRSDHK6TBY3YW4LD","short_pith_number":"pith:6VTMNWAN","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"},"canonical_sha256":"f566c6d80da315190ceaf4c38de2dc58d1f591ba9a93be1e249f2b663b263424","source":{"kind":"arxiv","id":"0901.2140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.2140","created_at":"2026-05-18T04:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"0901.2140v1","created_at":"2026-05-18T04:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.2140","created_at":"2026-05-18T04:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"6VTMNWANUMKR","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"6VTMNWANUMKRSDHK","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"6VTMNWAN","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:6VTMNWANUMKRSDHK6TBY3YW4LD","target":"record","payload":{"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"},"canonical_sha256":"f566c6d80da315190ceaf4c38de2dc58d1f591ba9a93be1e249f2b663b263424","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"},"source_kind":"arxiv","source_id":"0901.2140","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HCvDplNl5lr96aqG2GiCb/hZthQI0zgWP/Yn4ipHr4vniwa7VKEA2jYj35+Fg3ukylU2joxdFpLxbkcaCz4MAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:39:48.440263Z"},"content_sha256":"02777f30096dabc63879a2c0f5adaafad7fefe3f459388419fe50d0797c45ba5","schema_version":"1.0","event_id":"sha256:02777f30096dabc63879a2c0f5adaafad7fefe3f459388419fe50d0797c45ba5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:6VTMNWANUMKRSDHK6TBY3YW4LD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ER0P83KevaSO1ryVLwHVvTHGrCya2IpMKmLrafCbeqtIIscFcQp4LN9Xdo3dClhV71b9rccAAORiLSItKx0DBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:39:48.440976Z"},"content_sha256":"286eb9c960b8c4a876f05070cc253e1d9872b61f2b585a61a44592d82f1c430b","schema_version":"1.0","event_id":"sha256:286eb9c960b8c4a876f05070cc253e1d9872b61f2b585a61a44592d82f1c430b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD/bundle.json","state_url":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VTMNWANUMKRSDHK6TBY3YW4LD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T18:39:48Z","links":{"resolver":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD","bundle":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD/bundle.json","state":"https://pith.science/pith/6VTMNWANUMKRSDHK6TBY3YW4LD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VTMNWANUMKRSDHK6TBY3YW4LD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:6VTMNWANUMKRSDHK6TBY3YW4LD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"60a715ac32458348e4e383d245522d3b4b7481bb32d94bdbf7c7f08478bbbcb0","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-14T23:07:59Z","title_canon_sha256":"b93760979431165045b4c3bffd83a3513b6caa81e5bf1acbe73a30c19f411fde"},"schema_version":"1.0","source":{"id":"0901.2140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.2140","created_at":"2026-05-18T04:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"0901.2140v1","created_at":"2026-05-18T04:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.2140","created_at":"2026-05-18T04:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"6VTMNWANUMKR","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"6VTMNWANUMKRSDHK","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"6VTMNWAN","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:286eb9c960b8c4a876f05070cc253e1d9872b61f2b585a61a44592d82f1c430b","target":"graph","created_at":"2026-05-18T04:25:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anthony Leverrier, David Elkouss, Joseph Boutros, Romain All\\'eaume","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-14T23:07:59Z","title":"Efficient reconciliation protocol for discrete-variable quantum key distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.2140","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:02777f30096dabc63879a2c0f5adaafad7fefe3f459388419fe50d0797c45ba5","target":"record","created_at":"2026-05-18T04:25:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"60a715ac32458348e4e383d245522d3b4b7481bb32d94bdbf7c7f08478bbbcb0","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-14T23:07:59Z","title_canon_sha256":"b93760979431165045b4c3bffd83a3513b6caa81e5bf1acbe73a30c19f411fde"},"schema_version":"1.0","source":{"id":"0901.2140","kind":"arxiv","version":1}},"canonical_sha256":"f566c6d80da315190ceaf4c38de2dc58d1f591ba9a93be1e249f2b663b263424","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f566c6d80da315190ceaf4c38de2dc58d1f591ba9a93be1e249f2b663b263424","first_computed_at":"2026-05-18T04:25:26.202684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:26.202684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yXhiclHaimotOwFHMGTX5wpYIfTd4JjN1B5oHL+2+/abSe2FKW+cbOIFB4V16MsbPYNOasUcwnRh/oL5UzC1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:26.203596Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.2140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02777f30096dabc63879a2c0f5adaafad7fefe3f459388419fe50d0797c45ba5","sha256:286eb9c960b8c4a876f05070cc253e1d9872b61f2b585a61a44592d82f1c430b"],"state_sha256":"738b0529798ddcb900596b95db754123b166f13f6586878802f6cb5213780aad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+ZoCwAtATDju4VGVJjc3MT/TDn+9McA1zD1XwkmE/yUyfsteindfWtjTDuoN6lYjEcoSOdVqtiekeZ1CYXPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:39:48.444685Z","bundle_sha256":"3a23748decaf132eacdfa7986e8303bffa2e2865066b899a7d2380bb8e986580"}}