{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:H74SOSRPAGERLWFY6TYLHL2PS3","short_pith_number":"pith:H74SOSRP","schema_version":"1.0","canonical_sha256":"3ff9274a2f018915d8b8f4f0b3af4f96f4c7ebcee846f137e0c3f33ebc56bd74","source":{"kind":"arxiv","id":"1311.7298","version":1},"attestation_state":"computed","paper":{"title":"List decoding - random coding exponents and expurgated exponents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2013-11-28T12:22:52Z","abstract_excerpt":"Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size $L$. Two asymptotic regimes are considered, the fixed list-size regime, where $L$ is fixed independently of the block length $n$, and the exponential list-size, where $L$ grows exponentially with $n$. We first derive a general upper bound on the list-decoding average error probability, which is suitable for both regimes. This bound leads to more specific bounds in the two regimes. In the fixed list-size regime, the bound is related to known bounds and "},"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":"1311.7298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-28T12:22:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8c90bea88dbb3cf8d101380ed405937ff755f319c12744c25a92669025d21337","abstract_canon_sha256":"cd865b02dcd1f57a3b4d4beaa7a7f3b8e572ffc083f070c38bf66855fe04b290"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:16.576996Z","signature_b64":"IUyC7tpx96teqsoaP/UI2B7sa5jCMm+EWG32GmolaDK0/OlkaWTv/eCVQS1qw+3aRaJVGR3wo8+lERQB5/wkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ff9274a2f018915d8b8f4f0b3af4f96f4c7ebcee846f137e0c3f33ebc56bd74","last_reissued_at":"2026-05-18T00:58:16.576289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:16.576289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List decoding - random coding exponents and expurgated exponents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2013-11-28T12:22:52Z","abstract_excerpt":"Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size $L$. Two asymptotic regimes are considered, the fixed list-size regime, where $L$ is fixed independently of the block length $n$, and the exponential list-size, where $L$ grows exponentially with $n$. We first derive a general upper bound on the list-decoding average error probability, which is suitable for both regimes. This bound leads to more specific bounds in the two regimes. In the fixed list-size regime, the bound is related to known bounds and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7298","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":""},"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":"1311.7298","created_at":"2026-05-18T00:58:16.576408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.7298v1","created_at":"2026-05-18T00:58:16.576408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7298","created_at":"2026-05-18T00:58:16.576408+00:00"},{"alias_kind":"pith_short_12","alias_value":"H74SOSRPAGER","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"H74SOSRPAGERLWFY","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"H74SOSRP","created_at":"2026-05-18T12:27:46.883200+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/H74SOSRPAGERLWFY6TYLHL2PS3","json":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3.json","graph_json":"https://pith.science/api/pith-number/H74SOSRPAGERLWFY6TYLHL2PS3/graph.json","events_json":"https://pith.science/api/pith-number/H74SOSRPAGERLWFY6TYLHL2PS3/events.json","paper":"https://pith.science/paper/H74SOSRP"},"agent_actions":{"view_html":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3","download_json":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3.json","view_paper":"https://pith.science/paper/H74SOSRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.7298&json=true","fetch_graph":"https://pith.science/api/pith-number/H74SOSRPAGERLWFY6TYLHL2PS3/graph.json","fetch_events":"https://pith.science/api/pith-number/H74SOSRPAGERLWFY6TYLHL2PS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3/action/storage_attestation","attest_author":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3/action/author_attestation","sign_citation":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3/action/citation_signature","submit_replication":"https://pith.science/pith/H74SOSRPAGERLWFY6TYLHL2PS3/action/replication_record"}},"created_at":"2026-05-18T00:58:16.576408+00:00","updated_at":"2026-05-18T00:58:16.576408+00:00"}