{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:6NRBXRPKE5EOD5P7KJVCD3VVRX","short_pith_number":"pith:6NRBXRPK","schema_version":"1.0","canonical_sha256":"f3621bc5ea2748e1f5ff526a21eeb58de98c2641ebaa81daf1390b9d93c6a63b","source":{"kind":"arxiv","id":"1006.2660","version":1},"attestation_state":"computed","paper":{"title":"Rate Compatible Protocol for Information Reconciliation: An application to QKD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Lancho, David Elkouss, Jesus Martinez-Mateo, Vicente Martin","submitted_at":"2010-06-14T10:29:29Z","abstract_excerpt":"Information Reconciliation is a mechanism that allows to weed out the discrepancies between two correlated variables. It is an essential component in every key agreement protocol where the key has to be transmitted through a noisy channel. The typical case is in the satellite scenario described by Maurer in the early 90's. Recently the need has arisen in relation with Quantum Key Distribution (QKD) protocols, where it is very important not to reveal unnecessary information in order to maximize the shared key length. In this paper we present an information reconciliation protocol based on a rat"},"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":"1006.2660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-14T10:29:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cd8d6b27ecba7f8ce5786d0b8286060859b7ca1d6f120026ff2019fc8e41917f","abstract_canon_sha256":"fd0626aef2a6a374dea512bf215e365c67a014c5c07171f4d16d1ba39a18cc23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:25.930115Z","signature_b64":"9yFxFDIroJ+yAw3McXS4IeGJL9fXdnBzB6B0n5S/uImX8dx6QFW6q8WQ1byymvAoBs750t201DZgC2yuUuhSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3621bc5ea2748e1f5ff526a21eeb58de98c2641ebaa81daf1390b9d93c6a63b","last_reissued_at":"2026-05-18T04:25:25.929272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:25.929272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate Compatible Protocol for Information Reconciliation: An application to QKD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Lancho, David Elkouss, Jesus Martinez-Mateo, Vicente Martin","submitted_at":"2010-06-14T10:29:29Z","abstract_excerpt":"Information Reconciliation is a mechanism that allows to weed out the discrepancies between two correlated variables. It is an essential component in every key agreement protocol where the key has to be transmitted through a noisy channel. The typical case is in the satellite scenario described by Maurer in the early 90's. Recently the need has arisen in relation with Quantum Key Distribution (QKD) protocols, where it is very important not to reveal unnecessary information in order to maximize the shared key length. In this paper we present an information reconciliation protocol based on a rat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2660","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":"1006.2660","created_at":"2026-05-18T04:25:25.929416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.2660v1","created_at":"2026-05-18T04:25:25.929416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2660","created_at":"2026-05-18T04:25:25.929416+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NRBXRPKE5EO","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NRBXRPKE5EOD5P7","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NRBXRPK","created_at":"2026-05-18T12:26:04.259169+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/6NRBXRPKE5EOD5P7KJVCD3VVRX","json":"https://pith.science/pith/6NRBXRPKE5EOD5P7KJVCD3VVRX.json","graph_json":"https://pith.science/api/pith-number/6NRBXRPKE5EOD5P7KJVCD3VVRX/graph.json","events_json":"https://pith.science/api/pith-number/6NRBXRPKE5EOD5P7KJVCD3VVRX/events.json","paper":"https://pith.science/paper/6NRBXRPK"},"agent_actions":{"view_html":"https://pith.science/pith/6NRBXRPKE5EOD5P7KJVCD3VVRX","download_json":"https://pith.science/pith/6NRBXRPKE5EOD5P7KJVCD3VVRX.json","view_paper":"https://pith.science/paper/6NRBXRPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.2660&json=true","fetch_graph":"https://pith.science/api/pith-number/6NRBXRPKE5EOD5P7KJVCD3VVRX/graph.json","fetch_events":"https://pith.science/api/pith-number/6NRBXRPKE5EOD5P7KJVCD3VVRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NRBXRPKE5EOD5P7KJVCD3VVRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NRBXRPKE5EOD5P7KJVCD3VVRX/action/storage_attestation","attest_author":"https://pith.science/pith/6NRBXRPKE5EOD5P7KJVCD3VVRX/action/author_attestation","sign_citation":"https://pith.science/pith/6NRBXRPKE5EOD5P7KJVCD3VVRX/action/citation_signature","submit_replication":"https://pith.science/pith/6NRBXRPKE5EOD5P7KJVCD3VVRX/action/replication_record"}},"created_at":"2026-05-18T04:25:25.929416+00:00","updated_at":"2026-05-18T04:25:25.929416+00:00"}