{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DGY6ZBKAFXGVERT723QK6YG3KC","short_pith_number":"pith:DGY6ZBKA","schema_version":"1.0","canonical_sha256":"19b1ec85402dcd52467fd6e0af60db50a0c7ce21fd7160c4731938b832f217e7","source":{"kind":"arxiv","id":"1504.07075","version":5},"attestation_state":"computed","paper":{"title":"Random coding exponents galore via decoupling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Naresh Sharma","submitted_at":"2015-04-27T13:24:31Z","abstract_excerpt":"A missing piece in quantum information theory, with very few exceptions, has been to provide the random coding exponents for quantum information-processing protocols. We remedy the situation by providing these exponents for a variety of protocols including those at the top of the family tree of protocols. Our line of attack is to provide an exponential bound on the decoupling error for a restricted class of completely positive maps where a key term in the exponent is in terms of a R\\'enyi \\alpha-information-theoretic quantity for any \\alpha $\\in$ (1,2]. Among the protocols covered are fully qu"},"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":"1504.07075","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-27T13:24:31Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"58d7738506af5256b127dc5572e9eb0322644fcf6fff2e9d7ef4b4910908c34d","abstract_canon_sha256":"8d6f211a3145820700d5d773cb92a0c965c275dce5b57cdf727552ca780acef3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:53.039012Z","signature_b64":"dCZrd4ABpoogzxTwix/1+3uGZIjTMVy2oRxq0oa0NhTClYWuW5GDHu3eJblnwaba1U390S6xo0soSEqdi6d9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19b1ec85402dcd52467fd6e0af60db50a0c7ce21fd7160c4731938b832f217e7","last_reissued_at":"2026-05-18T01:31:53.038572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:53.038572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random coding exponents galore via decoupling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Naresh Sharma","submitted_at":"2015-04-27T13:24:31Z","abstract_excerpt":"A missing piece in quantum information theory, with very few exceptions, has been to provide the random coding exponents for quantum information-processing protocols. We remedy the situation by providing these exponents for a variety of protocols including those at the top of the family tree of protocols. Our line of attack is to provide an exponential bound on the decoupling error for a restricted class of completely positive maps where a key term in the exponent is in terms of a R\\'enyi \\alpha-information-theoretic quantity for any \\alpha $\\in$ (1,2]. Among the protocols covered are fully qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07075","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.07075","created_at":"2026-05-18T01:31:53.038656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07075v5","created_at":"2026-05-18T01:31:53.038656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07075","created_at":"2026-05-18T01:31:53.038656+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGY6ZBKAFXGV","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGY6ZBKAFXGVERT7","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGY6ZBKA","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DGY6ZBKAFXGVERT723QK6YG3KC","json":"https://pith.science/pith/DGY6ZBKAFXGVERT723QK6YG3KC.json","graph_json":"https://pith.science/api/pith-number/DGY6ZBKAFXGVERT723QK6YG3KC/graph.json","events_json":"https://pith.science/api/pith-number/DGY6ZBKAFXGVERT723QK6YG3KC/events.json","paper":"https://pith.science/paper/DGY6ZBKA"},"agent_actions":{"view_html":"https://pith.science/pith/DGY6ZBKAFXGVERT723QK6YG3KC","download_json":"https://pith.science/pith/DGY6ZBKAFXGVERT723QK6YG3KC.json","view_paper":"https://pith.science/paper/DGY6ZBKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07075&json=true","fetch_graph":"https://pith.science/api/pith-number/DGY6ZBKAFXGVERT723QK6YG3KC/graph.json","fetch_events":"https://pith.science/api/pith-number/DGY6ZBKAFXGVERT723QK6YG3KC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGY6ZBKAFXGVERT723QK6YG3KC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGY6ZBKAFXGVERT723QK6YG3KC/action/storage_attestation","attest_author":"https://pith.science/pith/DGY6ZBKAFXGVERT723QK6YG3KC/action/author_attestation","sign_citation":"https://pith.science/pith/DGY6ZBKAFXGVERT723QK6YG3KC/action/citation_signature","submit_replication":"https://pith.science/pith/DGY6ZBKAFXGVERT723QK6YG3KC/action/replication_record"}},"created_at":"2026-05-18T01:31:53.038656+00:00","updated_at":"2026-05-18T01:31:53.038656+00:00"}