{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MOH5SJF5SZJTOA54AFNM35NF6F","short_pith_number":"pith:MOH5SJF5","schema_version":"1.0","canonical_sha256":"638fd924bd96533703bc015acdf5a5f17ab73cff5f1c84e65b1b179e0d197342","source":{"kind":"arxiv","id":"1802.08396","version":1},"attestation_state":"computed","paper":{"title":"Bounds on the Zero-Error List-Decoding Capacity of the $q/(q-1)$ Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jaikumar Radhakrishnan, Siddharth Bhandari","submitted_at":"2018-02-23T05:40:44Z","abstract_excerpt":"We consider the problem of determining the zero-error list-decoding capacity of the $q/(q-1)$ channel studied by Elias (1988). The $q/(q-1)$ channel has input and output alphabet consisting of $q$ symbols, say, $Q = \\{x_1,x_2,\\ldots, x_q\\}$; when the channel receives an input $x \\in Q$, it outputs a symbol other than $x$ itself. Let $n(m,q,\\ell)$ be the smallest $n$ for which there is a code $C \\subseteq Q^n$ of $m$ elements such that for every list $w_1, w_2, \\ldots, w_{\\ell+1}$ of distinct code-words from $C$, there is a coordinate $j \\in [n]$ that satisfies $\\{w_1[j], w_2[j], \\ldots, w_{\\el"},"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":"1802.08396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-23T05:40:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28313730698d2bff8bb7be816940efa2f711713a1656bda4f059eab8e5578202","abstract_canon_sha256":"8ca47cfe109f0d822b44ec1587b649b45b63d4fe744103ce62258afd3b545ec2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:43.830158Z","signature_b64":"VqUJwN/E9KaUb5txLp1GuDLhVgcvXCUuL8W5n+His7GPRreUbt1i+r6nb9WMzwfaYgUZckU88xnpDUMBNscAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"638fd924bd96533703bc015acdf5a5f17ab73cff5f1c84e65b1b179e0d197342","last_reissued_at":"2026-05-18T00:22:43.829728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:43.829728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the Zero-Error List-Decoding Capacity of the $q/(q-1)$ Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jaikumar Radhakrishnan, Siddharth Bhandari","submitted_at":"2018-02-23T05:40:44Z","abstract_excerpt":"We consider the problem of determining the zero-error list-decoding capacity of the $q/(q-1)$ channel studied by Elias (1988). The $q/(q-1)$ channel has input and output alphabet consisting of $q$ symbols, say, $Q = \\{x_1,x_2,\\ldots, x_q\\}$; when the channel receives an input $x \\in Q$, it outputs a symbol other than $x$ itself. Let $n(m,q,\\ell)$ be the smallest $n$ for which there is a code $C \\subseteq Q^n$ of $m$ elements such that for every list $w_1, w_2, \\ldots, w_{\\ell+1}$ of distinct code-words from $C$, there is a coordinate $j \\in [n]$ that satisfies $\\{w_1[j], w_2[j], \\ldots, w_{\\el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08396","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":"1802.08396","created_at":"2026-05-18T00:22:43.829791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08396v1","created_at":"2026-05-18T00:22:43.829791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08396","created_at":"2026-05-18T00:22:43.829791+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOH5SJF5SZJT","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOH5SJF5SZJTOA54","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOH5SJF5","created_at":"2026-05-18T12:32:37.024351+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/MOH5SJF5SZJTOA54AFNM35NF6F","json":"https://pith.science/pith/MOH5SJF5SZJTOA54AFNM35NF6F.json","graph_json":"https://pith.science/api/pith-number/MOH5SJF5SZJTOA54AFNM35NF6F/graph.json","events_json":"https://pith.science/api/pith-number/MOH5SJF5SZJTOA54AFNM35NF6F/events.json","paper":"https://pith.science/paper/MOH5SJF5"},"agent_actions":{"view_html":"https://pith.science/pith/MOH5SJF5SZJTOA54AFNM35NF6F","download_json":"https://pith.science/pith/MOH5SJF5SZJTOA54AFNM35NF6F.json","view_paper":"https://pith.science/paper/MOH5SJF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08396&json=true","fetch_graph":"https://pith.science/api/pith-number/MOH5SJF5SZJTOA54AFNM35NF6F/graph.json","fetch_events":"https://pith.science/api/pith-number/MOH5SJF5SZJTOA54AFNM35NF6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOH5SJF5SZJTOA54AFNM35NF6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOH5SJF5SZJTOA54AFNM35NF6F/action/storage_attestation","attest_author":"https://pith.science/pith/MOH5SJF5SZJTOA54AFNM35NF6F/action/author_attestation","sign_citation":"https://pith.science/pith/MOH5SJF5SZJTOA54AFNM35NF6F/action/citation_signature","submit_replication":"https://pith.science/pith/MOH5SJF5SZJTOA54AFNM35NF6F/action/replication_record"}},"created_at":"2026-05-18T00:22:43.829791+00:00","updated_at":"2026-05-18T00:22:43.829791+00:00"}