{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PJAMQTIXWKKFESFEBYTPISDS5M","short_pith_number":"pith:PJAMQTIX","schema_version":"1.0","canonical_sha256":"7a40c84d17b2945248a40e26f44872eb08a40b01ba9bd19fdae58e760ad00c18","source":{"kind":"arxiv","id":"1412.1964","version":1},"attestation_state":"computed","paper":{"title":"Simplified Erasure/List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Nir Weinberger","submitted_at":"2014-12-05T11:42:01Z","abstract_excerpt":"We consider the problem of erasure/list decoding using certain classes of simplified decoders. Specifically, we assume a class of erasure/list decoders, such that a codeword is in the list if its likelihood is larger than a threshold. This class of decoders both approximates the optimal decoder of Forney, and also includes the following simplified subclasses of decoding rules: The first is a function of the output vector only, but not the codebook (which is most suitable for high rates), and the second is a scaled version of the maximum likelihood decoder (which is most suitable for low rates)"},"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":"1412.1964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-05T11:42:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e6138558a88149f833bbefe3ae0b89665023251d84bd296d8009884e1c7f678","abstract_canon_sha256":"09d4f8e20be3c6643772650fdf6e5f94aab2f2fb8f5a7e8074e0128a1daa714b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:11.186343Z","signature_b64":"RL9Vo3TYb0zFfBK/IUhWIMHn7F7a/PGGy67LPrwzZdhI2L5Sv9vRaRtyu7rwlE9NPel0PFlM9zo0uAqfpow2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a40c84d17b2945248a40e26f44872eb08a40b01ba9bd19fdae58e760ad00c18","last_reissued_at":"2026-05-18T00:58:11.185727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:11.185727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplified Erasure/List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Nir Weinberger","submitted_at":"2014-12-05T11:42:01Z","abstract_excerpt":"We consider the problem of erasure/list decoding using certain classes of simplified decoders. Specifically, we assume a class of erasure/list decoders, such that a codeword is in the list if its likelihood is larger than a threshold. This class of decoders both approximates the optimal decoder of Forney, and also includes the following simplified subclasses of decoding rules: The first is a function of the output vector only, but not the codebook (which is most suitable for high rates), and the second is a scaled version of the maximum likelihood decoder (which is most suitable for low rates)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1964","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":"1412.1964","created_at":"2026-05-18T00:58:11.185805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1964v1","created_at":"2026-05-18T00:58:11.185805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1964","created_at":"2026-05-18T00:58:11.185805+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJAMQTIXWKKF","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJAMQTIXWKKFESFE","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJAMQTIX","created_at":"2026-05-18T12:28:43.426989+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/PJAMQTIXWKKFESFEBYTPISDS5M","json":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M.json","graph_json":"https://pith.science/api/pith-number/PJAMQTIXWKKFESFEBYTPISDS5M/graph.json","events_json":"https://pith.science/api/pith-number/PJAMQTIXWKKFESFEBYTPISDS5M/events.json","paper":"https://pith.science/paper/PJAMQTIX"},"agent_actions":{"view_html":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M","download_json":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M.json","view_paper":"https://pith.science/paper/PJAMQTIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1964&json=true","fetch_graph":"https://pith.science/api/pith-number/PJAMQTIXWKKFESFEBYTPISDS5M/graph.json","fetch_events":"https://pith.science/api/pith-number/PJAMQTIXWKKFESFEBYTPISDS5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M/action/storage_attestation","attest_author":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M/action/author_attestation","sign_citation":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M/action/citation_signature","submit_replication":"https://pith.science/pith/PJAMQTIXWKKFESFEBYTPISDS5M/action/replication_record"}},"created_at":"2026-05-18T00:58:11.185805+00:00","updated_at":"2026-05-18T00:58:11.185805+00:00"}