{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YWEGIPOJLA4PVWXEW3UKDIUSTX","short_pith_number":"pith:YWEGIPOJ","canonical_record":{"source":{"id":"1303.3049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-12T22:24:27Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"fac987e39da18d19188c36035bd996a86946f43d39545f7ffcfe9cf13c29a797","abstract_canon_sha256":"41da0f8d400036849544af3e7680abdd23b93dca20cec2853ffbfdd0c399a9e3"},"schema_version":"1.0"},"canonical_sha256":"c588643dc95838fadae4b6e8a1a2929dc9564e44476c66e577df3241bb569813","source":{"kind":"arxiv","id":"1303.3049","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3049","created_at":"2026-05-18T03:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3049v1","created_at":"2026-05-18T03:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3049","created_at":"2026-05-18T03:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"YWEGIPOJLA4P","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YWEGIPOJLA4PVWXE","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YWEGIPOJ","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YWEGIPOJLA4PVWXEW3UKDIUSTX","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-12T22:24:27Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"fac987e39da18d19188c36035bd996a86946f43d39545f7ffcfe9cf13c29a797","abstract_canon_sha256":"41da0f8d400036849544af3e7680abdd23b93dca20cec2853ffbfdd0c399a9e3"},"schema_version":"1.0"},"canonical_sha256":"c588643dc95838fadae4b6e8a1a2929dc9564e44476c66e577df3241bb569813","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:05.936616Z","signature_b64":"YZt4yRnFiCdcaLwIVtfdkcutJJq6DbfAFDQiTc6Tzkf0IaaKIWaHlX1vf5KEbwH1g3KvkfyeJHH1NOiXA8WxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c588643dc95838fadae4b6e8a1a2929dc9564e44476c66e577df3241bb569813","last_reissued_at":"2026-05-18T03:31:05.935594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:05.935594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3049","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-18T03:31:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qcMZ6MytGlmPesIpkQJsLI8L9K/2lWWyUjYsUGJQviBkX76vBf0PlZ7kv9CZOs8bE2fmFcJgCQhV8fxivB92Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:39:41.888153Z"},"content_sha256":"c53016b2a46eed2da752ed90d3a7e9780ec9cb29dfcba2ad1ac281753c252899","schema_version":"1.0","event_id":"sha256:c53016b2a46eed2da752ed90d3a7e9780ec9cb29dfcba2ad1ac281753c252899"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YWEGIPOJLA4PVWXEW3UKDIUSTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimal Jamming Over an Additive Noise Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"Emrah Akyol, Kenneth Rose, Tamer Basar","submitted_at":"2013-03-12T22:24:27Z","abstract_excerpt":"This paper considers the problem of optimal zero-delay jamming over an additive noise channel. Early work had already solved this problem for a Gaussian source and channel. Building on a sequence of recent results on conditions for linearity of optimal estimation, and of optimal mappings in source-channel coding, we derive the saddle-point solution to the jamming problem for general sources and channels, without recourse to Gaussian assumptions. We show that linearity conditions play a pivotal role in jamming, in the sense that the optimal jamming strategy is to effectively force both transmit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3049","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-18T03:31:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N44eknWm7cpa4jABgzjYeRjI3mkzHhVQDaQUB3kCoalM8qAoviEVY/cKH2Ca8l3xs6UZ9MAsvmxDgcVHqXsjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:39:41.888587Z"},"content_sha256":"c93f2061410bff01b45de33c92732a32c239806e76ed4b881954f9c755616915","schema_version":"1.0","event_id":"sha256:c93f2061410bff01b45de33c92732a32c239806e76ed4b881954f9c755616915"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWEGIPOJLA4PVWXEW3UKDIUSTX/bundle.json","state_url":"https://pith.science/pith/YWEGIPOJLA4PVWXEW3UKDIUSTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWEGIPOJLA4PVWXEW3UKDIUSTX/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-05-31T15:39:41Z","links":{"resolver":"https://pith.science/pith/YWEGIPOJLA4PVWXEW3UKDIUSTX","bundle":"https://pith.science/pith/YWEGIPOJLA4PVWXEW3UKDIUSTX/bundle.json","state":"https://pith.science/pith/YWEGIPOJLA4PVWXEW3UKDIUSTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWEGIPOJLA4PVWXEW3UKDIUSTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YWEGIPOJLA4PVWXEW3UKDIUSTX","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":"41da0f8d400036849544af3e7680abdd23b93dca20cec2853ffbfdd0c399a9e3","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-12T22:24:27Z","title_canon_sha256":"fac987e39da18d19188c36035bd996a86946f43d39545f7ffcfe9cf13c29a797"},"schema_version":"1.0","source":{"id":"1303.3049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3049","created_at":"2026-05-18T03:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3049v1","created_at":"2026-05-18T03:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3049","created_at":"2026-05-18T03:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"YWEGIPOJLA4P","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YWEGIPOJLA4PVWXE","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YWEGIPOJ","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:c93f2061410bff01b45de33c92732a32c239806e76ed4b881954f9c755616915","target":"graph","created_at":"2026-05-18T03:31:05Z","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":"This paper considers the problem of optimal zero-delay jamming over an additive noise channel. Early work had already solved this problem for a Gaussian source and channel. Building on a sequence of recent results on conditions for linearity of optimal estimation, and of optimal mappings in source-channel coding, we derive the saddle-point solution to the jamming problem for general sources and channels, without recourse to Gaussian assumptions. We show that linearity conditions play a pivotal role in jamming, in the sense that the optimal jamming strategy is to effectively force both transmit","authors_text":"Emrah Akyol, Kenneth Rose, Tamer Basar","cross_cats":["cs.IT","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-12T22:24:27Z","title":"On Optimal Jamming Over an Additive Noise Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3049","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:c53016b2a46eed2da752ed90d3a7e9780ec9cb29dfcba2ad1ac281753c252899","target":"record","created_at":"2026-05-18T03:31:05Z","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":"41da0f8d400036849544af3e7680abdd23b93dca20cec2853ffbfdd0c399a9e3","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-12T22:24:27Z","title_canon_sha256":"fac987e39da18d19188c36035bd996a86946f43d39545f7ffcfe9cf13c29a797"},"schema_version":"1.0","source":{"id":"1303.3049","kind":"arxiv","version":1}},"canonical_sha256":"c588643dc95838fadae4b6e8a1a2929dc9564e44476c66e577df3241bb569813","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c588643dc95838fadae4b6e8a1a2929dc9564e44476c66e577df3241bb569813","first_computed_at":"2026-05-18T03:31:05.935594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:05.935594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YZt4yRnFiCdcaLwIVtfdkcutJJq6DbfAFDQiTc6Tzkf0IaaKIWaHlX1vf5KEbwH1g3KvkfyeJHH1NOiXA8WxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:05.936616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c53016b2a46eed2da752ed90d3a7e9780ec9cb29dfcba2ad1ac281753c252899","sha256:c93f2061410bff01b45de33c92732a32c239806e76ed4b881954f9c755616915"],"state_sha256":"e1316ebfc91ab372c8327b0452a28414340f518e556aafc1c76a79e3a6877382"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5GHPkRkV0ldLCXQc2hqEKMstSF/GsJ4Npas9yfP4cB2LTDpvPjs3SysbBxJVDLirqjWahFNggiEIF6eU83kAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:39:41.891094Z","bundle_sha256":"1f946351093d9e257db5ab899d0e436ebaefeda4d3a74be32ca0a65ab7e777ad"}}