{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:BNAOWKJ57K6VNADN7YOYQUBWER","short_pith_number":"pith:BNAOWKJ5","schema_version":"1.0","canonical_sha256":"0b40eb293dfabd56806dfe1d885036244c873263de0b68129841851090ef5728","source":{"kind":"arxiv","id":"0711.2501","version":1},"attestation_state":"computed","paper":{"title":"Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2007-11-15T20:20:19Z","abstract_excerpt":"The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen's inequality as well as some other inequalities in the derivation, we demonstrate that an exponentially tight analysis can be carried out by assessing the relevant moments of a certain distance enumerator. The resulting bound has the following advantages: (i) it is at least as tight as Forney's bound, (ii) under certain symmetry conditions associated with the channel and the random coding distribution, it is simpler than Forney's bound in the sense that it inv"},"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":"0711.2501","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-11-15T20:20:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47476c042425461fb13a70d0385ba6c78256ea474f59d7715b7cbd9a3844b02f","abstract_canon_sha256":"721ddef5c1373d4455ff5e9446a519a559c9beb19e38e9992c18cb41ea884b8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.929588Z","signature_b64":"eZ/BE5Kkgu+3Gnub9YaV6F8SUGZZ19qZ8cHjC+MukAHN/x3+Uyo1VTH6lg8Vf6JBJZ3WHz5+V0HAL+I3mUM/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b40eb293dfabd56806dfe1d885036244c873263de0b68129841851090ef5728","last_reissued_at":"2026-05-18T00:58:25.928849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.928849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2007-11-15T20:20:19Z","abstract_excerpt":"The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen's inequality as well as some other inequalities in the derivation, we demonstrate that an exponentially tight analysis can be carried out by assessing the relevant moments of a certain distance enumerator. The resulting bound has the following advantages: (i) it is at least as tight as Forney's bound, (ii) under certain symmetry conditions associated with the channel and the random coding distribution, it is simpler than Forney's bound in the sense that it inv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.2501","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":"0711.2501","created_at":"2026-05-18T00:58:25.928967+00:00"},{"alias_kind":"arxiv_version","alias_value":"0711.2501v1","created_at":"2026-05-18T00:58:25.928967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.2501","created_at":"2026-05-18T00:58:25.928967+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNAOWKJ57K6V","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNAOWKJ57K6VNADN","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNAOWKJ5","created_at":"2026-05-18T12:25:55.427421+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/BNAOWKJ57K6VNADN7YOYQUBWER","json":"https://pith.science/pith/BNAOWKJ57K6VNADN7YOYQUBWER.json","graph_json":"https://pith.science/api/pith-number/BNAOWKJ57K6VNADN7YOYQUBWER/graph.json","events_json":"https://pith.science/api/pith-number/BNAOWKJ57K6VNADN7YOYQUBWER/events.json","paper":"https://pith.science/paper/BNAOWKJ5"},"agent_actions":{"view_html":"https://pith.science/pith/BNAOWKJ57K6VNADN7YOYQUBWER","download_json":"https://pith.science/pith/BNAOWKJ57K6VNADN7YOYQUBWER.json","view_paper":"https://pith.science/paper/BNAOWKJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0711.2501&json=true","fetch_graph":"https://pith.science/api/pith-number/BNAOWKJ57K6VNADN7YOYQUBWER/graph.json","fetch_events":"https://pith.science/api/pith-number/BNAOWKJ57K6VNADN7YOYQUBWER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNAOWKJ57K6VNADN7YOYQUBWER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNAOWKJ57K6VNADN7YOYQUBWER/action/storage_attestation","attest_author":"https://pith.science/pith/BNAOWKJ57K6VNADN7YOYQUBWER/action/author_attestation","sign_citation":"https://pith.science/pith/BNAOWKJ57K6VNADN7YOYQUBWER/action/citation_signature","submit_replication":"https://pith.science/pith/BNAOWKJ57K6VNADN7YOYQUBWER/action/replication_record"}},"created_at":"2026-05-18T00:58:25.928967+00:00","updated_at":"2026-05-18T00:58:25.928967+00:00"}