{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MAG3PNLDOVXYWPPRVETPU7UOME","short_pith_number":"pith:MAG3PNLD","canonical_record":{"source":{"id":"1204.2587","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-11T22:50:03Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"f1d9e2a3a077a4efce8acf545c4a603fa890d3e1ac7d1afd65462946c4439e10","abstract_canon_sha256":"978e8fa591825fe3dfeee8cc19aeb7d7f59c0d0799f2584fc1587257d7f47eb3"},"schema_version":"1.0"},"canonical_sha256":"600db7b563756f8b3df1a926fa7e8e6128974ceb6d10e8ecb8d0b03aec396703","source":{"kind":"arxiv","id":"1204.2587","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2587","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2587v3","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2587","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"MAG3PNLDOVXY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MAG3PNLDOVXYWPPR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MAG3PNLD","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MAG3PNLDOVXYWPPRVETPU7UOME","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2587","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-11T22:50:03Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"f1d9e2a3a077a4efce8acf545c4a603fa890d3e1ac7d1afd65462946c4439e10","abstract_canon_sha256":"978e8fa591825fe3dfeee8cc19aeb7d7f59c0d0799f2584fc1587257d7f47eb3"},"schema_version":"1.0"},"canonical_sha256":"600db7b563756f8b3df1a926fa7e8e6128974ceb6d10e8ecb8d0b03aec396703","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.104819Z","signature_b64":"33SVUS5yd0GyimkzoHTHTK+yqb7VM63jySiLbbhsGcLR5n2XJyt1o1WrhDtz0LhNancoj5/HyvlJPrWJapuLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"600db7b563756f8b3df1a926fa7e8e6128974ceb6d10e8ecb8d0b03aec396703","last_reissued_at":"2026-05-18T00:58:43.104387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.104387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2587","source_version":3,"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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpZ8MDiYIdEQdE5kQovs/xZ5iLnmp6T9ZrXt1IpPPHgLWl+brbTh84/CCHjOxyPaLEV1OjdK5n/3nsbcNIWMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:35:04.100796Z"},"content_sha256":"69895b33e3fcc7ddb6f808cdff0fc3bc67c5119a77b0c83c2e6b9d89231abd2c","schema_version":"1.0","event_id":"sha256:69895b33e3fcc7ddb6f808cdff0fc3bc67c5119a77b0c83c2e6b9d89231abd2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MAG3PNLDOVXYWPPRVETPU7UOME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper Bounds on the Capacity of Binary Channels with Causal Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Anand D. Sarwate, Bikash Kumar Dey, Michael Langberg, Sidharth Jaggi","submitted_at":"2012-04-11T22:50:03Z","abstract_excerpt":"In this work we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword $(x_1,...,x_n)$ bit-by-bit over a communication channel. The sender and the receiver do not share common randomness. The adversarial jammer can view the transmitted bits $x_i$ one at a time, and can change up to a $p$-fraction of them. However, the decisions of the jammer must be made in a causal manner. Namely, for each bit $x_i$ the jammer's decision on whether to corrupt it or n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2587","kind":"arxiv","version":3},"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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Li5ZwP2J3PCXZQITlFqYJOWBa4c9XL2E8zD30yPRcp8GduorrspP+jGNIMhh//JnOYyHKyT2RkZxBBEZfYVhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:35:04.101152Z"},"content_sha256":"789156cc138acbdff4c6c35fbd15113369919fe7bd7035766c1e6283c2a5ab97","schema_version":"1.0","event_id":"sha256:789156cc138acbdff4c6c35fbd15113369919fe7bd7035766c1e6283c2a5ab97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAG3PNLDOVXYWPPRVETPU7UOME/bundle.json","state_url":"https://pith.science/pith/MAG3PNLDOVXYWPPRVETPU7UOME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAG3PNLDOVXYWPPRVETPU7UOME/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-28T08:35:04Z","links":{"resolver":"https://pith.science/pith/MAG3PNLDOVXYWPPRVETPU7UOME","bundle":"https://pith.science/pith/MAG3PNLDOVXYWPPRVETPU7UOME/bundle.json","state":"https://pith.science/pith/MAG3PNLDOVXYWPPRVETPU7UOME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAG3PNLDOVXYWPPRVETPU7UOME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MAG3PNLDOVXYWPPRVETPU7UOME","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":"978e8fa591825fe3dfeee8cc19aeb7d7f59c0d0799f2584fc1587257d7f47eb3","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-11T22:50:03Z","title_canon_sha256":"f1d9e2a3a077a4efce8acf545c4a603fa890d3e1ac7d1afd65462946c4439e10"},"schema_version":"1.0","source":{"id":"1204.2587","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2587","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2587v3","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2587","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"MAG3PNLDOVXY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MAG3PNLDOVXYWPPR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MAG3PNLD","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:789156cc138acbdff4c6c35fbd15113369919fe7bd7035766c1e6283c2a5ab97","target":"graph","created_at":"2026-05-18T00:58:43Z","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":"In this work we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword $(x_1,...,x_n)$ bit-by-bit over a communication channel. The sender and the receiver do not share common randomness. The adversarial jammer can view the transmitted bits $x_i$ one at a time, and can change up to a $p$-fraction of them. However, the decisions of the jammer must be made in a causal manner. Namely, for each bit $x_i$ the jammer's decision on whether to corrupt it or n","authors_text":"Anand D. Sarwate, Bikash Kumar Dey, Michael Langberg, Sidharth Jaggi","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-11T22:50:03Z","title":"Upper Bounds on the Capacity of Binary Channels with Causal Adversaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2587","kind":"arxiv","version":3},"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:69895b33e3fcc7ddb6f808cdff0fc3bc67c5119a77b0c83c2e6b9d89231abd2c","target":"record","created_at":"2026-05-18T00:58:43Z","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":"978e8fa591825fe3dfeee8cc19aeb7d7f59c0d0799f2584fc1587257d7f47eb3","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-11T22:50:03Z","title_canon_sha256":"f1d9e2a3a077a4efce8acf545c4a603fa890d3e1ac7d1afd65462946c4439e10"},"schema_version":"1.0","source":{"id":"1204.2587","kind":"arxiv","version":3}},"canonical_sha256":"600db7b563756f8b3df1a926fa7e8e6128974ceb6d10e8ecb8d0b03aec396703","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"600db7b563756f8b3df1a926fa7e8e6128974ceb6d10e8ecb8d0b03aec396703","first_computed_at":"2026-05-18T00:58:43.104387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.104387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"33SVUS5yd0GyimkzoHTHTK+yqb7VM63jySiLbbhsGcLR5n2XJyt1o1WrhDtz0LhNancoj5/HyvlJPrWJapuLAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.104819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2587","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69895b33e3fcc7ddb6f808cdff0fc3bc67c5119a77b0c83c2e6b9d89231abd2c","sha256:789156cc138acbdff4c6c35fbd15113369919fe7bd7035766c1e6283c2a5ab97"],"state_sha256":"a538287f2ae198dd387b51399aaf30c5e7145c6e5fa594945c260139c30ac8de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZZAKgZfx5y4tyy8yg/IN8hd49HeWX2gAwQpppGpUQP/Vqqgoykz8jA4cIIRWunI1LPLKKzhSiq5HpQv5EzQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:35:04.103259Z","bundle_sha256":"023bef1aa9fdee9a12336b333eb25e02c46003de6cf0ee52c21dd589a74a0117"}}