{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S4W6OGECCXWLZ46NL45JSIVENW","short_pith_number":"pith:S4W6OGEC","schema_version":"1.0","canonical_sha256":"972de7188215ecbcf3cd5f3a9922a46dab57d166df72abd8cea4cdfc1f93317a","source":{"kind":"arxiv","id":"1709.01111","version":3},"attestation_state":"computed","paper":{"title":"Approaches for approximate additivity of the Holevo information of quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eneet Kaur, Felix Leditzky, Mark M. Wilde, Nilanjana Datta","submitted_at":"2017-09-04T18:41:55Z","abstract_excerpt":"We study quantum channels that are close to another channel with weakly additive Holevo information and derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking channels, unital qubit channels, and Hadamard channels. Related to the method of approximate degradability, we define approximation parameters for each class above that measure how close an arbitrary channel is to satisfying the respective property. This gives us upper bounds on the classical capacity in terms of functions of the approximation parameters, as"},"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":"1709.01111","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-04T18:41:55Z","cross_cats_sorted":[],"title_canon_sha256":"41d0fc44fa476f82a9201da4fbe58b91424d6c0e3c886dfea0521a3f062482fe","abstract_canon_sha256":"2646059d64ffbd64bfadc0dd2283a9ff308906609ee815a797b30d255cd62003"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:28:57.775829Z","signature_b64":"6FVI0JmpbwQZNYM5+LhBYxP9OcP7Z1tHY/tYcAXDrpTtNi78X8Z6P1OTs9IHXJixkB7IcNM+CKVw6Q5kz5DEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"972de7188215ecbcf3cd5f3a9922a46dab57d166df72abd8cea4cdfc1f93317a","last_reissued_at":"2026-07-05T01:28:57.775251Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:28:57.775251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approaches for approximate additivity of the Holevo information of quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eneet Kaur, Felix Leditzky, Mark M. Wilde, Nilanjana Datta","submitted_at":"2017-09-04T18:41:55Z","abstract_excerpt":"We study quantum channels that are close to another channel with weakly additive Holevo information and derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking channels, unital qubit channels, and Hadamard channels. Related to the method of approximate degradability, we define approximation parameters for each class above that measure how close an arbitrary channel is to satisfying the respective property. This gives us upper bounds on the classical capacity in terms of functions of the approximation parameters, as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01111","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1709.01111/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.01111","created_at":"2026-07-05T01:28:57.775321+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01111v3","created_at":"2026-07-05T01:28:57.775321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01111","created_at":"2026-07-05T01:28:57.775321+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4W6OGECCXWL","created_at":"2026-07-05T01:28:57.775321+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4W6OGECCXWLZ46N","created_at":"2026-07-05T01:28:57.775321+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4W6OGEC","created_at":"2026-07-05T01:28:57.775321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.03994","citing_title":"Maximum channel entropy principle and microcanonical channels","ref_index":94,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S4W6OGECCXWLZ46NL45JSIVENW","json":"https://pith.science/pith/S4W6OGECCXWLZ46NL45JSIVENW.json","graph_json":"https://pith.science/api/pith-number/S4W6OGECCXWLZ46NL45JSIVENW/graph.json","events_json":"https://pith.science/api/pith-number/S4W6OGECCXWLZ46NL45JSIVENW/events.json","paper":"https://pith.science/paper/S4W6OGEC"},"agent_actions":{"view_html":"https://pith.science/pith/S4W6OGECCXWLZ46NL45JSIVENW","download_json":"https://pith.science/pith/S4W6OGECCXWLZ46NL45JSIVENW.json","view_paper":"https://pith.science/paper/S4W6OGEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01111&json=true","fetch_graph":"https://pith.science/api/pith-number/S4W6OGECCXWLZ46NL45JSIVENW/graph.json","fetch_events":"https://pith.science/api/pith-number/S4W6OGECCXWLZ46NL45JSIVENW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4W6OGECCXWLZ46NL45JSIVENW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4W6OGECCXWLZ46NL45JSIVENW/action/storage_attestation","attest_author":"https://pith.science/pith/S4W6OGECCXWLZ46NL45JSIVENW/action/author_attestation","sign_citation":"https://pith.science/pith/S4W6OGECCXWLZ46NL45JSIVENW/action/citation_signature","submit_replication":"https://pith.science/pith/S4W6OGECCXWLZ46NL45JSIVENW/action/replication_record"}},"created_at":"2026-07-05T01:28:57.775321+00:00","updated_at":"2026-07-05T01:28:57.775321+00:00"}