{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LBVBEDHBK5U7L5HCGJOINNXUFE","short_pith_number":"pith:LBVBEDHB","canonical_record":{"source":{"id":"1810.05841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-13T10:42:57Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"36c7e19813061f8d140962099f203919cbbef85bae8b4861fea99044685e3094","abstract_canon_sha256":"1e1330fe7799264b5de8a76a6aed18edf7a9fcad7e4e73ab6e264faeedfbde12"},"schema_version":"1.0"},"canonical_sha256":"586a120ce15769f5f4e2325c86b6f4290b5ab5c13539472801c043327030f3bd","source":{"kind":"arxiv","id":"1810.05841","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05841","created_at":"2026-05-17T23:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05841v2","created_at":"2026-05-17T23:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05841","created_at":"2026-05-17T23:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"LBVBEDHBK5U7","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"LBVBEDHBK5U7L5HC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"LBVBEDHB","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LBVBEDHBK5U7L5HCGJOINNXUFE","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-13T10:42:57Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"36c7e19813061f8d140962099f203919cbbef85bae8b4861fea99044685e3094","abstract_canon_sha256":"1e1330fe7799264b5de8a76a6aed18edf7a9fcad7e4e73ab6e264faeedfbde12"},"schema_version":"1.0"},"canonical_sha256":"586a120ce15769f5f4e2325c86b6f4290b5ab5c13539472801c043327030f3bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:13.568433Z","signature_b64":"ZIJ0Nnqx7LsltFz/+yMWqZth0En3T+GxNeMQXeH3qdKVRFRarpL38NQwcwa7KRcSfc+7rjpxeOtwsmjNLmH+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"586a120ce15769f5f4e2325c86b6f4290b5ab5c13539472801c043327030f3bd","last_reissued_at":"2026-05-17T23:58:13.567902Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:13.567902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05841","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:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LxhnIkcjPDFN1L/ra8XdIKpMP+AAZt+tmyRURnNFtxyYma2o2wEs1sImhg/YTe/APNK5MjEKitFTbMnBKQlSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:17:20.749086Z"},"content_sha256":"3bf0ad88575db8d5bb9eeeb0d08dad58c23706775430886a29b5a8b31ae628dc","schema_version":"1.0","event_id":"sha256:3bf0ad88575db8d5bb9eeeb0d08dad58c23706775430886a29b5a8b31ae628dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LBVBEDHBK5U7L5HCGJOINNXUFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error estimation at the information reconciliation stage of quantum key distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"A.A. Bozhedarov, A.K. Fedorov, A.O. Malyshev, E.O. Kiktenko, M.N. Anufriev, N.O. Pozhar","submitted_at":"2018-10-13T10:42:57Z","abstract_excerpt":"Quantum key distribution (QKD) offers a practical solution for secure communication between two distinct parties via a quantum channel and an authentic public channel. In this work, we consider different approaches to the quantum bit error rate (QBER) estimation at the information reconciliation stage of the post-processing procedure. For reconciliation schemes employing low-density parity-check (LDPC) codes, we develop a novel syndrome-based QBER estimation algorithm. The algorithm suggested is suitable for irregular LDPC codes and takes into account punctured and shortened bits. Testing our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05841","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:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXm7VoXpe/E1WQCq2WGiOEeaXoWYP/U2yHdxrbDEKVaaDFKRZX6NQy6p/Jj9rvsBafUG87Q33ibR9DKE6yblAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:17:20.749699Z"},"content_sha256":"8832833a41a51b0e09aaa13ce52671c7420ff2187d985abe4ebcac1e547a60f3","schema_version":"1.0","event_id":"sha256:8832833a41a51b0e09aaa13ce52671c7420ff2187d985abe4ebcac1e547a60f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBVBEDHBK5U7L5HCGJOINNXUFE/bundle.json","state_url":"https://pith.science/pith/LBVBEDHBK5U7L5HCGJOINNXUFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBVBEDHBK5U7L5HCGJOINNXUFE/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-05-25T22:17:20Z","links":{"resolver":"https://pith.science/pith/LBVBEDHBK5U7L5HCGJOINNXUFE","bundle":"https://pith.science/pith/LBVBEDHBK5U7L5HCGJOINNXUFE/bundle.json","state":"https://pith.science/pith/LBVBEDHBK5U7L5HCGJOINNXUFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBVBEDHBK5U7L5HCGJOINNXUFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LBVBEDHBK5U7L5HCGJOINNXUFE","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":"1e1330fe7799264b5de8a76a6aed18edf7a9fcad7e4e73ab6e264faeedfbde12","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-13T10:42:57Z","title_canon_sha256":"36c7e19813061f8d140962099f203919cbbef85bae8b4861fea99044685e3094"},"schema_version":"1.0","source":{"id":"1810.05841","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05841","created_at":"2026-05-17T23:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05841v2","created_at":"2026-05-17T23:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05841","created_at":"2026-05-17T23:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"LBVBEDHBK5U7","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"LBVBEDHBK5U7L5HC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"LBVBEDHB","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:8832833a41a51b0e09aaa13ce52671c7420ff2187d985abe4ebcac1e547a60f3","target":"graph","created_at":"2026-05-17T23:58:13Z","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":"Quantum key distribution (QKD) offers a practical solution for secure communication between two distinct parties via a quantum channel and an authentic public channel. In this work, we consider different approaches to the quantum bit error rate (QBER) estimation at the information reconciliation stage of the post-processing procedure. For reconciliation schemes employing low-density parity-check (LDPC) codes, we develop a novel syndrome-based QBER estimation algorithm. The algorithm suggested is suitable for irregular LDPC codes and takes into account punctured and shortened bits. Testing our ","authors_text":"A.A. Bozhedarov, A.K. Fedorov, A.O. Malyshev, E.O. Kiktenko, M.N. Anufriev, N.O. Pozhar","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-13T10:42:57Z","title":"Error estimation at the information reconciliation stage of quantum key distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05841","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:3bf0ad88575db8d5bb9eeeb0d08dad58c23706775430886a29b5a8b31ae628dc","target":"record","created_at":"2026-05-17T23:58:13Z","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":"1e1330fe7799264b5de8a76a6aed18edf7a9fcad7e4e73ab6e264faeedfbde12","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-13T10:42:57Z","title_canon_sha256":"36c7e19813061f8d140962099f203919cbbef85bae8b4861fea99044685e3094"},"schema_version":"1.0","source":{"id":"1810.05841","kind":"arxiv","version":2}},"canonical_sha256":"586a120ce15769f5f4e2325c86b6f4290b5ab5c13539472801c043327030f3bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"586a120ce15769f5f4e2325c86b6f4290b5ab5c13539472801c043327030f3bd","first_computed_at":"2026-05-17T23:58:13.567902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:13.567902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZIJ0Nnqx7LsltFz/+yMWqZth0En3T+GxNeMQXeH3qdKVRFRarpL38NQwcwa7KRcSfc+7rjpxeOtwsmjNLmH+CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:13.568433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05841","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bf0ad88575db8d5bb9eeeb0d08dad58c23706775430886a29b5a8b31ae628dc","sha256:8832833a41a51b0e09aaa13ce52671c7420ff2187d985abe4ebcac1e547a60f3"],"state_sha256":"4256c5ae0aa9085bd66b4e3bfa15a2831f5c92220d0606706508b9ad0eb13afc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMfjiZMuaE6TcDBHVa8deqhfGTAcf4ufV+r+7lv8dD/JIEVzHrJXdvxRe7c86f+STGy0GDr2VXVj00JjvcuBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:17:20.753822Z","bundle_sha256":"accf91fbeec67e4ebc38acb9f69d9bf412c588cbf010bfbf0a75c49af8a3479c"}}