{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:FWORLPE5IXAFWWDWUKZ5K5V3VD","short_pith_number":"pith:FWORLPE5","canonical_record":{"source":{"id":"2203.02127","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-04T04:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"bf67d839bd046d8ab27f4237582dd65f3f230bed8c6c709793ed12a40ba7093e","abstract_canon_sha256":"c8f26f7a62907a8237a2c8cf5517a7b7ca4121fb18b543992de13d3ac7738ab4"},"schema_version":"1.0"},"canonical_sha256":"2d9d15bc9d45c05b5876a2b3d576bba8cac2a8e142297758ad6efef55ba24b32","source":{"kind":"arxiv","id":"2203.02127","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.02127","created_at":"2026-07-05T06:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"2203.02127v1","created_at":"2026-07-05T06:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.02127","created_at":"2026-07-05T06:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"FWORLPE5IXAF","created_at":"2026-07-05T06:44:04Z"},{"alias_kind":"pith_short_16","alias_value":"FWORLPE5IXAFWWDW","created_at":"2026-07-05T06:44:04Z"},{"alias_kind":"pith_short_8","alias_value":"FWORLPE5","created_at":"2026-07-05T06:44:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:FWORLPE5IXAFWWDWUKZ5K5V3VD","target":"record","payload":{"canonical_record":{"source":{"id":"2203.02127","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-04T04:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"bf67d839bd046d8ab27f4237582dd65f3f230bed8c6c709793ed12a40ba7093e","abstract_canon_sha256":"c8f26f7a62907a8237a2c8cf5517a7b7ca4121fb18b543992de13d3ac7738ab4"},"schema_version":"1.0"},"canonical_sha256":"2d9d15bc9d45c05b5876a2b3d576bba8cac2a8e142297758ad6efef55ba24b32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:04.189940Z","signature_b64":"Fe1MPl6F+NW2Q1OAIWKY44ALhQc7lPAPhaDu7+hx7/LJN/IJw5qJ+WleUQZo74Nw/gSBJAwGnQbgAy1vpGZfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d9d15bc9d45c05b5876a2b3d576bba8cac2a8e142297758ad6efef55ba24b32","last_reissued_at":"2026-07-05T06:44:04.189525Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:04.189525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.02127","source_version":1,"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-07-05T06:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UU2dMzZDAwLYK9S/XwW7bfLV/3Ktg4WKRf+6ma5EckILZarl8PZ9QZpwjPw/b8c8KoEtgpSryIrVcxqgGls7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:32:54.808511Z"},"content_sha256":"46481bc6fab7ce4c90ec460d8b5a9e7af4f4e8b159d14c9d2b99357d6898de11","schema_version":"1.0","event_id":"sha256:46481bc6fab7ce4c90ec460d8b5a9e7af4f4e8b159d14c9d2b99357d6898de11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:FWORLPE5IXAFWWDWUKZ5K5V3VD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A hierarchy of efficient bounds on quantum capacities exploiting symmetry","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ala Shayeghi, Hoang Ta, Omar Fawzi","submitted_at":"2022-03-04T04:34:15Z","abstract_excerpt":"Optimal rates for achieving an information processing task are often characterized in terms of regularized information measures. In many cases of quantum tasks, we do not know how to compute such quantities. Here, we exploit the symmetries in the recently introduced $D^{\\#}$ in order to obtain a hierarchy of semidefinite programming bounds on various regularized quantities. As applications, we give a general procedure to give efficient bounds on the regularized Umegaki channel divergence as well as the classical capacity and two-way assisted quantum capacity of quantum channels. In particular,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.02127","kind":"arxiv","version":1},"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/2203.02127/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"},"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-07-05T06:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ex9LuM7OvtL6M6tRgDg3THDBmARSKl9yrMAt2Db3GD4uKvWg9Ya/n5mT5f8gM5ZVDG+mdPjvqPpd+9PHAB+bBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:32:54.809019Z"},"content_sha256":"fe5a3e044b4a50bbbb69d2a65ba3e8179ceda3e9d2e6e6c1431ddd862ea89cc9","schema_version":"1.0","event_id":"sha256:fe5a3e044b4a50bbbb69d2a65ba3e8179ceda3e9d2e6e6c1431ddd862ea89cc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD/bundle.json","state_url":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD/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-08-06T21:32:54Z","links":{"resolver":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD","bundle":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD/bundle.json","state":"https://pith.science/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWORLPE5IXAFWWDWUKZ5K5V3VD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FWORLPE5IXAFWWDWUKZ5K5V3VD","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":"c8f26f7a62907a8237a2c8cf5517a7b7ca4121fb18b543992de13d3ac7738ab4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-04T04:34:15Z","title_canon_sha256":"bf67d839bd046d8ab27f4237582dd65f3f230bed8c6c709793ed12a40ba7093e"},"schema_version":"1.0","source":{"id":"2203.02127","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.02127","created_at":"2026-07-05T06:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"2203.02127v1","created_at":"2026-07-05T06:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.02127","created_at":"2026-07-05T06:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"FWORLPE5IXAF","created_at":"2026-07-05T06:44:04Z"},{"alias_kind":"pith_short_16","alias_value":"FWORLPE5IXAFWWDW","created_at":"2026-07-05T06:44:04Z"},{"alias_kind":"pith_short_8","alias_value":"FWORLPE5","created_at":"2026-07-05T06:44:04Z"}],"graph_snapshots":[{"event_id":"sha256:fe5a3e044b4a50bbbb69d2a65ba3e8179ceda3e9d2e6e6c1431ddd862ea89cc9","target":"graph","created_at":"2026-07-05T06:44:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.02127/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimal rates for achieving an information processing task are often characterized in terms of regularized information measures. In many cases of quantum tasks, we do not know how to compute such quantities. Here, we exploit the symmetries in the recently introduced $D^{\\#}$ in order to obtain a hierarchy of semidefinite programming bounds on various regularized quantities. As applications, we give a general procedure to give efficient bounds on the regularized Umegaki channel divergence as well as the classical capacity and two-way assisted quantum capacity of quantum channels. In particular,","authors_text":"Ala Shayeghi, Hoang Ta, Omar Fawzi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-04T04:34:15Z","title":"A hierarchy of efficient bounds on quantum capacities exploiting symmetry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.02127","kind":"arxiv","version":1},"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:46481bc6fab7ce4c90ec460d8b5a9e7af4f4e8b159d14c9d2b99357d6898de11","target":"record","created_at":"2026-07-05T06:44:04Z","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":"c8f26f7a62907a8237a2c8cf5517a7b7ca4121fb18b543992de13d3ac7738ab4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-04T04:34:15Z","title_canon_sha256":"bf67d839bd046d8ab27f4237582dd65f3f230bed8c6c709793ed12a40ba7093e"},"schema_version":"1.0","source":{"id":"2203.02127","kind":"arxiv","version":1}},"canonical_sha256":"2d9d15bc9d45c05b5876a2b3d576bba8cac2a8e142297758ad6efef55ba24b32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d9d15bc9d45c05b5876a2b3d576bba8cac2a8e142297758ad6efef55ba24b32","first_computed_at":"2026-07-05T06:44:04.189525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:44:04.189525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fe1MPl6F+NW2Q1OAIWKY44ALhQc7lPAPhaDu7+hx7/LJN/IJw5qJ+WleUQZo74Nw/gSBJAwGnQbgAy1vpGZfAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:44:04.189940Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.02127","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46481bc6fab7ce4c90ec460d8b5a9e7af4f4e8b159d14c9d2b99357d6898de11","sha256:fe5a3e044b4a50bbbb69d2a65ba3e8179ceda3e9d2e6e6c1431ddd862ea89cc9"],"state_sha256":"a916393e678874a4c5e903b407163e6aa7076ac888901360c5581164204ec92c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BixU3QwFHdGfKBjOuNNK+rzMj92fsMHNowxpYB9mazDyuKPpS2kq2qTJrn2Ys1Ru7pDJ8vD7rRulhWtxqwS2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T21:32:54.813237Z","bundle_sha256":"ae76493b5c22305b051b58e50ea6e5ca3c85a31dd3d47bca7f44a95d0d71769c"}}