{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FFT7ZJG332LL6GDTEWQADI4JQN","short_pith_number":"pith:FFT7ZJG3","schema_version":"1.0","canonical_sha256":"2967fca4dbde96bf187325a001a3898351079665443b730a7d93bbf3e14cf99c","source":{"kind":"arxiv","id":"1708.07257","version":3},"attestation_state":"computed","paper":{"title":"Bounding the energy-constrained quantum and private capacities of phase-insensitive bosonic Gaussian channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Kunal Sharma, Mark M. Wilde, Masahiro Takeoka, Sushovit Adhikari","submitted_at":"2017-08-24T02:46:39Z","abstract_excerpt":"We establish several upper bounds on the energy-constrained quantum and private capacities of all single-mode phase-insensitive bosonic Gaussian channels. The first upper bound, which we call the \"data-processing bound,\" is the simplest and is obtained by decomposing a phase-insensitive channel as a pure-loss channel followed by a quantum-limited amplifier channel. We prove that the data-processing bound can be at most 1.45 bits larger than a known lower bound on these capacities of the phase-insensitive Gaussian channel. We discuss another data-processing upper bound as well. Two other upper "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1708.07257","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-24T02:46:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1cd9f18f392dee3a2d722a711629cc4e82246e3fe6e77d19debfff0f9902d4f4","abstract_canon_sha256":"16633c5c7d646d2d5e3f0127b4d2e1aa4d534eb19a98ac7cc5ba0f1ffb7db1c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:11.012577Z","signature_b64":"qoFZJbvmlnj93m0zrr96nkMVbKCrLBt5RvX6sxjBPAZZchMVIojHMLlfjNE+4Su3oce7Z6Yf59+VFBKnB0D9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2967fca4dbde96bf187325a001a3898351079665443b730a7d93bbf3e14cf99c","last_reissued_at":"2026-05-18T00:13:11.011822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:11.011822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding the energy-constrained quantum and private capacities of phase-insensitive bosonic Gaussian channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Kunal Sharma, Mark M. Wilde, Masahiro Takeoka, Sushovit Adhikari","submitted_at":"2017-08-24T02:46:39Z","abstract_excerpt":"We establish several upper bounds on the energy-constrained quantum and private capacities of all single-mode phase-insensitive bosonic Gaussian channels. The first upper bound, which we call the \"data-processing bound,\" is the simplest and is obtained by decomposing a phase-insensitive channel as a pure-loss channel followed by a quantum-limited amplifier channel. We prove that the data-processing bound can be at most 1.45 bits larger than a known lower bound on these capacities of the phase-insensitive Gaussian channel. We discuss another data-processing upper bound as well. Two other upper "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07257","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.07257","created_at":"2026-05-18T00:13:11.011956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07257v3","created_at":"2026-05-18T00:13:11.011956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07257","created_at":"2026-05-18T00:13:11.011956+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFT7ZJG332LL","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFT7ZJG332LL6GDT","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFT7ZJG3","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FFT7ZJG332LL6GDTEWQADI4JQN","json":"https://pith.science/pith/FFT7ZJG332LL6GDTEWQADI4JQN.json","graph_json":"https://pith.science/api/pith-number/FFT7ZJG332LL6GDTEWQADI4JQN/graph.json","events_json":"https://pith.science/api/pith-number/FFT7ZJG332LL6GDTEWQADI4JQN/events.json","paper":"https://pith.science/paper/FFT7ZJG3"},"agent_actions":{"view_html":"https://pith.science/pith/FFT7ZJG332LL6GDTEWQADI4JQN","download_json":"https://pith.science/pith/FFT7ZJG332LL6GDTEWQADI4JQN.json","view_paper":"https://pith.science/paper/FFT7ZJG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07257&json=true","fetch_graph":"https://pith.science/api/pith-number/FFT7ZJG332LL6GDTEWQADI4JQN/graph.json","fetch_events":"https://pith.science/api/pith-number/FFT7ZJG332LL6GDTEWQADI4JQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFT7ZJG332LL6GDTEWQADI4JQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFT7ZJG332LL6GDTEWQADI4JQN/action/storage_attestation","attest_author":"https://pith.science/pith/FFT7ZJG332LL6GDTEWQADI4JQN/action/author_attestation","sign_citation":"https://pith.science/pith/FFT7ZJG332LL6GDTEWQADI4JQN/action/citation_signature","submit_replication":"https://pith.science/pith/FFT7ZJG332LL6GDTEWQADI4JQN/action/replication_record"}},"created_at":"2026-05-18T00:13:11.011956+00:00","updated_at":"2026-05-18T00:13:11.011956+00:00"}