{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VJLEMEUP7VSXAKFVHRCYTQWRNG","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":"ef0e43fcaf99689b8e9397879eeaaf0137b9b5db2444e3930d320dcc562d688e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-25T20:00:35Z","title_canon_sha256":"f9edc38168dc97cb4d73c602e07a370de9fbd306db1d6b7384ce6595248b1b7d"},"schema_version":"1.0","source":{"id":"1310.7028","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7028","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7028v3","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7028","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"pith_short_12","alias_value":"VJLEMEUP7VSX","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VJLEMEUP7VSXAKFV","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VJLEMEUP","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:82ff691a6e589ea0ebcdfc645c7a0469fa16355605889bd96073b4c35070a5bd","target":"graph","created_at":"2026-05-18T02:27:44Z","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"},"paper":{"abstract_excerpt":"The fully quantum reverse Shannon theorem establishes the optimal rate of noiseless classical communication required for simulating the action of many instances of a noisy quantum channel on an arbitrary input state, while also allowing for an arbitrary amount of shared entanglement of an arbitrary form. Turning this theorem around establishes a strong converse for the entanglement-assisted classical capacity of any quantum channel. This paper proves the strong converse for entanglement-assisted capacity by a completely different approach and identifies a bound on the strong converse exponent ","authors_text":"Manish K. Gupta, Mark M. Wilde","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-25T20:00:35Z","title":"Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7028","kind":"arxiv","version":3},"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:9900433f95d07c2ab8b8142898add2db3aad9aa0b898a205fb3ba4b5fb893583","target":"record","created_at":"2026-05-18T02:27:44Z","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":"ef0e43fcaf99689b8e9397879eeaaf0137b9b5db2444e3930d320dcc562d688e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-25T20:00:35Z","title_canon_sha256":"f9edc38168dc97cb4d73c602e07a370de9fbd306db1d6b7384ce6595248b1b7d"},"schema_version":"1.0","source":{"id":"1310.7028","kind":"arxiv","version":3}},"canonical_sha256":"aa5646128ffd657028b53c4589c2d16997f8e1b07f73a7327b65df1e94712a53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa5646128ffd657028b53c4589c2d16997f8e1b07f73a7327b65df1e94712a53","first_computed_at":"2026-05-18T02:27:44.866083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:44.866083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xfV8cAFm48CqlbCEa57zznpxNE4dTV2DOsimLvUFQN8qmWWlAokgRZiLddhj2xwAKtLyBz5O9NG1q6C+3YAGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:44.866522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7028","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9900433f95d07c2ab8b8142898add2db3aad9aa0b898a205fb3ba4b5fb893583","sha256:82ff691a6e589ea0ebcdfc645c7a0469fa16355605889bd96073b4c35070a5bd"],"state_sha256":"e2f8de3ad9628f108922a5c5ed4a03333d51222aa9b5c4c2e0892eefb6002387"}