{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CFWSFN4BUBFJAHH643ETPJWPSH","short_pith_number":"pith:CFWSFN4B","schema_version":"1.0","canonical_sha256":"116d22b781a04a901cfee6c937a6cf91c22a66f402d951d90ed5e34d1027b3e1","source":{"kind":"arxiv","id":"1810.08161","version":1},"attestation_state":"computed","paper":{"title":"Ratio List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anelia Somekh-Baruch","submitted_at":"2018-10-18T16:57:26Z","abstract_excerpt":"We extend the notion of list decoding to {\\em ratio list decoding} which involves a list decoder whose list size is specified as a function of the number of messages $M_n$ and the block length $n$. We present necessary and sufficient conditions on $M_n$ for the existence of code sequences which enable reliable list decoding with respect to the desired list size $L(M_n,n)$. It is shown that the ratio-capacity, defined as the supremum of achievable normalized logarithms of the ratio $r(M_n,n)=M_n/L(M_n,n)$ is equal to the Shannon channel capacity $C$, for both stochastic and deterministic encodi"},"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":"1810.08161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-18T16:57:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"44039c29f0f67fe105e2e8ac207c0e2529639f1a0b2da59e439d1f9a78743d08","abstract_canon_sha256":"f5be2ad4f9e98e10228534ba402422059fc5588a70b8362701e11d2d135f5452"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:50.417444Z","signature_b64":"KYZY9LUc6wj9MZDegCBaWP4+8up0OLm7+Mevod1lu4kWyGAPDTs/W2YwfNArLkoDuPjxRtbScLoVTNIRuSlgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"116d22b781a04a901cfee6c937a6cf91c22a66f402d951d90ed5e34d1027b3e1","last_reissued_at":"2026-05-18T00:02:50.416939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:50.416939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ratio List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anelia Somekh-Baruch","submitted_at":"2018-10-18T16:57:26Z","abstract_excerpt":"We extend the notion of list decoding to {\\em ratio list decoding} which involves a list decoder whose list size is specified as a function of the number of messages $M_n$ and the block length $n$. We present necessary and sufficient conditions on $M_n$ for the existence of code sequences which enable reliable list decoding with respect to the desired list size $L(M_n,n)$. It is shown that the ratio-capacity, defined as the supremum of achievable normalized logarithms of the ratio $r(M_n,n)=M_n/L(M_n,n)$ is equal to the Shannon channel capacity $C$, for both stochastic and deterministic encodi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08161","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":"1810.08161","created_at":"2026-05-18T00:02:50.417019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08161v1","created_at":"2026-05-18T00:02:50.417019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08161","created_at":"2026-05-18T00:02:50.417019+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFWSFN4BUBFJ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFWSFN4BUBFJAHH6","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFWSFN4B","created_at":"2026-05-18T12:32:16.446611+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/CFWSFN4BUBFJAHH643ETPJWPSH","json":"https://pith.science/pith/CFWSFN4BUBFJAHH643ETPJWPSH.json","graph_json":"https://pith.science/api/pith-number/CFWSFN4BUBFJAHH643ETPJWPSH/graph.json","events_json":"https://pith.science/api/pith-number/CFWSFN4BUBFJAHH643ETPJWPSH/events.json","paper":"https://pith.science/paper/CFWSFN4B"},"agent_actions":{"view_html":"https://pith.science/pith/CFWSFN4BUBFJAHH643ETPJWPSH","download_json":"https://pith.science/pith/CFWSFN4BUBFJAHH643ETPJWPSH.json","view_paper":"https://pith.science/paper/CFWSFN4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08161&json=true","fetch_graph":"https://pith.science/api/pith-number/CFWSFN4BUBFJAHH643ETPJWPSH/graph.json","fetch_events":"https://pith.science/api/pith-number/CFWSFN4BUBFJAHH643ETPJWPSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFWSFN4BUBFJAHH643ETPJWPSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFWSFN4BUBFJAHH643ETPJWPSH/action/storage_attestation","attest_author":"https://pith.science/pith/CFWSFN4BUBFJAHH643ETPJWPSH/action/author_attestation","sign_citation":"https://pith.science/pith/CFWSFN4BUBFJAHH643ETPJWPSH/action/citation_signature","submit_replication":"https://pith.science/pith/CFWSFN4BUBFJAHH643ETPJWPSH/action/replication_record"}},"created_at":"2026-05-18T00:02:50.417019+00:00","updated_at":"2026-05-18T00:02:50.417019+00:00"}