{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S5QKLNK74QH2EYDLIBBHCST5KJ","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":"cbdbcde2558bd997ee09e4b039af9d9e310ceed649a5f22169cbb7438facfa88","cross_cats_sorted":["cs.GT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-18T17:15:36Z","title_canon_sha256":"20a4cea2ae5be21dff8302fe9ef5ef5457ab9b5972f60fcfc8f62cd456a084c4"},"schema_version":"1.0","source":{"id":"1811.07358","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07358","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07358v1","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07358","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"S5QKLNK74QH2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S5QKLNK74QH2EYDL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S5QKLNK7","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:d8c1ec03a81c742bcfa42576b2686b307dc108bba0d2bc8f3f0b4f18c8b156ec","target":"graph","created_at":"2026-05-18T00:00:24Z","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 study the setting of channel coding over a family of channels whose state is controlled by an adversarial jammer by viewing it as a zero-sum game between a finite blocklength encoder-decoder team, and the jammer. The encoder-decoder team choose stochastic encoding and decoding strategies to minimize the average probability of error in transmission, while the jammer chooses a distribution on the state-space to maximize this probability. The min-max value of this game is equivalent to channel coding for a compound channel -- we call this the Shannon solution of the problem. The max-min value ","authors_text":"Ankur A. Kulkarni, Sharu Theresa Jose","cross_cats":["cs.GT","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-18T17:15:36Z","title":"Shannon meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07358","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:198c2cf0cf948d2836d16dfebbca433de016ff26397aef9e484c147d4418e807","target":"record","created_at":"2026-05-18T00:00:24Z","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":"cbdbcde2558bd997ee09e4b039af9d9e310ceed649a5f22169cbb7438facfa88","cross_cats_sorted":["cs.GT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-18T17:15:36Z","title_canon_sha256":"20a4cea2ae5be21dff8302fe9ef5ef5457ab9b5972f60fcfc8f62cd456a084c4"},"schema_version":"1.0","source":{"id":"1811.07358","kind":"arxiv","version":1}},"canonical_sha256":"9760a5b55fe40fa2606b4042714a7d524feebe34525892ea003b02848b88605e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9760a5b55fe40fa2606b4042714a7d524feebe34525892ea003b02848b88605e","first_computed_at":"2026-05-18T00:00:24.753529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:24.753529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8rzbrWicDzeA+juVpE0yDvcpgmsY4XR14WnqZFQ5E1JJsO4dQPvb8ioL7u1sgeU6rib4uOevmY58Q/qp742LDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:24.753993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07358","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:198c2cf0cf948d2836d16dfebbca433de016ff26397aef9e484c147d4418e807","sha256:d8c1ec03a81c742bcfa42576b2686b307dc108bba0d2bc8f3f0b4f18c8b156ec"],"state_sha256":"47668fa412845cdcc8fc4d509bf20eb2a74cdd1291a9fe151023fdd1e75ad6ce"}