{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HUWMUBCJVNCSB66REOK3CDP4UW","short_pith_number":"pith:HUWMUBCJ","schema_version":"1.0","canonical_sha256":"3d2cca0449ab4520fbd12395b10dfca59990fd595ee48a6c6fd4ba0c5c9bef79","source":{"kind":"arxiv","id":"2401.13748","version":1},"attestation_state":"computed","paper":{"title":"Log-Log Domain Sum-Product Algorithm for Information Reconciliation in Continuous-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":"Erdem Eray Cil, Laurent Schmalen","submitted_at":"2024-01-24T19:05:59Z","abstract_excerpt":"In this paper, we present a novel log-log domain sum-product algorithm (SPA) for decoding low-density parity-check (LDPC) codes in continuous-variable quantum key distribution (CV-QKD) systems. This algorithm reduces the fractional bit width of decoder messages, leading to a smaller memory footprint and a lower resource consumption in hardware implementation. We also provide practical insights for fixed-point arithmetic and compare our algorithm with the conventional SPA in terms of performance and complexity. Our results show that our algorithm achieves comparable or better decoding accuracy "},"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":"2401.13748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-24T19:05:59Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"be5c36f1c4263305e668cb4e9c8810ec43765012416343acb1760e096d031b4a","abstract_canon_sha256":"bbeec37c30bbe035f52ea7a55311c0a773353644353335ba5baa75057aa15bf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:37:16.780699Z","signature_b64":"2JtlHy8DUi2rvXhNRQ7SZalQSLcMWGrYHmeDKrnKm8eiNdoCcICx2Cjv8a79PEHldwFst0v+4dfS2vCNw+hgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d2cca0449ab4520fbd12395b10dfca59990fd595ee48a6c6fd4ba0c5c9bef79","last_reissued_at":"2026-07-05T07:37:16.780122Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:37:16.780122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Log-Log Domain Sum-Product Algorithm for Information Reconciliation in Continuous-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":"Erdem Eray Cil, Laurent Schmalen","submitted_at":"2024-01-24T19:05:59Z","abstract_excerpt":"In this paper, we present a novel log-log domain sum-product algorithm (SPA) for decoding low-density parity-check (LDPC) codes in continuous-variable quantum key distribution (CV-QKD) systems. This algorithm reduces the fractional bit width of decoder messages, leading to a smaller memory footprint and a lower resource consumption in hardware implementation. We also provide practical insights for fixed-point arithmetic and compare our algorithm with the conventional SPA in terms of performance and complexity. Our results show that our algorithm achieves comparable or better decoding accuracy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.13748","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/2401.13748/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":"2401.13748","created_at":"2026-07-05T07:37:16.780277+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.13748v1","created_at":"2026-07-05T07:37:16.780277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.13748","created_at":"2026-07-05T07:37:16.780277+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUWMUBCJVNCS","created_at":"2026-07-05T07:37:16.780277+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUWMUBCJVNCSB66R","created_at":"2026-07-05T07:37:16.780277+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUWMUBCJ","created_at":"2026-07-05T07:37:16.780277+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/HUWMUBCJVNCSB66REOK3CDP4UW","json":"https://pith.science/pith/HUWMUBCJVNCSB66REOK3CDP4UW.json","graph_json":"https://pith.science/api/pith-number/HUWMUBCJVNCSB66REOK3CDP4UW/graph.json","events_json":"https://pith.science/api/pith-number/HUWMUBCJVNCSB66REOK3CDP4UW/events.json","paper":"https://pith.science/paper/HUWMUBCJ"},"agent_actions":{"view_html":"https://pith.science/pith/HUWMUBCJVNCSB66REOK3CDP4UW","download_json":"https://pith.science/pith/HUWMUBCJVNCSB66REOK3CDP4UW.json","view_paper":"https://pith.science/paper/HUWMUBCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.13748&json=true","fetch_graph":"https://pith.science/api/pith-number/HUWMUBCJVNCSB66REOK3CDP4UW/graph.json","fetch_events":"https://pith.science/api/pith-number/HUWMUBCJVNCSB66REOK3CDP4UW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUWMUBCJVNCSB66REOK3CDP4UW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUWMUBCJVNCSB66REOK3CDP4UW/action/storage_attestation","attest_author":"https://pith.science/pith/HUWMUBCJVNCSB66REOK3CDP4UW/action/author_attestation","sign_citation":"https://pith.science/pith/HUWMUBCJVNCSB66REOK3CDP4UW/action/citation_signature","submit_replication":"https://pith.science/pith/HUWMUBCJVNCSB66REOK3CDP4UW/action/replication_record"}},"created_at":"2026-07-05T07:37:16.780277+00:00","updated_at":"2026-07-05T07:37:16.780277+00:00"}