{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FVYXULSIKRDNBTXVJJYCK7GZSF","short_pith_number":"pith:FVYXULSI","canonical_record":{"source":{"id":"1610.02823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-10T09:36:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e5b67d4393aa147e42578c9584a5895a6e49b24398634fd82bc8b2a7095feeea","abstract_canon_sha256":"bed28f32bfd747b463e5b3ffe70abf315b8ffe9ebf9a2a6c01abf1b367837acb"},"schema_version":"1.0"},"canonical_sha256":"2d717a2e485446d0cef54a70257cd9914a4826a54231f37ebafaa618b18306bb","source":{"kind":"arxiv","id":"1610.02823","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02823","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02823v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02823","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"FVYXULSIKRDN","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVYXULSIKRDNBTXV","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVYXULSI","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FVYXULSIKRDNBTXVJJYCK7GZSF","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-10T09:36:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e5b67d4393aa147e42578c9584a5895a6e49b24398634fd82bc8b2a7095feeea","abstract_canon_sha256":"bed28f32bfd747b463e5b3ffe70abf315b8ffe9ebf9a2a6c01abf1b367837acb"},"schema_version":"1.0"},"canonical_sha256":"2d717a2e485446d0cef54a70257cd9914a4826a54231f37ebafaa618b18306bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:50.617532Z","signature_b64":"Rx+bPtLsBO3Lo/0TlzQo+edN4vAYfrdu42GJMaPgyFpFDO4SA0nBWqD36LjCa62CdZOYbI7B5jfX2om4+nSNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d717a2e485446d0cef54a70257cd9914a4826a54231f37ebafaa618b18306bb","last_reissued_at":"2026-05-18T01:02:50.617094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:50.617094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02823","source_version":1,"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-18T01:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XuquOnCRMUgUTnOVit9A+ylrQfqMZjLx3mZgTlR9Z7NWKIWA0vX2O3/KbhBP4Uejp6q+NucJqt1IGMe41TzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:34:33.781004Z"},"content_sha256":"11fe1bb6bd1dda01105ee43add0af4aa727535fc79b78ede422171e8771a319f","schema_version":"1.0","event_id":"sha256:11fe1bb6bd1dda01105ee43add0af4aa727535fc79b78ede422171e8771a319f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FVYXULSIKRDNBTXVJJYCK7GZSF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Secret Key Rate Adapting with Error Minimization for Continuous-Variable 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":"Laszlo Gyongyosi","submitted_at":"2016-10-10T09:36:35Z","abstract_excerpt":"We define an iterative error-minimizing secret key adapting method for multicarrier CVQKD. A multicarrier CVQKD protocol uses Gaussian subcarrier quantum continuous variables (CVs) for the transmission. The proposed method allows for the parties to reach a given target secret key rate with minimized error rate through the Gaussian sub-channels by a sub-channel adaption procedure. The adaption algorithm iteratively determines the optimal transmit conditions to achieve the target secret key rate and the minimal error rate over the sub-channels. The solution requires no complex calculations or co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02823","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"},"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-18T01:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MoTLmgCFqRXiETUFcR0RJCjvLWYrruuku5rmwSuVIJHORLvExf9IY02BlQ6mTCQkNWLBUsZzPBcfZ0NMM9EwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:34:33.781678Z"},"content_sha256":"c96bc2486fe9fab0e52562486b87b82373e8e140b591003f9f92f31e31b17c7d","schema_version":"1.0","event_id":"sha256:c96bc2486fe9fab0e52562486b87b82373e8e140b591003f9f92f31e31b17c7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVYXULSIKRDNBTXVJJYCK7GZSF/bundle.json","state_url":"https://pith.science/pith/FVYXULSIKRDNBTXVJJYCK7GZSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVYXULSIKRDNBTXVJJYCK7GZSF/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-27T09:34:33Z","links":{"resolver":"https://pith.science/pith/FVYXULSIKRDNBTXVJJYCK7GZSF","bundle":"https://pith.science/pith/FVYXULSIKRDNBTXVJJYCK7GZSF/bundle.json","state":"https://pith.science/pith/FVYXULSIKRDNBTXVJJYCK7GZSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVYXULSIKRDNBTXVJJYCK7GZSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FVYXULSIKRDNBTXVJJYCK7GZSF","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":"bed28f32bfd747b463e5b3ffe70abf315b8ffe9ebf9a2a6c01abf1b367837acb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-10T09:36:35Z","title_canon_sha256":"e5b67d4393aa147e42578c9584a5895a6e49b24398634fd82bc8b2a7095feeea"},"schema_version":"1.0","source":{"id":"1610.02823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02823","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02823v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02823","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"FVYXULSIKRDN","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVYXULSIKRDNBTXV","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVYXULSI","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:c96bc2486fe9fab0e52562486b87b82373e8e140b591003f9f92f31e31b17c7d","target":"graph","created_at":"2026-05-18T01:02:50Z","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":"We define an iterative error-minimizing secret key adapting method for multicarrier CVQKD. A multicarrier CVQKD protocol uses Gaussian subcarrier quantum continuous variables (CVs) for the transmission. The proposed method allows for the parties to reach a given target secret key rate with minimized error rate through the Gaussian sub-channels by a sub-channel adaption procedure. The adaption algorithm iteratively determines the optimal transmit conditions to achieve the target secret key rate and the minimal error rate over the sub-channels. The solution requires no complex calculations or co","authors_text":"Laszlo Gyongyosi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-10T09:36:35Z","title":"Iterative Secret Key Rate Adapting with Error Minimization for Continuous-Variable Quantum Key Distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02823","kind":"arxiv","version":1},"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:11fe1bb6bd1dda01105ee43add0af4aa727535fc79b78ede422171e8771a319f","target":"record","created_at":"2026-05-18T01:02:50Z","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":"bed28f32bfd747b463e5b3ffe70abf315b8ffe9ebf9a2a6c01abf1b367837acb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-10T09:36:35Z","title_canon_sha256":"e5b67d4393aa147e42578c9584a5895a6e49b24398634fd82bc8b2a7095feeea"},"schema_version":"1.0","source":{"id":"1610.02823","kind":"arxiv","version":1}},"canonical_sha256":"2d717a2e485446d0cef54a70257cd9914a4826a54231f37ebafaa618b18306bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d717a2e485446d0cef54a70257cd9914a4826a54231f37ebafaa618b18306bb","first_computed_at":"2026-05-18T01:02:50.617094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:50.617094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rx+bPtLsBO3Lo/0TlzQo+edN4vAYfrdu42GJMaPgyFpFDO4SA0nBWqD36LjCa62CdZOYbI7B5jfX2om4+nSNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:50.617532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11fe1bb6bd1dda01105ee43add0af4aa727535fc79b78ede422171e8771a319f","sha256:c96bc2486fe9fab0e52562486b87b82373e8e140b591003f9f92f31e31b17c7d"],"state_sha256":"a42175decc2231ade8cef39c80870534193bb1283ebd1765628b5a6c1e38e3a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FeVQRwclKektm3iFZ9bpu6obk7m35Yar87dZtXXAb1e7KHctAThWmfKIz+7JS0GuXyFjyj0c/ItmMS1LQ3WIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:34:33.785303Z","bundle_sha256":"915f73fc876b351282347a5b41c2e687e8093b8cad7789b8eb325f914b5f31c8"}}