{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JEQL37CQT747UJ6IQ2XXORMO53","short_pith_number":"pith:JEQL37CQ","canonical_record":{"source":{"id":"2606.23726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-19T08:53:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"69b6879a2a8f3b52848d0d75182a6320f5419687197a1cbac2b13c31c7b176a0","abstract_canon_sha256":"4b264825149c047421455446bd1121946526fbf7e5b5375233bce83222ef5062"},"schema_version":"1.0"},"canonical_sha256":"4920bdfc509ff9fa27c886af77458eeedb6e8e9fe7239b36fdee74ee9c38e92d","source":{"kind":"arxiv","id":"2606.23726","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23726","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23726v1","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23726","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_12","alias_value":"JEQL37CQT747","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_16","alias_value":"JEQL37CQT747UJ6I","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_8","alias_value":"JEQL37CQ","created_at":"2026-06-24T00:14:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JEQL37CQT747UJ6IQ2XXORMO53","target":"record","payload":{"canonical_record":{"source":{"id":"2606.23726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-19T08:53:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"69b6879a2a8f3b52848d0d75182a6320f5419687197a1cbac2b13c31c7b176a0","abstract_canon_sha256":"4b264825149c047421455446bd1121946526fbf7e5b5375233bce83222ef5062"},"schema_version":"1.0"},"canonical_sha256":"4920bdfc509ff9fa27c886af77458eeedb6e8e9fe7239b36fdee74ee9c38e92d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:24.348129Z","signature_b64":"kQp9LRGO0rxIDqFBnHuYMUF8suXNTjCr0zq6HTq19bnHeFkObrNZoHFvNZTo9gWGQsVitTBjklN6irFaEhljAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4920bdfc509ff9fa27c886af77458eeedb6e8e9fe7239b36fdee74ee9c38e92d","last_reissued_at":"2026-06-24T00:14:24.347733Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:24.347733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.23726","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-06-24T00:14:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4x0130KItHANoHsU5S76z9xOuIDnGxELX7KrTzH/73St1PuTzs9ywbQDgthRvxRP+F/tsMK2FbHJiADojxHAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:03:45.793823Z"},"content_sha256":"ca8c92261a3d7d1980a70deca244ee6c852dc0baac42c55ad8766ad2c442c45b","schema_version":"1.0","event_id":"sha256:ca8c92261a3d7d1980a70deca244ee6c852dc0baac42c55ad8766ad2c442c45b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JEQL37CQT747UJ6IQ2XXORMO53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ultra-Low-Rate Information Reconciliation: Repetition Coding or Dedicated Codes?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Erdem Eray Cil, Laurent Schmalen","submitted_at":"2026-06-19T08:53:21Z","abstract_excerpt":"We compare repetition-based ultra-low-rate information reconciliation with dedicated ultra-low-rate codes for CV-QKD. Repetition coding offers a favorable performance-complexity trade-off, incurring only a moderate error-rate penalty while reducing decoding complexity by $2\\times$, making it attractive for implementation-constrained systems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23726","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.23726/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-24T00:14:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"esAPW1Y+CCOHbtpmuvJe7qRWgkwp9tMlfk+2LBFNtlK3M7LvSUhEKcGJorAdwCkSfugmSEK9P93gmpbG01l6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:03:45.794189Z"},"content_sha256":"073ee621dd83d999de987a2b22fe2333cd39ee4cd8971286648d1a30f997f5c0","schema_version":"1.0","event_id":"sha256:073ee621dd83d999de987a2b22fe2333cd39ee4cd8971286648d1a30f997f5c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEQL37CQT747UJ6IQ2XXORMO53/bundle.json","state_url":"https://pith.science/pith/JEQL37CQT747UJ6IQ2XXORMO53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEQL37CQT747UJ6IQ2XXORMO53/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-06-30T15:03:45Z","links":{"resolver":"https://pith.science/pith/JEQL37CQT747UJ6IQ2XXORMO53","bundle":"https://pith.science/pith/JEQL37CQT747UJ6IQ2XXORMO53/bundle.json","state":"https://pith.science/pith/JEQL37CQT747UJ6IQ2XXORMO53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEQL37CQT747UJ6IQ2XXORMO53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JEQL37CQT747UJ6IQ2XXORMO53","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":"4b264825149c047421455446bd1121946526fbf7e5b5375233bce83222ef5062","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-19T08:53:21Z","title_canon_sha256":"69b6879a2a8f3b52848d0d75182a6320f5419687197a1cbac2b13c31c7b176a0"},"schema_version":"1.0","source":{"id":"2606.23726","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23726","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23726v1","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23726","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_12","alias_value":"JEQL37CQT747","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_16","alias_value":"JEQL37CQT747UJ6I","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_8","alias_value":"JEQL37CQ","created_at":"2026-06-24T00:14:24Z"}],"graph_snapshots":[{"event_id":"sha256:073ee621dd83d999de987a2b22fe2333cd39ee4cd8971286648d1a30f997f5c0","target":"graph","created_at":"2026-06-24T00:14:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.23726/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We compare repetition-based ultra-low-rate information reconciliation with dedicated ultra-low-rate codes for CV-QKD. Repetition coding offers a favorable performance-complexity trade-off, incurring only a moderate error-rate penalty while reducing decoding complexity by $2\\times$, making it attractive for implementation-constrained systems.","authors_text":"Erdem Eray Cil, Laurent Schmalen","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-19T08:53:21Z","title":"Ultra-Low-Rate Information Reconciliation: Repetition Coding or Dedicated Codes?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23726","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:ca8c92261a3d7d1980a70deca244ee6c852dc0baac42c55ad8766ad2c442c45b","target":"record","created_at":"2026-06-24T00:14:24Z","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":"4b264825149c047421455446bd1121946526fbf7e5b5375233bce83222ef5062","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-19T08:53:21Z","title_canon_sha256":"69b6879a2a8f3b52848d0d75182a6320f5419687197a1cbac2b13c31c7b176a0"},"schema_version":"1.0","source":{"id":"2606.23726","kind":"arxiv","version":1}},"canonical_sha256":"4920bdfc509ff9fa27c886af77458eeedb6e8e9fe7239b36fdee74ee9c38e92d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4920bdfc509ff9fa27c886af77458eeedb6e8e9fe7239b36fdee74ee9c38e92d","first_computed_at":"2026-06-24T00:14:24.347733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T00:14:24.347733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kQp9LRGO0rxIDqFBnHuYMUF8suXNTjCr0zq6HTq19bnHeFkObrNZoHFvNZTo9gWGQsVitTBjklN6irFaEhljAw==","signature_status":"signed_v1","signed_at":"2026-06-24T00:14:24.348129Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.23726","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca8c92261a3d7d1980a70deca244ee6c852dc0baac42c55ad8766ad2c442c45b","sha256:073ee621dd83d999de987a2b22fe2333cd39ee4cd8971286648d1a30f997f5c0"],"state_sha256":"c37149c7790b09998a10acba1f64f00b4bd37eb98d247fbf72f98884d1dfb0be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SFNIKdmYqySEtBi2Ogda09Wea4oQVIJrUeZIsMq6hyQPeM3qQTThWrWaMd94p9wg1Mg13ch6PkK1cJTP/Wq+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T15:03:45.796134Z","bundle_sha256":"880b884948908fb8c3083b39901f98aaa598bd0f5553437f5914f13770f34d5c"}}