{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N4MS3ATJU3DYQUV67DHMKAF2UW","short_pith_number":"pith:N4MS3ATJ","schema_version":"1.0","canonical_sha256":"6f192d8269a6c78852bef8cec500baa595fee96ad7e325566b98a518b0c366ff","source":{"kind":"arxiv","id":"1811.01354","version":1},"attestation_state":"computed","paper":{"title":"Channel input adaptation via natural type selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ram Zamir, Sergey Tridenski","submitted_at":"2018-11-04T11:59:25Z","abstract_excerpt":"We consider a channel-independent decoder which is for i.i.d. random codes what the maximum mutual-information decoder is for constant composition codes. We show that this decoder results in exactly the same i.i.d. random coding error exponent and almost the same correct-decoding exponent for a given codebook distribution as the maximum-likelihood decoder. We propose an algorithm for computation of the optimal correct-decoding exponent which operates on the corresponding expression for the channel-independent decoder. The proposed algorithm comes in two versions: computation at a fixed rate an"},"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":"1811.01354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-04T11:59:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0cbfc18a0572643bd3912f9110ccfa40f5911a67f0f5db5faf3f79bcc356ecbd","abstract_canon_sha256":"4094f11d862ea470f4fd8be1bdd4db90c48dcef199e16ccca0a9be7a8672bc12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.536405Z","signature_b64":"uvfko5zhit5vsquHzyESwyEqvuJBxRVGMcw1fVCtWkEh+mvKL52lYj9isxve2jcEytdMVK/nxztrEcVRlQQYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f192d8269a6c78852bef8cec500baa595fee96ad7e325566b98a518b0c366ff","last_reissued_at":"2026-05-18T00:01:34.535818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.535818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Channel input adaptation via natural type selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ram Zamir, Sergey Tridenski","submitted_at":"2018-11-04T11:59:25Z","abstract_excerpt":"We consider a channel-independent decoder which is for i.i.d. random codes what the maximum mutual-information decoder is for constant composition codes. We show that this decoder results in exactly the same i.i.d. random coding error exponent and almost the same correct-decoding exponent for a given codebook distribution as the maximum-likelihood decoder. We propose an algorithm for computation of the optimal correct-decoding exponent which operates on the corresponding expression for the channel-independent decoder. The proposed algorithm comes in two versions: computation at a fixed rate an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01354","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":"1811.01354","created_at":"2026-05-18T00:01:34.535911+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01354v1","created_at":"2026-05-18T00:01:34.535911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01354","created_at":"2026-05-18T00:01:34.535911+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4MS3ATJU3DY","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4MS3ATJU3DYQUV6","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4MS3ATJ","created_at":"2026-05-18T12:32:40.477152+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/N4MS3ATJU3DYQUV67DHMKAF2UW","json":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW.json","graph_json":"https://pith.science/api/pith-number/N4MS3ATJU3DYQUV67DHMKAF2UW/graph.json","events_json":"https://pith.science/api/pith-number/N4MS3ATJU3DYQUV67DHMKAF2UW/events.json","paper":"https://pith.science/paper/N4MS3ATJ"},"agent_actions":{"view_html":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW","download_json":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW.json","view_paper":"https://pith.science/paper/N4MS3ATJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01354&json=true","fetch_graph":"https://pith.science/api/pith-number/N4MS3ATJU3DYQUV67DHMKAF2UW/graph.json","fetch_events":"https://pith.science/api/pith-number/N4MS3ATJU3DYQUV67DHMKAF2UW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW/action/storage_attestation","attest_author":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW/action/author_attestation","sign_citation":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW/action/citation_signature","submit_replication":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW/action/replication_record"}},"created_at":"2026-05-18T00:01:34.535911+00:00","updated_at":"2026-05-18T00:01:34.535911+00:00"}