{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L6IJYQQSEQXK3FHMZT227VG3KF","short_pith_number":"pith:L6IJYQQS","canonical_record":{"source":{"id":"1801.06828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-21T14:33:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0cbfc18a0572643bd3912f9110ccfa40f5911a67f0f5db5faf3f79bcc356ecbd","abstract_canon_sha256":"4b8640784d8f8dfd459c07bc9d4423d3c1da2b8eb8f9e73d4e14e64a2bdbd2b7"},"schema_version":"1.0"},"canonical_sha256":"5f909c4212242ead94ecccf5afd4db515bf0e722892ebaf22966c360b189262a","source":{"kind":"arxiv","id":"1801.06828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06828","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06828v1","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06828","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"L6IJYQQSEQXK","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L6IJYQQSEQXK3FHM","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L6IJYQQS","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L6IJYQQSEQXK3FHMZT227VG3KF","target":"record","payload":{"canonical_record":{"source":{"id":"1801.06828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-21T14:33:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0cbfc18a0572643bd3912f9110ccfa40f5911a67f0f5db5faf3f79bcc356ecbd","abstract_canon_sha256":"4b8640784d8f8dfd459c07bc9d4423d3c1da2b8eb8f9e73d4e14e64a2bdbd2b7"},"schema_version":"1.0"},"canonical_sha256":"5f909c4212242ead94ecccf5afd4db515bf0e722892ebaf22966c360b189262a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:27.592329Z","signature_b64":"It+qj3Kac4xkP2hPAYaTYhBWBalPNIJhHiIztFSXg6mVBJ8pFMuP+rcCQ4ipwCyWM01RYgQx+3TGvaw9MaUUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f909c4212242ead94ecccf5afd4db515bf0e722892ebaf22966c360b189262a","last_reissued_at":"2026-05-18T00:25:27.591754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:27.591754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.06828","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:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vz9QyhUAmOnF+1QnrguVwsgrXHczc12oCKvJi7rul1KjNyqf2AXst6IW2yQkwxJaONtVtSJILjXXYuYauSTZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:24:36.529440Z"},"content_sha256":"50bf40b7b0d0e61fee1b390bbe37623eafc364c48bb4e6fcca829ce61f8ad382","schema_version":"1.0","event_id":"sha256:50bf40b7b0d0e61fee1b390bbe37623eafc364c48bb4e6fcca829ce61f8ad382"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L6IJYQQSEQXK3FHMZT227VG3KF","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-01-21T14:33:58Z","abstract_excerpt":"For the model of communication through a discrete memoryless channel using i.i.d. random block codes, where the channel is changing slowly from block to block, we propose a stochastic algorithm for adaptation of the generating distribution of the code in the process of continuous reliable communication. The purpose of the algorithm is to match the generating distribution $Q(x)$ to the changing channel $P(y\\,|\\,x)$, so that reliable communication is maintained at some constant rate $R$. This is achieved by a feedback of one bit per transmitted block. The feedback bit is determined by the joint "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06828","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:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l1qUNiZ4SIDicqzq507j7ttZAcB/hXqyOvx7l5o5cvTL6TsI2oSTPg4WFk1ZB8e4DkifhTQ1HuCzIerEhb4jCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:24:36.529802Z"},"content_sha256":"172899bd57f154c6ae20d8c5e85a5a466a0e1d4967f3ee90ecf3190d05857859","schema_version":"1.0","event_id":"sha256:172899bd57f154c6ae20d8c5e85a5a466a0e1d4967f3ee90ecf3190d05857859"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6IJYQQSEQXK3FHMZT227VG3KF/bundle.json","state_url":"https://pith.science/pith/L6IJYQQSEQXK3FHMZT227VG3KF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6IJYQQSEQXK3FHMZT227VG3KF/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-22T14:24:36Z","links":{"resolver":"https://pith.science/pith/L6IJYQQSEQXK3FHMZT227VG3KF","bundle":"https://pith.science/pith/L6IJYQQSEQXK3FHMZT227VG3KF/bundle.json","state":"https://pith.science/pith/L6IJYQQSEQXK3FHMZT227VG3KF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6IJYQQSEQXK3FHMZT227VG3KF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L6IJYQQSEQXK3FHMZT227VG3KF","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":"4b8640784d8f8dfd459c07bc9d4423d3c1da2b8eb8f9e73d4e14e64a2bdbd2b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-21T14:33:58Z","title_canon_sha256":"0cbfc18a0572643bd3912f9110ccfa40f5911a67f0f5db5faf3f79bcc356ecbd"},"schema_version":"1.0","source":{"id":"1801.06828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06828","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06828v1","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06828","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"L6IJYQQSEQXK","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L6IJYQQSEQXK3FHM","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L6IJYQQS","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:172899bd57f154c6ae20d8c5e85a5a466a0e1d4967f3ee90ecf3190d05857859","target":"graph","created_at":"2026-05-18T00:25:27Z","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":"For the model of communication through a discrete memoryless channel using i.i.d. random block codes, where the channel is changing slowly from block to block, we propose a stochastic algorithm for adaptation of the generating distribution of the code in the process of continuous reliable communication. The purpose of the algorithm is to match the generating distribution $Q(x)$ to the changing channel $P(y\\,|\\,x)$, so that reliable communication is maintained at some constant rate $R$. This is achieved by a feedback of one bit per transmitted block. The feedback bit is determined by the joint ","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-01-21T14:33:58Z","title":"Channel Input Adaptation via Natural Type Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06828","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:50bf40b7b0d0e61fee1b390bbe37623eafc364c48bb4e6fcca829ce61f8ad382","target":"record","created_at":"2026-05-18T00:25:27Z","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":"4b8640784d8f8dfd459c07bc9d4423d3c1da2b8eb8f9e73d4e14e64a2bdbd2b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-21T14:33:58Z","title_canon_sha256":"0cbfc18a0572643bd3912f9110ccfa40f5911a67f0f5db5faf3f79bcc356ecbd"},"schema_version":"1.0","source":{"id":"1801.06828","kind":"arxiv","version":1}},"canonical_sha256":"5f909c4212242ead94ecccf5afd4db515bf0e722892ebaf22966c360b189262a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f909c4212242ead94ecccf5afd4db515bf0e722892ebaf22966c360b189262a","first_computed_at":"2026-05-18T00:25:27.591754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:27.591754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"It+qj3Kac4xkP2hPAYaTYhBWBalPNIJhHiIztFSXg6mVBJ8pFMuP+rcCQ4ipwCyWM01RYgQx+3TGvaw9MaUUAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:27.592329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50bf40b7b0d0e61fee1b390bbe37623eafc364c48bb4e6fcca829ce61f8ad382","sha256:172899bd57f154c6ae20d8c5e85a5a466a0e1d4967f3ee90ecf3190d05857859"],"state_sha256":"0c445456219f718f5455b99e6443d133a1680dc6e26cce774536d6d71868b6ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZzZr5ha+LqnUvopZac5LhinERKEjlubfU0dbZ/2NPvvzG1dLkM+Sar1LsptN27lXGqwo1G20dELCKd6h5XkBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:24:36.531808Z","bundle_sha256":"5612bd25562b2ff61b2050d3f3c721f2e08d652eef4fc9b426e5bd024efee04e"}}