{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:G2KBHAUDQPABIMLRLF2RVXUMR6","short_pith_number":"pith:G2KBHAUD","canonical_record":{"source":{"id":"1709.00200","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-01T08:45:57Z","cross_cats_sorted":[],"title_canon_sha256":"180ffa8d5d7c13caed600e59cfddfb1c5caa9a6d2ce11bb07b8d21a0d4bd1d79","abstract_canon_sha256":"729edfb047f90df657fbf71d3500524ed6f19194e0ecfdb97655d3ffbb0bbb18"},"schema_version":"1.0"},"canonical_sha256":"369413828383c014317159751ade8c8fbfc9fd24c35a6ddf50ac50e6265cbf4b","source":{"kind":"arxiv","id":"1709.00200","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00200","created_at":"2026-05-17T23:47:08Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00200v3","created_at":"2026-05-17T23:47:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00200","created_at":"2026-05-17T23:47:08Z"},{"alias_kind":"pith_short_12","alias_value":"G2KBHAUDQPAB","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G2KBHAUDQPABIMLR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G2KBHAUD","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:G2KBHAUDQPABIMLRLF2RVXUMR6","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00200","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-01T08:45:57Z","cross_cats_sorted":[],"title_canon_sha256":"180ffa8d5d7c13caed600e59cfddfb1c5caa9a6d2ce11bb07b8d21a0d4bd1d79","abstract_canon_sha256":"729edfb047f90df657fbf71d3500524ed6f19194e0ecfdb97655d3ffbb0bbb18"},"schema_version":"1.0"},"canonical_sha256":"369413828383c014317159751ade8c8fbfc9fd24c35a6ddf50ac50e6265cbf4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:08.823028Z","signature_b64":"tWp/zfHgBe3pKs/xGFfPY4fjC6QrmofDBGi1FHYVl1pc4CDMcGtvwGumw6jZtCFvQNygr0hNKxvGp40+asubAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"369413828383c014317159751ade8c8fbfc9fd24c35a6ddf50ac50e6265cbf4b","last_reissued_at":"2026-05-17T23:47:08.822464Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:08.822464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00200","source_version":3,"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-17T23:47:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11wEP0B8qdEkh1AeTMYcMUxq9LQp6ejWRUcfVEoR5shxFqebHrn50AhxiJ1XWBNLOY5elBTJGh3TWN2c7KR/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:15:54.577619Z"},"content_sha256":"17f0383d126181a7a3b8273c2f79e44cc319d8f537015ff001af9e5c3d876076","schema_version":"1.0","event_id":"sha256:17f0383d126181a7a3b8273c2f79e44cc319d8f537015ff001af9e5c3d876076"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:G2KBHAUDQPABIMLRLF2RVXUMR6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semidefinite programming converse bounds for quantum communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kun Fang, Runyao Duan, Xin Wang","submitted_at":"2017-09-01T08:45:57Z","abstract_excerpt":"We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime. First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of quantum information that can be transmitted over a single use of a quantum channel, which improve the previous bound from [Tomamichel/Berta/Renes, Nat. Commun. 7, 2016]. As applications, we study quantum communication over depolarizing channels and amplitude damping channels with finite resources. Second, we find an SDP strong converse bound for the quantum c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00200","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":""},"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-17T23:47:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9uT7tWjH1oNzlBP8IQ+GPH+Riw5E4OceFigkIqorv5IL9ta+jsIA7MWA5rkSFDRh1a2pX3Zl4DhCC+w3s+CCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:15:54.577973Z"},"content_sha256":"8296070c5ce98c5bf1729403744b6703b62ad57949f4af6a51aad1ebc3a0d1a7","schema_version":"1.0","event_id":"sha256:8296070c5ce98c5bf1729403744b6703b62ad57949f4af6a51aad1ebc3a0d1a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2KBHAUDQPABIMLRLF2RVXUMR6/bundle.json","state_url":"https://pith.science/pith/G2KBHAUDQPABIMLRLF2RVXUMR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2KBHAUDQPABIMLRLF2RVXUMR6/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-06-01T05:15:54Z","links":{"resolver":"https://pith.science/pith/G2KBHAUDQPABIMLRLF2RVXUMR6","bundle":"https://pith.science/pith/G2KBHAUDQPABIMLRLF2RVXUMR6/bundle.json","state":"https://pith.science/pith/G2KBHAUDQPABIMLRLF2RVXUMR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2KBHAUDQPABIMLRLF2RVXUMR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:G2KBHAUDQPABIMLRLF2RVXUMR6","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":"729edfb047f90df657fbf71d3500524ed6f19194e0ecfdb97655d3ffbb0bbb18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-01T08:45:57Z","title_canon_sha256":"180ffa8d5d7c13caed600e59cfddfb1c5caa9a6d2ce11bb07b8d21a0d4bd1d79"},"schema_version":"1.0","source":{"id":"1709.00200","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00200","created_at":"2026-05-17T23:47:08Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00200v3","created_at":"2026-05-17T23:47:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00200","created_at":"2026-05-17T23:47:08Z"},{"alias_kind":"pith_short_12","alias_value":"G2KBHAUDQPAB","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G2KBHAUDQPABIMLR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G2KBHAUD","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:8296070c5ce98c5bf1729403744b6703b62ad57949f4af6a51aad1ebc3a0d1a7","target":"graph","created_at":"2026-05-17T23:47:08Z","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 derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime. First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of quantum information that can be transmitted over a single use of a quantum channel, which improve the previous bound from [Tomamichel/Berta/Renes, Nat. Commun. 7, 2016]. As applications, we study quantum communication over depolarizing channels and amplitude damping channels with finite resources. Second, we find an SDP strong converse bound for the quantum c","authors_text":"Kun Fang, Runyao Duan, Xin Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-01T08:45:57Z","title":"Semidefinite programming converse bounds for quantum communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00200","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:17f0383d126181a7a3b8273c2f79e44cc319d8f537015ff001af9e5c3d876076","target":"record","created_at":"2026-05-17T23:47:08Z","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":"729edfb047f90df657fbf71d3500524ed6f19194e0ecfdb97655d3ffbb0bbb18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-01T08:45:57Z","title_canon_sha256":"180ffa8d5d7c13caed600e59cfddfb1c5caa9a6d2ce11bb07b8d21a0d4bd1d79"},"schema_version":"1.0","source":{"id":"1709.00200","kind":"arxiv","version":3}},"canonical_sha256":"369413828383c014317159751ade8c8fbfc9fd24c35a6ddf50ac50e6265cbf4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"369413828383c014317159751ade8c8fbfc9fd24c35a6ddf50ac50e6265cbf4b","first_computed_at":"2026-05-17T23:47:08.822464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:08.822464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tWp/zfHgBe3pKs/xGFfPY4fjC6QrmofDBGi1FHYVl1pc4CDMcGtvwGumw6jZtCFvQNygr0hNKxvGp40+asubAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:08.823028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00200","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17f0383d126181a7a3b8273c2f79e44cc319d8f537015ff001af9e5c3d876076","sha256:8296070c5ce98c5bf1729403744b6703b62ad57949f4af6a51aad1ebc3a0d1a7"],"state_sha256":"6600177bac29743329f8f8b05b2c1449daa326768c6c8c9bf1f847c723360403"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXWkEPOkBgyVMpgOmfkiLd4CIe3wBWfOhpwiBvmUtQ4LQglwFf4eRgkPrNkGC/gIz8253AgsMNJbHim1jAnHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:15:54.580148Z","bundle_sha256":"370364b701ceec8338e5820f8ec3a6beb7dd65495d734ff399a4805c6af0acde"}}