{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HGD4WGT6WL5DPNCXCNGUA4N6XO","short_pith_number":"pith:HGD4WGT6","schema_version":"1.0","canonical_sha256":"3987cb1a7eb2fa37b457134d4071bebb9c2f8c0b33d470b9d9222114ccc3fdef","source":{"kind":"arxiv","id":"2410.07051","version":1},"attestation_state":"computed","paper":{"title":"Exponents for Shared Randomness-Assisted Channel Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Aadil Oufkir, Hao-Chung Cheng, Mario Berta, Michael X. Cao","submitted_at":"2024-10-09T16:45:58Z","abstract_excerpt":"We determine the exact error and strong converse exponents of shared randomness-assisted channel simulation in worst case total-variation distance. Namely, we find that these exponents can be written as simple optimizations over the R\\'enyi channel mutual information. Strikingly, and in stark contrast to channel coding, there are no critical rates, allowing a tight characterization for arbitrary rates below and above the simulation capacity. We derive our results by asymptotically expanding the meta-converse for channel simulation [Cao {\\it et al.}, IEEE Trans.~Inf.~Theory (2024)], which corre"},"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":"2410.07051","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-10-09T16:45:58Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"7db6cce5c3eb3712bb0abd0f5c165a1e72511b8aaa99e7cbbd63195dfd3963a2","abstract_canon_sha256":"78dfdc5be1cc814a23afa22843f6b479dfe6e41608157c6347c0d6fe3d1bedbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:10.255742Z","signature_b64":"8z6Qs4Q17Y5afN9CG9+bSO6jMoT6f9KmUIaN8zXuSmugl35Z7ci27UdIBVs31nqz7wiD2eYg9kHt5u8XXSexBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3987cb1a7eb2fa37b457134d4071bebb9c2f8c0b33d470b9d9222114ccc3fdef","last_reissued_at":"2026-07-05T09:18:10.255290Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:10.255290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponents for Shared Randomness-Assisted Channel Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Aadil Oufkir, Hao-Chung Cheng, Mario Berta, Michael X. Cao","submitted_at":"2024-10-09T16:45:58Z","abstract_excerpt":"We determine the exact error and strong converse exponents of shared randomness-assisted channel simulation in worst case total-variation distance. Namely, we find that these exponents can be written as simple optimizations over the R\\'enyi channel mutual information. Strikingly, and in stark contrast to channel coding, there are no critical rates, allowing a tight characterization for arbitrary rates below and above the simulation capacity. We derive our results by asymptotically expanding the meta-converse for channel simulation [Cao {\\it et al.}, IEEE Trans.~Inf.~Theory (2024)], which corre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07051","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/2410.07051/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.07051","created_at":"2026-07-05T09:18:10.255357+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.07051v1","created_at":"2026-07-05T09:18:10.255357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07051","created_at":"2026-07-05T09:18:10.255357+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGD4WGT6WL5D","created_at":"2026-07-05T09:18:10.255357+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGD4WGT6WL5DPNCX","created_at":"2026-07-05T09:18:10.255357+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGD4WGT6","created_at":"2026-07-05T09:18:10.255357+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.06050","citing_title":"Strong converse Exponents of Partially Smoothed Information Measures","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HGD4WGT6WL5DPNCXCNGUA4N6XO","json":"https://pith.science/pith/HGD4WGT6WL5DPNCXCNGUA4N6XO.json","graph_json":"https://pith.science/api/pith-number/HGD4WGT6WL5DPNCXCNGUA4N6XO/graph.json","events_json":"https://pith.science/api/pith-number/HGD4WGT6WL5DPNCXCNGUA4N6XO/events.json","paper":"https://pith.science/paper/HGD4WGT6"},"agent_actions":{"view_html":"https://pith.science/pith/HGD4WGT6WL5DPNCXCNGUA4N6XO","download_json":"https://pith.science/pith/HGD4WGT6WL5DPNCXCNGUA4N6XO.json","view_paper":"https://pith.science/paper/HGD4WGT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.07051&json=true","fetch_graph":"https://pith.science/api/pith-number/HGD4WGT6WL5DPNCXCNGUA4N6XO/graph.json","fetch_events":"https://pith.science/api/pith-number/HGD4WGT6WL5DPNCXCNGUA4N6XO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGD4WGT6WL5DPNCXCNGUA4N6XO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGD4WGT6WL5DPNCXCNGUA4N6XO/action/storage_attestation","attest_author":"https://pith.science/pith/HGD4WGT6WL5DPNCXCNGUA4N6XO/action/author_attestation","sign_citation":"https://pith.science/pith/HGD4WGT6WL5DPNCXCNGUA4N6XO/action/citation_signature","submit_replication":"https://pith.science/pith/HGD4WGT6WL5DPNCXCNGUA4N6XO/action/replication_record"}},"created_at":"2026-07-05T09:18:10.255357+00:00","updated_at":"2026-07-05T09:18:10.255357+00:00"}