{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LBA4PGUJYM2DOJLBLULR2MTU4Z","short_pith_number":"pith:LBA4PGUJ","canonical_record":{"source":{"id":"1409.3893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-13T00:49:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f0effb0048aeba885b95e737c61006a926ea5d498ac8506be9e6959143215ec","abstract_canon_sha256":"e362166ed0e227f9ef5ec63ee2cf63450bbaa9edfe45aa7028e316bdf0143106"},"schema_version":"1.0"},"canonical_sha256":"5841c79a89c3343725615d171d3274e66118632219b65a9ad7bb8a1e696636fc","source":{"kind":"arxiv","id":"1409.3893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3893","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3893v1","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3893","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"LBA4PGUJYM2D","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"LBA4PGUJYM2DOJLB","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"LBA4PGUJ","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LBA4PGUJYM2DOJLBLULR2MTU4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-13T00:49:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f0effb0048aeba885b95e737c61006a926ea5d498ac8506be9e6959143215ec","abstract_canon_sha256":"e362166ed0e227f9ef5ec63ee2cf63450bbaa9edfe45aa7028e316bdf0143106"},"schema_version":"1.0"},"canonical_sha256":"5841c79a89c3343725615d171d3274e66118632219b65a9ad7bb8a1e696636fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:53.436118Z","signature_b64":"aeQxvEvbAl6UsQItWH+nqZcwK1KmG2NwZrpDXEtG/V0OZO1WIZwXcxt7DEWQIw1erV1062a+SIVeL3nlmsxbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5841c79a89c3343725615d171d3274e66118632219b65a9ad7bb8a1e696636fc","last_reissued_at":"2026-05-18T02:42:53.435716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:53.435716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3893","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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8e6Xhg2i52MpZtP6pZxHMrzo5g3/a5QjSi4yRrBf55Oqzj5tyaZshI10sfHsNxt+hLnkUfJw6ev+4xkzkR3PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:01:48.139241Z"},"content_sha256":"bab78588f42ca432ad7f9c6d220173a8ae615da11fc7e4b7826bc94dd4b9184c","schema_version":"1.0","event_id":"sha256:bab78588f42ca432ad7f9c6d220173a8ae615da11fc7e4b7826bc94dd4b9184c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LBA4PGUJYM2DOJLBLULR2MTU4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Causal Erasure Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adam Smith, Raef Bassily","submitted_at":"2014-09-13T00:49:20Z","abstract_excerpt":"We consider the communication problem over binary causal adversarial erasure channels. Such a channel maps $n$ input bits to $n$ output symbols in $\\{0,1,\\wedge\\}$, where $\\wedge$ denotes erasure. The channel is causal if, for every $i$, the channel adversarially decides whether to erase the $i$th bit of its input based on inputs $1,...,i$, before it observes bits $i+1$ to $n$. Such a channel is $p$-bounded if it can erase at most a $p$ fraction of the input bits over the whole transmission duration. Causal channels provide a natural model for channels that obey basic physical restrictions but"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3893","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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVB81X4Ed9/TVJUzXGXcypJJ1Gg/aqqhA/IskxOlphrx1DAPSuFmXJBCAGqepiQYymV4QdIJ9bEX0B2kcvBwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:01:48.139656Z"},"content_sha256":"6d8b6a42c08ee9948a177b2263ceed893b6cd0693be4748c6ab8ddea01991b7c","schema_version":"1.0","event_id":"sha256:6d8b6a42c08ee9948a177b2263ceed893b6cd0693be4748c6ab8ddea01991b7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBA4PGUJYM2DOJLBLULR2MTU4Z/bundle.json","state_url":"https://pith.science/pith/LBA4PGUJYM2DOJLBLULR2MTU4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBA4PGUJYM2DOJLBLULR2MTU4Z/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-25T21:01:48Z","links":{"resolver":"https://pith.science/pith/LBA4PGUJYM2DOJLBLULR2MTU4Z","bundle":"https://pith.science/pith/LBA4PGUJYM2DOJLBLULR2MTU4Z/bundle.json","state":"https://pith.science/pith/LBA4PGUJYM2DOJLBLULR2MTU4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBA4PGUJYM2DOJLBLULR2MTU4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LBA4PGUJYM2DOJLBLULR2MTU4Z","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":"e362166ed0e227f9ef5ec63ee2cf63450bbaa9edfe45aa7028e316bdf0143106","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-13T00:49:20Z","title_canon_sha256":"9f0effb0048aeba885b95e737c61006a926ea5d498ac8506be9e6959143215ec"},"schema_version":"1.0","source":{"id":"1409.3893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3893","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3893v1","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3893","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"LBA4PGUJYM2D","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"LBA4PGUJYM2DOJLB","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"LBA4PGUJ","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:6d8b6a42c08ee9948a177b2263ceed893b6cd0693be4748c6ab8ddea01991b7c","target":"graph","created_at":"2026-05-18T02:42:53Z","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 communication problem over binary causal adversarial erasure channels. Such a channel maps $n$ input bits to $n$ output symbols in $\\{0,1,\\wedge\\}$, where $\\wedge$ denotes erasure. The channel is causal if, for every $i$, the channel adversarially decides whether to erase the $i$th bit of its input based on inputs $1,...,i$, before it observes bits $i+1$ to $n$. Such a channel is $p$-bounded if it can erase at most a $p$ fraction of the input bits over the whole transmission duration. Causal channels provide a natural model for channels that obey basic physical restrictions but","authors_text":"Adam Smith, Raef Bassily","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-13T00:49:20Z","title":"Causal Erasure Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3893","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:bab78588f42ca432ad7f9c6d220173a8ae615da11fc7e4b7826bc94dd4b9184c","target":"record","created_at":"2026-05-18T02:42:53Z","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":"e362166ed0e227f9ef5ec63ee2cf63450bbaa9edfe45aa7028e316bdf0143106","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-13T00:49:20Z","title_canon_sha256":"9f0effb0048aeba885b95e737c61006a926ea5d498ac8506be9e6959143215ec"},"schema_version":"1.0","source":{"id":"1409.3893","kind":"arxiv","version":1}},"canonical_sha256":"5841c79a89c3343725615d171d3274e66118632219b65a9ad7bb8a1e696636fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5841c79a89c3343725615d171d3274e66118632219b65a9ad7bb8a1e696636fc","first_computed_at":"2026-05-18T02:42:53.435716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:53.435716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aeQxvEvbAl6UsQItWH+nqZcwK1KmG2NwZrpDXEtG/V0OZO1WIZwXcxt7DEWQIw1erV1062a+SIVeL3nlmsxbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:53.436118Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bab78588f42ca432ad7f9c6d220173a8ae615da11fc7e4b7826bc94dd4b9184c","sha256:6d8b6a42c08ee9948a177b2263ceed893b6cd0693be4748c6ab8ddea01991b7c"],"state_sha256":"322467c288880d8ac86105251ba0d3da0004808eff8964f886b6854764166c42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oghaeSNbyFEa3v9Rd8Ad6SQl3Tt4dRMjxPdCJuZJAz3dFib4bquOACYBMlDZENqHydLEX/cmx6xD70wTO1HpDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:01:48.143272Z","bundle_sha256":"d4fe288712a267a4b349b266afad57d09470670a7810cde5739c3b988aa97c4e"}}