{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UVSA44N6RHSEGEESVPJWMSQUUK","short_pith_number":"pith:UVSA44N6","canonical_record":{"source":{"id":"1504.05376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-21T10:30:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"db83505c0b4c902a56f699103c34bfd0a1c6a2a9426d7c2d00d91f6e22b9d6f7","abstract_canon_sha256":"57e9832d9c60676b50eefa09de06f6a676d65b31e6ceb013c0c0021e3ab1eb7e"},"schema_version":"1.0"},"canonical_sha256":"a5640e71be89e4431092abd3664a14a29ea3096133cbf64ccf13ee255830dbb4","source":{"kind":"arxiv","id":"1504.05376","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05376","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05376v2","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05376","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"UVSA44N6RHSE","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UVSA44N6RHSEGEES","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UVSA44N6","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UVSA44N6RHSEGEESVPJWMSQUUK","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-21T10:30:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"db83505c0b4c902a56f699103c34bfd0a1c6a2a9426d7c2d00d91f6e22b9d6f7","abstract_canon_sha256":"57e9832d9c60676b50eefa09de06f6a676d65b31e6ceb013c0c0021e3ab1eb7e"},"schema_version":"1.0"},"canonical_sha256":"a5640e71be89e4431092abd3664a14a29ea3096133cbf64ccf13ee255830dbb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:01.971948Z","signature_b64":"A9l76dNB1ND27t/F+D/ZHeFE2NGbtGVTo9kuatHZYGGtBdaW1kWh7G4JdWN0mjyjE5GY8iRfmbylpMvPPfj7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5640e71be89e4431092abd3664a14a29ea3096133cbf64ccf13ee255830dbb4","last_reissued_at":"2026-05-18T02:00:01.971347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:01.971347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05376","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5KOSJblLQX5hdM7M+wgZbmLMm59MCLtGMbBE6fpZnVMlc6yuIcChvmTJCuyiU7vyI9ZkIEf+c1LHreNZJqG/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:32:51.352845Z"},"content_sha256":"8360b29b16dca0fcaefbbe4ac6a066abeb20c662926e8b8aa663bedf7c24325c","schema_version":"1.0","event_id":"sha256:8360b29b16dca0fcaefbbe4ac6a066abeb20c662926e8b8aa663bedf7c24325c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UVSA44N6RHSEGEESVPJWMSQUUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Minimax Converse for Quantum Channel Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Joseph M. Renes","submitted_at":"2015-04-21T10:30:21Z","abstract_excerpt":"We prove a one-shot \"minimax\" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans. Info. Theory 56, 2307-2359 (2010)] for classical channel coding, and also enjoys the saddle point property enabling the order of optimizations to be interchanged. Equivalently, the bound can be formulated as a semidefinite program satisfying strong duality. The convex nature of the bound implies channel symmetries can substantially simplify the optimization,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05376","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RPdqZS+tOISw0r01f0KwhQ6St2he6FsiYv14bvwVz/Ku8Sm2wQUN9rgvANsRKY+aHROUonpnqO+001hbmyzXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:32:51.353200Z"},"content_sha256":"42a6c3d1d1a45833916efe22dccdcb77fef523d504d9324b7c541f632595e8e9","schema_version":"1.0","event_id":"sha256:42a6c3d1d1a45833916efe22dccdcb77fef523d504d9324b7c541f632595e8e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVSA44N6RHSEGEESVPJWMSQUUK/bundle.json","state_url":"https://pith.science/pith/UVSA44N6RHSEGEESVPJWMSQUUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVSA44N6RHSEGEESVPJWMSQUUK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T07:32:51Z","links":{"resolver":"https://pith.science/pith/UVSA44N6RHSEGEESVPJWMSQUUK","bundle":"https://pith.science/pith/UVSA44N6RHSEGEESVPJWMSQUUK/bundle.json","state":"https://pith.science/pith/UVSA44N6RHSEGEESVPJWMSQUUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVSA44N6RHSEGEESVPJWMSQUUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UVSA44N6RHSEGEESVPJWMSQUUK","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":"57e9832d9c60676b50eefa09de06f6a676d65b31e6ceb013c0c0021e3ab1eb7e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-21T10:30:21Z","title_canon_sha256":"db83505c0b4c902a56f699103c34bfd0a1c6a2a9426d7c2d00d91f6e22b9d6f7"},"schema_version":"1.0","source":{"id":"1504.05376","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05376","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05376v2","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05376","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"UVSA44N6RHSE","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UVSA44N6RHSEGEES","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UVSA44N6","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:42a6c3d1d1a45833916efe22dccdcb77fef523d504d9324b7c541f632595e8e9","target":"graph","created_at":"2026-05-18T02:00:01Z","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":"We prove a one-shot \"minimax\" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans. Info. Theory 56, 2307-2359 (2010)] for classical channel coding, and also enjoys the saddle point property enabling the order of optimizations to be interchanged. Equivalently, the bound can be formulated as a semidefinite program satisfying strong duality. The convex nature of the bound implies channel symmetries can substantially simplify the optimization,","authors_text":"Joseph M. Renes","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-21T10:30:21Z","title":"A Minimax Converse for Quantum Channel Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05376","kind":"arxiv","version":2},"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:8360b29b16dca0fcaefbbe4ac6a066abeb20c662926e8b8aa663bedf7c24325c","target":"record","created_at":"2026-05-18T02:00:01Z","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":"57e9832d9c60676b50eefa09de06f6a676d65b31e6ceb013c0c0021e3ab1eb7e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-21T10:30:21Z","title_canon_sha256":"db83505c0b4c902a56f699103c34bfd0a1c6a2a9426d7c2d00d91f6e22b9d6f7"},"schema_version":"1.0","source":{"id":"1504.05376","kind":"arxiv","version":2}},"canonical_sha256":"a5640e71be89e4431092abd3664a14a29ea3096133cbf64ccf13ee255830dbb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5640e71be89e4431092abd3664a14a29ea3096133cbf64ccf13ee255830dbb4","first_computed_at":"2026-05-18T02:00:01.971347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:01.971347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A9l76dNB1ND27t/F+D/ZHeFE2NGbtGVTo9kuatHZYGGtBdaW1kWh7G4JdWN0mjyjE5GY8iRfmbylpMvPPfj7BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:01.971948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05376","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8360b29b16dca0fcaefbbe4ac6a066abeb20c662926e8b8aa663bedf7c24325c","sha256:42a6c3d1d1a45833916efe22dccdcb77fef523d504d9324b7c541f632595e8e9"],"state_sha256":"e9e797b9862efcf0991cd6694760234b5203ec434ecc8d31c9388305c99e66a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AknRsa7PjoI1LtW81cGNxYh9m+18KdCfDcFrxLtQa+RW1AIGjYzHMoo+vUexlY0JEAfx3/QZWrmajmHVUmD+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:32:51.355202Z","bundle_sha256":"04b6699bde7f92de3506f40ca31f939292c3cdd9af64826e548e6dceb5681d05"}}