{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S5QKLNK74QH2EYDLIBBHCST5KJ","short_pith_number":"pith:S5QKLNK7","schema_version":"1.0","canonical_sha256":"9760a5b55fe40fa2606b4042714a7d524feebe34525892ea003b02848b88605e","source":{"kind":"arxiv","id":"1811.07358","version":1},"attestation_state":"computed","paper":{"title":"Shannon meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Ankur A. Kulkarni, Sharu Theresa Jose","submitted_at":"2018-11-18T17:15:36Z","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 "},"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.07358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-18T17:15:36Z","cross_cats_sorted":["cs.GT","cs.SY","math.IT"],"title_canon_sha256":"20a4cea2ae5be21dff8302fe9ef5ef5457ab9b5972f60fcfc8f62cd456a084c4","abstract_canon_sha256":"cbdbcde2558bd997ee09e4b039af9d9e310ceed649a5f22169cbb7438facfa88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:24.753993Z","signature_b64":"8rzbrWicDzeA+juVpE0yDvcpgmsY4XR14WnqZFQ5E1JJsO4dQPvb8ioL7u1sgeU6rib4uOevmY58Q/qp742LDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9760a5b55fe40fa2606b4042714a7d524feebe34525892ea003b02848b88605e","last_reissued_at":"2026-05-18T00:00:24.753529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:24.753529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shannon meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Ankur A. Kulkarni, Sharu Theresa Jose","submitted_at":"2018-11-18T17:15:36Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07358","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.07358","created_at":"2026-05-18T00:00:24.753603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07358v1","created_at":"2026-05-18T00:00:24.753603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07358","created_at":"2026-05-18T00:00:24.753603+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5QKLNK74QH2","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5QKLNK74QH2EYDL","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5QKLNK7","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05324","citing_title":"Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an AVC","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S5QKLNK74QH2EYDLIBBHCST5KJ","json":"https://pith.science/pith/S5QKLNK74QH2EYDLIBBHCST5KJ.json","graph_json":"https://pith.science/api/pith-number/S5QKLNK74QH2EYDLIBBHCST5KJ/graph.json","events_json":"https://pith.science/api/pith-number/S5QKLNK74QH2EYDLIBBHCST5KJ/events.json","paper":"https://pith.science/paper/S5QKLNK7"},"agent_actions":{"view_html":"https://pith.science/pith/S5QKLNK74QH2EYDLIBBHCST5KJ","download_json":"https://pith.science/pith/S5QKLNK74QH2EYDLIBBHCST5KJ.json","view_paper":"https://pith.science/paper/S5QKLNK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07358&json=true","fetch_graph":"https://pith.science/api/pith-number/S5QKLNK74QH2EYDLIBBHCST5KJ/graph.json","fetch_events":"https://pith.science/api/pith-number/S5QKLNK74QH2EYDLIBBHCST5KJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5QKLNK74QH2EYDLIBBHCST5KJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5QKLNK74QH2EYDLIBBHCST5KJ/action/storage_attestation","attest_author":"https://pith.science/pith/S5QKLNK74QH2EYDLIBBHCST5KJ/action/author_attestation","sign_citation":"https://pith.science/pith/S5QKLNK74QH2EYDLIBBHCST5KJ/action/citation_signature","submit_replication":"https://pith.science/pith/S5QKLNK74QH2EYDLIBBHCST5KJ/action/replication_record"}},"created_at":"2026-05-18T00:00:24.753603+00:00","updated_at":"2026-05-18T00:00:24.753603+00:00"}