{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AEDJS3TED4WX6NBYUGZZHWLNQW","short_pith_number":"pith:AEDJS3TE","schema_version":"1.0","canonical_sha256":"0106996e641f2d7f3438a1b393d96d85bff24d69955ccbd8267b771650f13f6a","source":{"kind":"arxiv","id":"1705.06664","version":3},"attestation_state":"computed","paper":{"title":"Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A.K. Fedorov, A.S. Trushechkin, E.O. Kiktenko","submitted_at":"2017-05-18T15:59:14Z","abstract_excerpt":"We consider an information reconciliation protocol for quantum key distribution (QKD). In order to correct down the error rate, we suggest a method, which is based on symmetric blind information reconciliation for the low-density parity-check (LDPC) codes. We develop a subsequent verification protocol with the use of $\\epsilon$-universal hash functions, which allows verifying the identity between the keys with a certain probability."},"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":"1705.06664","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-18T15:59:14Z","cross_cats_sorted":[],"title_canon_sha256":"bf0a46dfe44443657fb44b1e4bec65abccfafdeffb82a1abc739785e50678c92","abstract_canon_sha256":"808be4bf991bdef432970a6e61a3ae3e8944867fc651a43a135ce13d2bb87ed8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:05.711095Z","signature_b64":"FJZew5f7ZpZoLD0mPcYN0n1laTytiy1FNnIw5dWfDNuY6NMjRce/201n8yuBAbmcZ4+E/uWazLrnb19FqdePCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0106996e641f2d7f3438a1b393d96d85bff24d69955ccbd8267b771650f13f6a","last_reissued_at":"2026-05-18T00:05:05.710478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:05.710478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A.K. Fedorov, A.S. Trushechkin, E.O. Kiktenko","submitted_at":"2017-05-18T15:59:14Z","abstract_excerpt":"We consider an information reconciliation protocol for quantum key distribution (QKD). In order to correct down the error rate, we suggest a method, which is based on symmetric blind information reconciliation for the low-density parity-check (LDPC) codes. We develop a subsequent verification protocol with the use of $\\epsilon$-universal hash functions, which allows verifying the identity between the keys with a certain probability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06664","kind":"arxiv","version":3},"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":"1705.06664","created_at":"2026-05-18T00:05:05.710585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06664v3","created_at":"2026-05-18T00:05:05.710585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06664","created_at":"2026-05-18T00:05:05.710585+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEDJS3TED4WX","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEDJS3TED4WX6NBY","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEDJS3TE","created_at":"2026-05-18T12:31:05.417338+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/AEDJS3TED4WX6NBYUGZZHWLNQW","json":"https://pith.science/pith/AEDJS3TED4WX6NBYUGZZHWLNQW.json","graph_json":"https://pith.science/api/pith-number/AEDJS3TED4WX6NBYUGZZHWLNQW/graph.json","events_json":"https://pith.science/api/pith-number/AEDJS3TED4WX6NBYUGZZHWLNQW/events.json","paper":"https://pith.science/paper/AEDJS3TE"},"agent_actions":{"view_html":"https://pith.science/pith/AEDJS3TED4WX6NBYUGZZHWLNQW","download_json":"https://pith.science/pith/AEDJS3TED4WX6NBYUGZZHWLNQW.json","view_paper":"https://pith.science/paper/AEDJS3TE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06664&json=true","fetch_graph":"https://pith.science/api/pith-number/AEDJS3TED4WX6NBYUGZZHWLNQW/graph.json","fetch_events":"https://pith.science/api/pith-number/AEDJS3TED4WX6NBYUGZZHWLNQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEDJS3TED4WX6NBYUGZZHWLNQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEDJS3TED4WX6NBYUGZZHWLNQW/action/storage_attestation","attest_author":"https://pith.science/pith/AEDJS3TED4WX6NBYUGZZHWLNQW/action/author_attestation","sign_citation":"https://pith.science/pith/AEDJS3TED4WX6NBYUGZZHWLNQW/action/citation_signature","submit_replication":"https://pith.science/pith/AEDJS3TED4WX6NBYUGZZHWLNQW/action/replication_record"}},"created_at":"2026-05-18T00:05:05.710585+00:00","updated_at":"2026-05-18T00:05:05.710585+00:00"}