{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RQ4TBDJRDXW3UBDWZ6GGTZSPED","short_pith_number":"pith:RQ4TBDJR","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"},"canonical_sha256":"8c39308d311dedba0476cf8c69e64f20d9932737ebe8755566fcec506dff07ae","source":{"kind":"arxiv","id":"1702.07740","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07740","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07740v2","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07740","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"RQ4TBDJRDXW3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQ4TBDJRDXW3UBDW","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQ4TBDJR","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RQ4TBDJRDXW3UBDWZ6GGTZSPED","target":"record","payload":{"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"},"canonical_sha256":"8c39308d311dedba0476cf8c69e64f20d9932737ebe8755566fcec506dff07ae","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"},"source_kind":"arxiv","source_id":"1702.07740","source_version":2,"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-17T23:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tR+W2kdKOxHHBXhXZ3oNF3VnGfVzDZ/JNUYBLnFrcv0yGgn5kEsQKRnWdb+zeIYmZWYVPeYgFquTrZkFKkArCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:38:28.239963Z"},"content_sha256":"38f7ded20feb588304f8e695bdffb03724b3302d84622fe496b22c82ed483e52","schema_version":"1.0","event_id":"sha256:38f7ded20feb588304f8e695bdffb03724b3302d84622fe496b22c82ed483e52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RQ4TBDJRDXW3UBDWZ6GGTZSPED","target":"graph","payload":{"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"},"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-17T23:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AuhfU+wnx9QgTS0kbLgMydSNb9QOY3GVgWuoiPGHctuXIaWFW56OgdRVpp9QAoTMecItR4As4vP8cV0tGcZdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:38:28.240331Z"},"content_sha256":"1942d8f1d3933011685b075746f43bbf9766613a4d86e5196fc4299f2d7936cc","schema_version":"1.0","event_id":"sha256:1942d8f1d3933011685b075746f43bbf9766613a4d86e5196fc4299f2d7936cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED/bundle.json","state_url":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED/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-11T13:38:28Z","links":{"resolver":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED","bundle":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED/bundle.json","state":"https://pith.science/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQ4TBDJRDXW3UBDWZ6GGTZSPED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RQ4TBDJRDXW3UBDWZ6GGTZSPED","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":"8509288960b0dc571b734227bf148c37130992cb9bb7fe902ba89626e9329ecd","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-02-24T19:52:07Z","title_canon_sha256":"d1c2516107f04d7d11e94f42c2c0aeb66632f4dbed5e8e4d3ab53ab2c0464955"},"schema_version":"1.0","source":{"id":"1702.07740","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07740","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07740v2","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07740","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"RQ4TBDJRDXW3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQ4TBDJRDXW3UBDW","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQ4TBDJR","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:1942d8f1d3933011685b075746f43bbf9766613a4d86e5196fc4299f2d7936cc","target":"graph","created_at":"2026-05-17T23:45:04Z","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":"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 ","authors_text":"Chen Feng, Lei M. Zhang, Mario Milicevic, P. Glenn Gulak","cross_cats":["cs.CR","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-02-24T19:52:07Z","title":"Key Reconciliation with Low-Density Parity-Check Codes for Long-Distance Quantum Cryptography"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07740","kind":"arxiv","version":2},"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:38f7ded20feb588304f8e695bdffb03724b3302d84622fe496b22c82ed483e52","target":"record","created_at":"2026-05-17T23:45:04Z","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":"8509288960b0dc571b734227bf148c37130992cb9bb7fe902ba89626e9329ecd","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-02-24T19:52:07Z","title_canon_sha256":"d1c2516107f04d7d11e94f42c2c0aeb66632f4dbed5e8e4d3ab53ab2c0464955"},"schema_version":"1.0","source":{"id":"1702.07740","kind":"arxiv","version":2}},"canonical_sha256":"8c39308d311dedba0476cf8c69e64f20d9932737ebe8755566fcec506dff07ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c39308d311dedba0476cf8c69e64f20d9932737ebe8755566fcec506dff07ae","first_computed_at":"2026-05-17T23:45:04.970197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:04.970197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xrG0jajyr/48YTtnn1iR99gm4pdHKbTMyyPeEKm3lqg4B2Q0uSnHNADlDWW3m1AoqocU8CiikM4ZThsrjt4OCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:04.971053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07740","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38f7ded20feb588304f8e695bdffb03724b3302d84622fe496b22c82ed483e52","sha256:1942d8f1d3933011685b075746f43bbf9766613a4d86e5196fc4299f2d7936cc"],"state_sha256":"126175d1011f9f2d885d89ca2681d89e0ba75be5cffc03984be8810019ca40f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ts7dCunOfLxC65e+Ah9fgw+5CGn7RQyH+gV4+oozNVN0Gdd4tVFTYLUxHrwxsAOwOhaqT7PLlsS2BbsljWsNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:38:28.242608Z","bundle_sha256":"ec8892cc0e56c5bd301fcc3e91214d21e1b40196073e4bd1f9c105d0ed9a40c3"}}