{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GKVRN6MW2Y3X342JVNTVWHJDFC","short_pith_number":"pith:GKVRN6MW","schema_version":"1.0","canonical_sha256":"32ab16f996d6377df349ab675b1d2328898eeff5cdfca3ee777c4dbf74489619","source":{"kind":"arxiv","id":"1210.4722","version":2},"attestation_state":"computed","paper":{"title":"Finite blocklength converse bounds for quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Stephanie Wehner, William Matthews","submitted_at":"2012-10-17T12:47:30Z","abstract_excerpt":"We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalise both a classical converse of Polyanskiy, Poor, and Verd\\'{u} as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular our bound on entangle"},"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":"1210.4722","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-17T12:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"194348d011913410c8e35e29affb8630cf32983fe6491705ff1071a958fc145e","abstract_canon_sha256":"abe92436be2f9e53a1bda453fedb2e62e9203763edf8c384fb5d76453eb13438"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:33.860600Z","signature_b64":"XuXvcqC7wK+6AD64rpAYEA+roqxeo6Np1lwknTEtlbXikDSXDwWnU0rF/Nu97rjYk+WVAL23e73/1xpxh763Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32ab16f996d6377df349ab675b1d2328898eeff5cdfca3ee777c4dbf74489619","last_reissued_at":"2026-05-18T01:23:33.859883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:33.859883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite blocklength converse bounds for quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Stephanie Wehner, William Matthews","submitted_at":"2012-10-17T12:47:30Z","abstract_excerpt":"We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalise both a classical converse of Polyanskiy, Poor, and Verd\\'{u} as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular our bound on entangle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4722","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":""},"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":"1210.4722","created_at":"2026-05-18T01:23:33.859979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4722v2","created_at":"2026-05-18T01:23:33.859979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4722","created_at":"2026-05-18T01:23:33.859979+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKVRN6MW2Y3X","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKVRN6MW2Y3X342J","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKVRN6MW","created_at":"2026-05-18T12:27:06.952714+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/GKVRN6MW2Y3X342JVNTVWHJDFC","json":"https://pith.science/pith/GKVRN6MW2Y3X342JVNTVWHJDFC.json","graph_json":"https://pith.science/api/pith-number/GKVRN6MW2Y3X342JVNTVWHJDFC/graph.json","events_json":"https://pith.science/api/pith-number/GKVRN6MW2Y3X342JVNTVWHJDFC/events.json","paper":"https://pith.science/paper/GKVRN6MW"},"agent_actions":{"view_html":"https://pith.science/pith/GKVRN6MW2Y3X342JVNTVWHJDFC","download_json":"https://pith.science/pith/GKVRN6MW2Y3X342JVNTVWHJDFC.json","view_paper":"https://pith.science/paper/GKVRN6MW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4722&json=true","fetch_graph":"https://pith.science/api/pith-number/GKVRN6MW2Y3X342JVNTVWHJDFC/graph.json","fetch_events":"https://pith.science/api/pith-number/GKVRN6MW2Y3X342JVNTVWHJDFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKVRN6MW2Y3X342JVNTVWHJDFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKVRN6MW2Y3X342JVNTVWHJDFC/action/storage_attestation","attest_author":"https://pith.science/pith/GKVRN6MW2Y3X342JVNTVWHJDFC/action/author_attestation","sign_citation":"https://pith.science/pith/GKVRN6MW2Y3X342JVNTVWHJDFC/action/citation_signature","submit_replication":"https://pith.science/pith/GKVRN6MW2Y3X342JVNTVWHJDFC/action/replication_record"}},"created_at":"2026-05-18T01:23:33.859979+00:00","updated_at":"2026-05-18T01:23:33.859979+00:00"}