{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6B4PXMB6OB2DNR6TN5S2E3MNXD","short_pith_number":"pith:6B4PXMB6","canonical_record":{"source":{"id":"2503.13207","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-17T14:19:41Z","cross_cats_sorted":[],"title_canon_sha256":"44aa7f322f346f5325a75369c4111f86ef1a17f543defa00827e233dea2d6627","abstract_canon_sha256":"ab41a9a41c3e4c7e80cfc7b41d84971c753e06518506516615b7accc1dca9d70"},"schema_version":"1.0"},"canonical_sha256":"f078fbb03e707436c7d36f65a26d8db8c9f9bf16ddf228a7a8a861875ed7c2da","source":{"kind":"arxiv","id":"2503.13207","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.13207","created_at":"2026-07-05T10:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"2503.13207v1","created_at":"2026-07-05T10:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13207","created_at":"2026-07-05T10:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"6B4PXMB6OB2D","created_at":"2026-07-05T10:32:55Z"},{"alias_kind":"pith_short_16","alias_value":"6B4PXMB6OB2DNR6T","created_at":"2026-07-05T10:32:55Z"},{"alias_kind":"pith_short_8","alias_value":"6B4PXMB6","created_at":"2026-07-05T10:32:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6B4PXMB6OB2DNR6TN5S2E3MNXD","target":"record","payload":{"canonical_record":{"source":{"id":"2503.13207","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-17T14:19:41Z","cross_cats_sorted":[],"title_canon_sha256":"44aa7f322f346f5325a75369c4111f86ef1a17f543defa00827e233dea2d6627","abstract_canon_sha256":"ab41a9a41c3e4c7e80cfc7b41d84971c753e06518506516615b7accc1dca9d70"},"schema_version":"1.0"},"canonical_sha256":"f078fbb03e707436c7d36f65a26d8db8c9f9bf16ddf228a7a8a861875ed7c2da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:55.939123Z","signature_b64":"ZFY5uR0e2RSgioYPuW08LxDBKSHANm8fd2mrRYuygJlvMFCMFIeUL8hh8aze1h0aQOZoaYDhi/1Y9/4ppsGyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f078fbb03e707436c7d36f65a26d8db8c9f9bf16ddf228a7a8a861875ed7c2da","last_reissued_at":"2026-07-05T10:32:55.937976Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:55.937976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.13207","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-07-05T10:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"blHyf8z4AEcX148wutP3MhXOg+XArc6kyx475LZFY3fx0SyZoGzo4etxtbRmvqTbXi0CUsNE6q0anG89ze/6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T23:52:19.102082Z"},"content_sha256":"eb4726f69855553b904c8b77f4d1e6e18577957b6d18157a7d19c23eca7a4c59","schema_version":"1.0","event_id":"sha256:eb4726f69855553b904c8b77f4d1e6e18577957b6d18157a7d19c23eca7a4c59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6B4PXMB6OB2DNR6TN5S2E3MNXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-asymptotic quantum communication on lossy transmission lines with memory","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-03-17T14:19:41Z","abstract_excerpt":"Non-asymptotic quantum Shannon theory analyses how to transmit quantum information across a quantum channel as efficiently as possible within a specified error tolerance, given access to a finite, fixed, number of channel uses. In a recent work, we derived computable lower bounds on the non-asymptotic capacities of memoryless bosonic Gaussian channels. In this work, we extend these results to the non-Markovian bosonic Gaussian channel introduced in F. A. Mele, G. D. Palma, M. Fanizza, V. Giovannetti, and L. Lami IEEE Transactions on Information Theory 70(12), 8844-8869 (2024), which describes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13207","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/2503.13207/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:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"keR2E6C4jcwVMvQLWNq3cqURw5WCjzJCsgWMEUfDYGuuBb1s8HCzh3OvsD9+Y4GSJg4Q2Yui7gdrN0ROmLhrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T23:52:19.102571Z"},"content_sha256":"85f06810f27616206801779698e2201d88f466e324e16af2768a8be2ca916ca0","schema_version":"1.0","event_id":"sha256:85f06810f27616206801779698e2201d88f466e324e16af2768a8be2ca916ca0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD/bundle.json","state_url":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD/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-31T23:52:19Z","links":{"resolver":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD","bundle":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD/bundle.json","state":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6B4PXMB6OB2DNR6TN5S2E3MNXD","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":"ab41a9a41c3e4c7e80cfc7b41d84971c753e06518506516615b7accc1dca9d70","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-17T14:19:41Z","title_canon_sha256":"44aa7f322f346f5325a75369c4111f86ef1a17f543defa00827e233dea2d6627"},"schema_version":"1.0","source":{"id":"2503.13207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.13207","created_at":"2026-07-05T10:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"2503.13207v1","created_at":"2026-07-05T10:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13207","created_at":"2026-07-05T10:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"6B4PXMB6OB2D","created_at":"2026-07-05T10:32:55Z"},{"alias_kind":"pith_short_16","alias_value":"6B4PXMB6OB2DNR6T","created_at":"2026-07-05T10:32:55Z"},{"alias_kind":"pith_short_8","alias_value":"6B4PXMB6","created_at":"2026-07-05T10:32:55Z"}],"graph_snapshots":[{"event_id":"sha256:85f06810f27616206801779698e2201d88f466e324e16af2768a8be2ca916ca0","target":"graph","created_at":"2026-07-05T10:32:55Z","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/2503.13207/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Non-asymptotic quantum Shannon theory analyses how to transmit quantum information across a quantum channel as efficiently as possible within a specified error tolerance, given access to a finite, fixed, number of channel uses. In a recent work, we derived computable lower bounds on the non-asymptotic capacities of memoryless bosonic Gaussian channels. In this work, we extend these results to the non-Markovian bosonic Gaussian channel introduced in F. A. Mele, G. D. Palma, M. Fanizza, V. Giovannetti, and L. Lami IEEE Transactions on Information Theory 70(12), 8844-8869 (2024), which describes ","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-03-17T14:19:41Z","title":"Non-asymptotic quantum communication on lossy transmission lines with memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13207","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:eb4726f69855553b904c8b77f4d1e6e18577957b6d18157a7d19c23eca7a4c59","target":"record","created_at":"2026-07-05T10:32:55Z","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":"ab41a9a41c3e4c7e80cfc7b41d84971c753e06518506516615b7accc1dca9d70","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-17T14:19:41Z","title_canon_sha256":"44aa7f322f346f5325a75369c4111f86ef1a17f543defa00827e233dea2d6627"},"schema_version":"1.0","source":{"id":"2503.13207","kind":"arxiv","version":1}},"canonical_sha256":"f078fbb03e707436c7d36f65a26d8db8c9f9bf16ddf228a7a8a861875ed7c2da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f078fbb03e707436c7d36f65a26d8db8c9f9bf16ddf228a7a8a861875ed7c2da","first_computed_at":"2026-07-05T10:32:55.937976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:32:55.937976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZFY5uR0e2RSgioYPuW08LxDBKSHANm8fd2mrRYuygJlvMFCMFIeUL8hh8aze1h0aQOZoaYDhi/1Y9/4ppsGyDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:32:55.939123Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.13207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb4726f69855553b904c8b77f4d1e6e18577957b6d18157a7d19c23eca7a4c59","sha256:85f06810f27616206801779698e2201d88f466e324e16af2768a8be2ca916ca0"],"state_sha256":"93ff5b5c17ea0cb848a28aa6fba1acc928af85e9ef0fd7b27d50684707942220"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CC8SRcVumUGPgfWxK9RiyzkYeVTgEvPpCVPVQ5BAB2bWhCMpCEoFGitYGVKI05N9ELLPSdNwbwc0fSr0v9wwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T23:52:19.106960Z","bundle_sha256":"53a39aa4f95bd5a7e79f287468df2084e0ba81bab16550434c70e75cb067a45b"}}