{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N4MS3ATJU3DYQUV67DHMKAF2UW","short_pith_number":"pith:N4MS3ATJ","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"},"canonical_sha256":"6f192d8269a6c78852bef8cec500baa595fee96ad7e325566b98a518b0c366ff","source":{"kind":"arxiv","id":"1811.01354","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01354","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01354v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01354","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"N4MS3ATJU3DY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N4MS3ATJU3DYQUV6","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N4MS3ATJ","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N4MS3ATJU3DYQUV67DHMKAF2UW","target":"record","payload":{"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"},"canonical_sha256":"6f192d8269a6c78852bef8cec500baa595fee96ad7e325566b98a518b0c366ff","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"},"source_kind":"arxiv","source_id":"1811.01354","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnZyNqAJV5vjPa+wIVlwNe59O/1WY6i0raFCde++g8QWFzkqNvnNRoQDG8RTVax4B0e3jfSnHyRHOVsuMRXIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:27:43.422520Z"},"content_sha256":"2dd6579c685b6a3caea08ba99c258a16db0fccac96a4268696edf403b2f4f276","schema_version":"1.0","event_id":"sha256:2dd6579c685b6a3caea08ba99c258a16db0fccac96a4268696edf403b2f4f276"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N4MS3ATJU3DYQUV67DHMKAF2UW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gzdoUgVD5RSP7HEiEzEuEmieZ4Jk+Qx9q3gwNqKn63aPKpaVeC0HKlQI3RvHThs7Ch1MamDwNz8pIiWNsQVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:27:43.422862Z"},"content_sha256":"a87df1436ef7ef7abc4f4ca9a02909fe94607c2729d079b09d7662f74432504a","schema_version":"1.0","event_id":"sha256:a87df1436ef7ef7abc4f4ca9a02909fe94607c2729d079b09d7662f74432504a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW/bundle.json","state_url":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4MS3ATJU3DYQUV67DHMKAF2UW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T15:27:43Z","links":{"resolver":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW","bundle":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW/bundle.json","state":"https://pith.science/pith/N4MS3ATJU3DYQUV67DHMKAF2UW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4MS3ATJU3DYQUV67DHMKAF2UW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N4MS3ATJU3DYQUV67DHMKAF2UW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4094f11d862ea470f4fd8be1bdd4db90c48dcef199e16ccca0a9be7a8672bc12","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-04T11:59:25Z","title_canon_sha256":"0cbfc18a0572643bd3912f9110ccfa40f5911a67f0f5db5faf3f79bcc356ecbd"},"schema_version":"1.0","source":{"id":"1811.01354","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01354","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01354v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01354","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"N4MS3ATJU3DY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N4MS3ATJU3DYQUV6","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N4MS3ATJ","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:a87df1436ef7ef7abc4f4ca9a02909fe94607c2729d079b09d7662f74432504a","target":"graph","created_at":"2026-05-18T00:01:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ram Zamir, Sergey Tridenski","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-04T11:59:25Z","title":"Channel input adaptation via natural type selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01354","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2dd6579c685b6a3caea08ba99c258a16db0fccac96a4268696edf403b2f4f276","target":"record","created_at":"2026-05-18T00:01:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4094f11d862ea470f4fd8be1bdd4db90c48dcef199e16ccca0a9be7a8672bc12","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-04T11:59:25Z","title_canon_sha256":"0cbfc18a0572643bd3912f9110ccfa40f5911a67f0f5db5faf3f79bcc356ecbd"},"schema_version":"1.0","source":{"id":"1811.01354","kind":"arxiv","version":1}},"canonical_sha256":"6f192d8269a6c78852bef8cec500baa595fee96ad7e325566b98a518b0c366ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f192d8269a6c78852bef8cec500baa595fee96ad7e325566b98a518b0c366ff","first_computed_at":"2026-05-18T00:01:34.535818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:34.535818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uvfko5zhit5vsquHzyESwyEqvuJBxRVGMcw1fVCtWkEh+mvKL52lYj9isxve2jcEytdMVK/nxztrEcVRlQQYCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:34.536405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01354","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dd6579c685b6a3caea08ba99c258a16db0fccac96a4268696edf403b2f4f276","sha256:a87df1436ef7ef7abc4f4ca9a02909fe94607c2729d079b09d7662f74432504a"],"state_sha256":"6b1519f3e433b7f8f300426d65371e20af22fb236145a0b240eedf271cffca95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEAsNHfzxj/ruiwpkCqRGuVG/lA/3rd79QxS7eRPV/iYQszYzelieUdNodOKosR3uUBfrNFRTDUpe5FvSFGcAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T15:27:43.424793Z","bundle_sha256":"95ca9b4dc65720938e5af435875d7a275412cc6e2aa46ca9725620ef67a4a153"}}