{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EBE2FCL3W65XMKMRGKZ4MH5NI6","short_pith_number":"pith:EBE2FCL3","schema_version":"1.0","canonical_sha256":"2049a2897bb7bb76299132b3c61fad47a6d424ac99b91f964015175fa693c688","source":{"kind":"arxiv","id":"1709.05258","version":3},"attestation_state":"computed","paper":{"title":"On converse bounds for classical communication over quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Kun Fang, Marco Tomamichel, Xin Wang","submitted_at":"2017-09-15T15:12:44Z","abstract_excerpt":"We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical communication can be achieved by activated, no-signalling assisted codes, suitably generalizing a result for classical channels. Second, we derive a new efficiently computable meta-converse on the amount of classical information unassisted codes can transmit over a single use of a quantum channel. As applications, we provide a finite resource analysis of classical com"},"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.05258","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-15T15:12:44Z","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"title_canon_sha256":"35c57cfe0bb8dbe1d8d31ce545fffd1897e6d3cce4951ad8400de21a193828af","abstract_canon_sha256":"1fdefebb004288c05797769ebb5977aaa5ce02470b88ee1e3215dd88ff073436"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:34.267714Z","signature_b64":"ZCZxZodA2fBPQGmlLgJXasWGZTJRBlQiaJHmeicU9qP21ZX1GAsAatXThdXTZs66+GbHDwS8KtY2TEVhaiKSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2049a2897bb7bb76299132b3c61fad47a6d424ac99b91f964015175fa693c688","last_reissued_at":"2026-07-04T23:51:34.267356Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:34.267356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On converse bounds for classical communication over quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Kun Fang, Marco Tomamichel, Xin Wang","submitted_at":"2017-09-15T15:12:44Z","abstract_excerpt":"We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical communication can be achieved by activated, no-signalling assisted codes, suitably generalizing a result for classical channels. Second, we derive a new efficiently computable meta-converse on the amount of classical information unassisted codes can transmit over a single use of a quantum channel. As applications, we provide a finite resource analysis of classical com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05258","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.05258/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.05258","created_at":"2026-07-04T23:51:34.267419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05258v3","created_at":"2026-07-04T23:51:34.267419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05258","created_at":"2026-07-04T23:51:34.267419+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBE2FCL3W65X","created_at":"2026-07-04T23:51:34.267419+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBE2FCL3W65XMKMR","created_at":"2026-07-04T23:51:34.267419+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBE2FCL3","created_at":"2026-07-04T23:51:34.267419+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11576","citing_title":"Riemannian Optimization for Holevo Capacity","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EBE2FCL3W65XMKMRGKZ4MH5NI6","json":"https://pith.science/pith/EBE2FCL3W65XMKMRGKZ4MH5NI6.json","graph_json":"https://pith.science/api/pith-number/EBE2FCL3W65XMKMRGKZ4MH5NI6/graph.json","events_json":"https://pith.science/api/pith-number/EBE2FCL3W65XMKMRGKZ4MH5NI6/events.json","paper":"https://pith.science/paper/EBE2FCL3"},"agent_actions":{"view_html":"https://pith.science/pith/EBE2FCL3W65XMKMRGKZ4MH5NI6","download_json":"https://pith.science/pith/EBE2FCL3W65XMKMRGKZ4MH5NI6.json","view_paper":"https://pith.science/paper/EBE2FCL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05258&json=true","fetch_graph":"https://pith.science/api/pith-number/EBE2FCL3W65XMKMRGKZ4MH5NI6/graph.json","fetch_events":"https://pith.science/api/pith-number/EBE2FCL3W65XMKMRGKZ4MH5NI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBE2FCL3W65XMKMRGKZ4MH5NI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBE2FCL3W65XMKMRGKZ4MH5NI6/action/storage_attestation","attest_author":"https://pith.science/pith/EBE2FCL3W65XMKMRGKZ4MH5NI6/action/author_attestation","sign_citation":"https://pith.science/pith/EBE2FCL3W65XMKMRGKZ4MH5NI6/action/citation_signature","submit_replication":"https://pith.science/pith/EBE2FCL3W65XMKMRGKZ4MH5NI6/action/replication_record"}},"created_at":"2026-07-04T23:51:34.267419+00:00","updated_at":"2026-07-04T23:51:34.267419+00:00"}