{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KL2MLCZYTMTCEKAYBW3AHWMSEP","short_pith_number":"pith:KL2MLCZY","canonical_record":{"source":{"id":"2502.05524","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-08T11:12:26Z","cross_cats_sorted":[],"title_canon_sha256":"4736154486934ad2372163bdef286dedfe38e61119f4266b52c982d9f9e7cb59","abstract_canon_sha256":"ca7302d4e0beae9954b37daf19eb3d9d2691c346387f6d6de214c61af2bfe309"},"schema_version":"1.0"},"canonical_sha256":"52f4c58b389b262228180db603d99223de92e43463de725a5cdedfee1cb3badf","source":{"kind":"arxiv","id":"2502.05524","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05524","created_at":"2026-07-05T10:24:30Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05524v2","created_at":"2026-07-05T10:24:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05524","created_at":"2026-07-05T10:24:30Z"},{"alias_kind":"pith_short_12","alias_value":"KL2MLCZYTMTC","created_at":"2026-07-05T10:24:30Z"},{"alias_kind":"pith_short_16","alias_value":"KL2MLCZYTMTCEKAY","created_at":"2026-07-05T10:24:30Z"},{"alias_kind":"pith_short_8","alias_value":"KL2MLCZY","created_at":"2026-07-05T10:24:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KL2MLCZYTMTCEKAYBW3AHWMSEP","target":"record","payload":{"canonical_record":{"source":{"id":"2502.05524","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-08T11:12:26Z","cross_cats_sorted":[],"title_canon_sha256":"4736154486934ad2372163bdef286dedfe38e61119f4266b52c982d9f9e7cb59","abstract_canon_sha256":"ca7302d4e0beae9954b37daf19eb3d9d2691c346387f6d6de214c61af2bfe309"},"schema_version":"1.0"},"canonical_sha256":"52f4c58b389b262228180db603d99223de92e43463de725a5cdedfee1cb3badf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:24:30.792404Z","signature_b64":"++zc7VoDdjBRFi9+BwLb+detteq4yiEyHfwsJGDHqTMJcG6g8DsdOzoa/doSCRsZsqRNGVDlo45EpY1w9CBKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f4c58b389b262228180db603d99223de92e43463de725a5cdedfee1cb3badf","last_reissued_at":"2026-07-05T10:24:30.791377Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:24:30.791377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.05524","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-07-05T10:24:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6yr/+lsilzO61HXJ2XcwoCBv8CLVDX4smCESUjfc2/LRNZeTB9A99NGm/nzy4pdY5RwFOCYMG8Z7kQ1kz2YcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T14:15:36.329109Z"},"content_sha256":"560ad1443497bb44563145e052f1354082488332047eac65d04bc1a5521e4f80","schema_version":"1.0","event_id":"sha256:560ad1443497bb44563145e052f1354082488332047eac65d04bc1a5521e4f80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KL2MLCZYTMTCEKAYBW3AHWMSEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achievable rates in non-asymptotic bosonic quantum communication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francesco Anna Mele, Giovanni Barbarino, Marco Fanizza, Vittorio Giovannetti","submitted_at":"2025-02-08T11:12:26Z","abstract_excerpt":"Bosonic quantum communication has extensively been analysed in the asymptotic setting, assuming infinite channel uses and vanishing communication errors. Comparatively fewer detailed analyses are available in the non-asymptotic setting, which addresses a more precise, quantitative evaluation of the optimal communication rate: how many uses of a bosonic Gaussian channel are required to transmit $k$ qubits, distil $k$ Bell pairs, or generate $k$ secret-key bits, within a given error tolerance $\\varepsilon$? In this work, we address this question by finding easily computable lower bounds on the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05524","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.05524/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-07-05T10:24:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jYeWvNHlJYWr/NlnnNR8wH++kFuk5Q85ueO99OhRrq0Yxf8dPet1HshcAk5sk0txHjJMzcA/TJN04pjSS8sAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T14:15:36.329493Z"},"content_sha256":"567919c3ae709ee441b74b013a8314576093368c884bad6275e472047a3bc3c9","schema_version":"1.0","event_id":"sha256:567919c3ae709ee441b74b013a8314576093368c884bad6275e472047a3bc3c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KL2MLCZYTMTCEKAYBW3AHWMSEP/bundle.json","state_url":"https://pith.science/pith/KL2MLCZYTMTCEKAYBW3AHWMSEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KL2MLCZYTMTCEKAYBW3AHWMSEP/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-07-10T14:15:36Z","links":{"resolver":"https://pith.science/pith/KL2MLCZYTMTCEKAYBW3AHWMSEP","bundle":"https://pith.science/pith/KL2MLCZYTMTCEKAYBW3AHWMSEP/bundle.json","state":"https://pith.science/pith/KL2MLCZYTMTCEKAYBW3AHWMSEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KL2MLCZYTMTCEKAYBW3AHWMSEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KL2MLCZYTMTCEKAYBW3AHWMSEP","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":"ca7302d4e0beae9954b37daf19eb3d9d2691c346387f6d6de214c61af2bfe309","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-08T11:12:26Z","title_canon_sha256":"4736154486934ad2372163bdef286dedfe38e61119f4266b52c982d9f9e7cb59"},"schema_version":"1.0","source":{"id":"2502.05524","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05524","created_at":"2026-07-05T10:24:30Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05524v2","created_at":"2026-07-05T10:24:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05524","created_at":"2026-07-05T10:24:30Z"},{"alias_kind":"pith_short_12","alias_value":"KL2MLCZYTMTC","created_at":"2026-07-05T10:24:30Z"},{"alias_kind":"pith_short_16","alias_value":"KL2MLCZYTMTCEKAY","created_at":"2026-07-05T10:24:30Z"},{"alias_kind":"pith_short_8","alias_value":"KL2MLCZY","created_at":"2026-07-05T10:24:30Z"}],"graph_snapshots":[{"event_id":"sha256:567919c3ae709ee441b74b013a8314576093368c884bad6275e472047a3bc3c9","target":"graph","created_at":"2026-07-05T10:24:30Z","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/2502.05524/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bosonic quantum communication has extensively been analysed in the asymptotic setting, assuming infinite channel uses and vanishing communication errors. Comparatively fewer detailed analyses are available in the non-asymptotic setting, which addresses a more precise, quantitative evaluation of the optimal communication rate: how many uses of a bosonic Gaussian channel are required to transmit $k$ qubits, distil $k$ Bell pairs, or generate $k$ secret-key bits, within a given error tolerance $\\varepsilon$? In this work, we address this question by finding easily computable lower bounds on the n","authors_text":"Francesco Anna Mele, Giovanni Barbarino, Marco Fanizza, Vittorio Giovannetti","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-08T11:12:26Z","title":"Achievable rates in non-asymptotic bosonic quantum communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05524","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:560ad1443497bb44563145e052f1354082488332047eac65d04bc1a5521e4f80","target":"record","created_at":"2026-07-05T10:24:30Z","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":"ca7302d4e0beae9954b37daf19eb3d9d2691c346387f6d6de214c61af2bfe309","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-08T11:12:26Z","title_canon_sha256":"4736154486934ad2372163bdef286dedfe38e61119f4266b52c982d9f9e7cb59"},"schema_version":"1.0","source":{"id":"2502.05524","kind":"arxiv","version":2}},"canonical_sha256":"52f4c58b389b262228180db603d99223de92e43463de725a5cdedfee1cb3badf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f4c58b389b262228180db603d99223de92e43463de725a5cdedfee1cb3badf","first_computed_at":"2026-07-05T10:24:30.791377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:24:30.791377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"++zc7VoDdjBRFi9+BwLb+detteq4yiEyHfwsJGDHqTMJcG6g8DsdOzoa/doSCRsZsqRNGVDlo45EpY1w9CBKDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:24:30.792404Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.05524","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:560ad1443497bb44563145e052f1354082488332047eac65d04bc1a5521e4f80","sha256:567919c3ae709ee441b74b013a8314576093368c884bad6275e472047a3bc3c9"],"state_sha256":"1da5dc25ebfdcaa5c1a8244aaf0d3edcda47ec7e24d32efcd2215f283b4d1cc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yi6DnMXTpx9vOMTexzXFteBh2ZOUde2U80XYpCzAuMo2Dtu/rhk/7uck6ZLpBWMUW1ggfTOuIpK0pNIzgbCvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T14:15:36.331465Z","bundle_sha256":"f5edee778d5fbbb0806bcc512a9d11a3137849534092737e9ca69c8d021ab640"}}