{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NEIZHJ5MPBUOHXADMNEBW2L6KF","short_pith_number":"pith:NEIZHJ5M","schema_version":"1.0","canonical_sha256":"691193a7ac7868e3dc0363481b697e516695151f23d58ef284f3c8b7b48e7205","source":{"kind":"arxiv","id":"1510.03510","version":1},"attestation_state":"computed","paper":{"title":"Repeat-Accumulate Codes for 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":"Andrew M. Lance, Sarah J. Johnson, Vikram A. Chandrasetty","submitted_at":"2015-10-13T02:35:56Z","abstract_excerpt":"This paper investigates the design of low-complexity error correction codes for the verification step in continuous variable quantum key distribution (CVQKD) systems. We design new coding schemes based on quasi-cyclic repeat-accumulate codes which demonstrate good performances for CVQKD reconciliation."},"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":"1510.03510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T02:35:56Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"d9de2b2df593c0690719252c324f436ce4ad683ca0169adde0c4654f0ab8af10","abstract_canon_sha256":"a038a2c178500323f20ad8f25da18b9b5643f97f8bb5484dc84aaf2008593205"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:16.985207Z","signature_b64":"2ZZ/2g8EnmEC4ACcFlTo+UhAprJFlkf7ndHXiwnX6JTsbAsFR5ouz+aaGSyCezE8hfAimnypQ+qrZM8CyafCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"691193a7ac7868e3dc0363481b697e516695151f23d58ef284f3c8b7b48e7205","last_reissued_at":"2026-05-18T01:30:16.984580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:16.984580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repeat-Accumulate Codes for 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":"Andrew M. Lance, Sarah J. Johnson, Vikram A. Chandrasetty","submitted_at":"2015-10-13T02:35:56Z","abstract_excerpt":"This paper investigates the design of low-complexity error correction codes for the verification step in continuous variable quantum key distribution (CVQKD) systems. We design new coding schemes based on quasi-cyclic repeat-accumulate codes which demonstrate good performances for CVQKD reconciliation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03510","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":"1510.03510","created_at":"2026-05-18T01:30:16.984655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03510v1","created_at":"2026-05-18T01:30:16.984655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03510","created_at":"2026-05-18T01:30:16.984655+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEIZHJ5MPBUO","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEIZHJ5MPBUOHXAD","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEIZHJ5M","created_at":"2026-05-18T12:29:32.376354+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/NEIZHJ5MPBUOHXADMNEBW2L6KF","json":"https://pith.science/pith/NEIZHJ5MPBUOHXADMNEBW2L6KF.json","graph_json":"https://pith.science/api/pith-number/NEIZHJ5MPBUOHXADMNEBW2L6KF/graph.json","events_json":"https://pith.science/api/pith-number/NEIZHJ5MPBUOHXADMNEBW2L6KF/events.json","paper":"https://pith.science/paper/NEIZHJ5M"},"agent_actions":{"view_html":"https://pith.science/pith/NEIZHJ5MPBUOHXADMNEBW2L6KF","download_json":"https://pith.science/pith/NEIZHJ5MPBUOHXADMNEBW2L6KF.json","view_paper":"https://pith.science/paper/NEIZHJ5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03510&json=true","fetch_graph":"https://pith.science/api/pith-number/NEIZHJ5MPBUOHXADMNEBW2L6KF/graph.json","fetch_events":"https://pith.science/api/pith-number/NEIZHJ5MPBUOHXADMNEBW2L6KF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEIZHJ5MPBUOHXADMNEBW2L6KF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEIZHJ5MPBUOHXADMNEBW2L6KF/action/storage_attestation","attest_author":"https://pith.science/pith/NEIZHJ5MPBUOHXADMNEBW2L6KF/action/author_attestation","sign_citation":"https://pith.science/pith/NEIZHJ5MPBUOHXADMNEBW2L6KF/action/citation_signature","submit_replication":"https://pith.science/pith/NEIZHJ5MPBUOHXADMNEBW2L6KF/action/replication_record"}},"created_at":"2026-05-18T01:30:16.984655+00:00","updated_at":"2026-05-18T01:30:16.984655+00:00"}