{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FJCL6RENY36DEHZ7IH3OFW24XY","short_pith_number":"pith:FJCL6REN","canonical_record":{"source":{"id":"1602.02384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T15:34:36Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"a71ec9145370cabf8739a4ab8c9f96cf188576742fe5e412b594f4945ed35391","abstract_canon_sha256":"102a29d77f33f6fb25b6e127c773bddbf29db988a95447ecc6a1cef343392d85"},"schema_version":"1.0"},"canonical_sha256":"2a44bf448dc6fc321f3f41f6e2db5cbe373e4164aa103ec50d1e80914adf7d32","source":{"kind":"arxiv","id":"1602.02384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02384","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02384v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02384","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"FJCL6RENY36D","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJCL6RENY36DEHZ7","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJCL6REN","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FJCL6RENY36DEHZ7IH3OFW24XY","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T15:34:36Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"a71ec9145370cabf8739a4ab8c9f96cf188576742fe5e412b594f4945ed35391","abstract_canon_sha256":"102a29d77f33f6fb25b6e127c773bddbf29db988a95447ecc6a1cef343392d85"},"schema_version":"1.0"},"canonical_sha256":"2a44bf448dc6fc321f3f41f6e2db5cbe373e4164aa103ec50d1e80914adf7d32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:10.159094Z","signature_b64":"h1zCvsRe1fI0HexOw1BnkEczTIptosfluaEJFIkQBkZkNUNOuB1JLXDwqVPqKf9OtGwdhXgay0rXGHVuQHBQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a44bf448dc6fc321f3f41f6e2db5cbe373e4164aa103ec50d1e80914adf7d32","last_reissued_at":"2026-05-18T01:21:10.158423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:10.158423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02384","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-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+7bYsfkj4R1YakvLaYumutK07HrKh3qJLxNCdTebcmLR74o0vrBPo8P29fDZbMWnMfg8I3ct28wxtxkZkdAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:27:49.940407Z"},"content_sha256":"2b677a985f0d991745ea1b0f11828048a25d27e0013cce07fe64f1005eba822e","schema_version":"1.0","event_id":"sha256:2b677a985f0d991745ea1b0f11828048a25d27e0013cce07fe64f1005eba822e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FJCL6RENY36DEHZ7IH3OFW24XY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The benefit of a 1-bit jump-start, and the necessity of stochastic encoding, in jamming channels","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":"2016-02-07T15:34:36Z","abstract_excerpt":"We consider the problem of communicating a message $m$ in the presence of a malicious jamming adversary (Calvin), who can erase an arbitrary set of up to $pn$ bits, out of $n$ transmitted bits $(x_1,\\ldots,x_n)$. The capacity of such a channel when Calvin is exactly causal, i.e. Calvin's decision of whether or not to erase bit $x_i$ depends on his observations $(x_1,\\ldots,x_i)$ was recently characterized to be $1-2p$. In this work we show two (perhaps) surprising phenomena. Firstly, we demonstrate via a novel code construction that if Calvin is delayed by even a single bit, i.e. Calvin's deci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02384","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-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NpuUnxSrXq3gjVXG6Y4bOy8C8FRAg2Hhd2yn/S7xr/mtLVyv3+LJiuZjtnlnmik+0pamAztaUQ/hfS8hOwNdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:27:49.940761Z"},"content_sha256":"2dd362df3f0e5341c804d665bac30a34f9ba628a1b97529985d26a17151fe996","schema_version":"1.0","event_id":"sha256:2dd362df3f0e5341c804d665bac30a34f9ba628a1b97529985d26a17151fe996"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJCL6RENY36DEHZ7IH3OFW24XY/bundle.json","state_url":"https://pith.science/pith/FJCL6RENY36DEHZ7IH3OFW24XY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJCL6RENY36DEHZ7IH3OFW24XY/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-28T10:27:49Z","links":{"resolver":"https://pith.science/pith/FJCL6RENY36DEHZ7IH3OFW24XY","bundle":"https://pith.science/pith/FJCL6RENY36DEHZ7IH3OFW24XY/bundle.json","state":"https://pith.science/pith/FJCL6RENY36DEHZ7IH3OFW24XY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJCL6RENY36DEHZ7IH3OFW24XY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FJCL6RENY36DEHZ7IH3OFW24XY","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":"102a29d77f33f6fb25b6e127c773bddbf29db988a95447ecc6a1cef343392d85","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T15:34:36Z","title_canon_sha256":"a71ec9145370cabf8739a4ab8c9f96cf188576742fe5e412b594f4945ed35391"},"schema_version":"1.0","source":{"id":"1602.02384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02384","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02384v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02384","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"FJCL6RENY36D","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJCL6RENY36DEHZ7","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJCL6REN","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:2dd362df3f0e5341c804d665bac30a34f9ba628a1b97529985d26a17151fe996","target":"graph","created_at":"2026-05-18T01:21:10Z","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 consider the problem of communicating a message $m$ in the presence of a malicious jamming adversary (Calvin), who can erase an arbitrary set of up to $pn$ bits, out of $n$ transmitted bits $(x_1,\\ldots,x_n)$. The capacity of such a channel when Calvin is exactly causal, i.e. Calvin's decision of whether or not to erase bit $x_i$ depends on his observations $(x_1,\\ldots,x_i)$ was recently characterized to be $1-2p$. In this work we show two (perhaps) surprising phenomena. Firstly, we demonstrate via a novel code construction that if Calvin is delayed by even a single bit, i.e. Calvin's deci","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":"2016-02-07T15:34:36Z","title":"The benefit of a 1-bit jump-start, and the necessity of stochastic encoding, in jamming channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02384","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:2b677a985f0d991745ea1b0f11828048a25d27e0013cce07fe64f1005eba822e","target":"record","created_at":"2026-05-18T01:21:10Z","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":"102a29d77f33f6fb25b6e127c773bddbf29db988a95447ecc6a1cef343392d85","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-07T15:34:36Z","title_canon_sha256":"a71ec9145370cabf8739a4ab8c9f96cf188576742fe5e412b594f4945ed35391"},"schema_version":"1.0","source":{"id":"1602.02384","kind":"arxiv","version":1}},"canonical_sha256":"2a44bf448dc6fc321f3f41f6e2db5cbe373e4164aa103ec50d1e80914adf7d32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a44bf448dc6fc321f3f41f6e2db5cbe373e4164aa103ec50d1e80914adf7d32","first_computed_at":"2026-05-18T01:21:10.158423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:10.158423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h1zCvsRe1fI0HexOw1BnkEczTIptosfluaEJFIkQBkZkNUNOuB1JLXDwqVPqKf9OtGwdhXgay0rXGHVuQHBQCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:10.159094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b677a985f0d991745ea1b0f11828048a25d27e0013cce07fe64f1005eba822e","sha256:2dd362df3f0e5341c804d665bac30a34f9ba628a1b97529985d26a17151fe996"],"state_sha256":"b838bfc64e65c956dfab0b5190206dffafcd81bc07c74be13efcce126d70fd6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YSpihvFJLOFjWWdgZbhyJkeCV7GPrXTZ2O3+n/2u8bOnWLO19fliuNxu8wiXRl+nQJG1QMmvXdyxYZf45RZvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:27:49.942774Z","bundle_sha256":"66ff75160abebe2885db6093d72514a335fab1410b47025c127f169972c4b621"}}