{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RQ4TBDJRDXW3UBDWZ6GGTZSPED","short_pith_number":"pith:RQ4TBDJR","schema_version":"1.0","canonical_sha256":"8c39308d311dedba0476cf8c69e64f20d9932737ebe8755566fcec506dff07ae","source":{"kind":"arxiv","id":"1702.07740","version":2},"attestation_state":"computed","paper":{"title":"Key Reconciliation with Low-Density Parity-Check Codes for Long-Distance Quantum Cryptography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Chen Feng, Lei M. Zhang, Mario Milicevic, P. Glenn Gulak","submitted_at":"2017-02-24T19:52:07Z","abstract_excerpt":"The speed at which two remote parties can exchange secret keys over a fixed-length fiber-optic cable in continuous-variable quantum key distribution (CV-QKD) is currently limited by the computational complexity of post-processing algorithms for key reconciliation. Multi-edge low-density parity-check (LDPC) codes with low code rates and long block lengths were proposed for CV-QKD, in order to extend the maximum reconciliation distance between the two remote parties. Key reconciliation over multiple dimensions has been shown to further improve the error-correction performance of multi-edge LDPC "},"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":"1702.07740","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-02-24T19:52:07Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"d1c2516107f04d7d11e94f42c2c0aeb66632f4dbed5e8e4d3ab53ab2c0464955","abstract_canon_sha256":"8509288960b0dc571b734227bf148c37130992cb9bb7fe902ba89626e9329ecd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:04.971053Z","signature_b64":"xrG0jajyr/48YTtnn1iR99gm4pdHKbTMyyPeEKm3lqg4B2Q0uSnHNADlDWW3m1AoqocU8CiikM4ZThsrjt4OCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c39308d311dedba0476cf8c69e64f20d9932737ebe8755566fcec506dff07ae","last_reissued_at":"2026-05-17T23:45:04.970197Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:04.970197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Key Reconciliation with Low-Density Parity-Check Codes for Long-Distance Quantum Cryptography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Chen Feng, Lei M. Zhang, Mario Milicevic, P. Glenn Gulak","submitted_at":"2017-02-24T19:52:07Z","abstract_excerpt":"The speed at which two remote parties can exchange secret keys over a fixed-length fiber-optic cable in continuous-variable quantum key distribution (CV-QKD) is currently limited by the computational complexity of post-processing algorithms for key reconciliation. Multi-edge low-density parity-check (LDPC) codes with low code rates and long block lengths were proposed for CV-QKD, in order to extend the maximum reconciliation distance between the two remote parties. Key reconciliation over multiple dimensions has been shown to further improve the error-correction performance of multi-edge LDPC "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07740","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":""},"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":"1702.07740","created_at":"2026-05-17T23:45:04.970289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07740v2","created_at":"2026-05-17T23:45:04.970289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07740","created_at":"2026-05-17T23:45:04.970289+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQ4TBDJRDXW3","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQ4TBDJRDXW3UBDW","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQ4TBDJR","created_at":"2026-05-18T12:31:39.905425+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/RQ4TBDJRDXW3UBDWZ6GGTZSPED","json":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED.json","graph_json":"https://pith.science/api/pith-number/RQ4TBDJRDXW3UBDWZ6GGTZSPED/graph.json","events_json":"https://pith.science/api/pith-number/RQ4TBDJRDXW3UBDWZ6GGTZSPED/events.json","paper":"https://pith.science/paper/RQ4TBDJR"},"agent_actions":{"view_html":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED","download_json":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED.json","view_paper":"https://pith.science/paper/RQ4TBDJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07740&json=true","fetch_graph":"https://pith.science/api/pith-number/RQ4TBDJRDXW3UBDWZ6GGTZSPED/graph.json","fetch_events":"https://pith.science/api/pith-number/RQ4TBDJRDXW3UBDWZ6GGTZSPED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED/action/storage_attestation","attest_author":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED/action/author_attestation","sign_citation":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED/action/citation_signature","submit_replication":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED/action/replication_record"}},"created_at":"2026-05-17T23:45:04.970289+00:00","updated_at":"2026-05-17T23:45:04.970289+00:00"}