{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EW2MAY64SF3VHTMVARN7OV6ZHJ","short_pith_number":"pith:EW2MAY64","canonical_record":{"source":{"id":"1412.6376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-19T15:23:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"72e9a2c3f041196bd631b21dd9e22cd42c907f06e201c759cfa8a798c168fde8","abstract_canon_sha256":"45e58b5d879584307b7b434e9058928a957127afc1e74fe663760eb9f4934522"},"schema_version":"1.0"},"canonical_sha256":"25b4c063dc917753cd95045bf757d93a424e881a3517123c771751040f842dbf","source":{"kind":"arxiv","id":"1412.6376","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6376","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6376v1","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6376","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"EW2MAY64SF3V","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EW2MAY64SF3VHTMV","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EW2MAY64","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EW2MAY64SF3VHTMVARN7OV6ZHJ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-19T15:23:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"72e9a2c3f041196bd631b21dd9e22cd42c907f06e201c759cfa8a798c168fde8","abstract_canon_sha256":"45e58b5d879584307b7b434e9058928a957127afc1e74fe663760eb9f4934522"},"schema_version":"1.0"},"canonical_sha256":"25b4c063dc917753cd95045bf757d93a424e881a3517123c771751040f842dbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:53.674164Z","signature_b64":"XAEd4AC1BuHPlQX3RaZkdGOxVHeaAZWsphfLLLplKmkTY/yFAxIbOe7OJG6h+KW+4F9VPuXl2MFtHRZpeLGYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25b4c063dc917753cd95045bf757d93a424e881a3517123c771751040f842dbf","last_reissued_at":"2026-05-18T02:30:53.673541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:53.673541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6376","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:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"doo9Q/Lp8KxsVMsjjsXO7gJX/DXD8nIkx5hOFI+fAayJtKKmCz15e4qwEQO6A9rX8Sc8dn4UXi6Ww43RtJt+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:07:10.124204Z"},"content_sha256":"222050159797f6b99aae21a9b6c046878d6752fee87cbfecab089bc16481d3fe","schema_version":"1.0","event_id":"sha256:222050159797f6b99aae21a9b6c046878d6752fee87cbfecab089bc16481d3fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EW2MAY64SF3VHTMVARN7OV6ZHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A characterization of the capacity of online (causal) binary channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Langberg, Sidharth Jaggi, Zitan Chen","submitted_at":"2014-12-19T15:23:48Z","abstract_excerpt":"In the binary online (or \"causal\") channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword $\\mathbf{x} =(x_1,\\ldots,x_n) \\in \\{0,1\\}^n$ bit by bit via a channel limited to at most $pn$ corruptions. The channel is \"online\" in the sense that at the $i$th step of communication the channel decides whether to corrupt the $i$th bit or not based on its view so far, i.e., its decision depends only on the transmitted bits $(x_1,\\ldots,x_i)$. This is in contrast to the classical adversarial channel in which the error is chosen by a channel that has a full "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6376","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:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ea1lCa1NDGrpC1v3Tifw64R5ALlFdoVndwFcZsFRo23i9h8G2DILJQJoiOSFUJjzMkJExRYIHFPU3RI+RyrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:07:10.124593Z"},"content_sha256":"bfee527265936dfad015c43efee00e81f8cf65e79697c2fbda7940b3fd0c739f","schema_version":"1.0","event_id":"sha256:bfee527265936dfad015c43efee00e81f8cf65e79697c2fbda7940b3fd0c739f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ/bundle.json","state_url":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ/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-28T09:07:10Z","links":{"resolver":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ","bundle":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ/bundle.json","state":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EW2MAY64SF3VHTMVARN7OV6ZHJ","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":"45e58b5d879584307b7b434e9058928a957127afc1e74fe663760eb9f4934522","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-19T15:23:48Z","title_canon_sha256":"72e9a2c3f041196bd631b21dd9e22cd42c907f06e201c759cfa8a798c168fde8"},"schema_version":"1.0","source":{"id":"1412.6376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6376","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6376v1","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6376","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"EW2MAY64SF3V","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EW2MAY64SF3VHTMV","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EW2MAY64","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:bfee527265936dfad015c43efee00e81f8cf65e79697c2fbda7940b3fd0c739f","target":"graph","created_at":"2026-05-18T02:30: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":"In the binary online (or \"causal\") channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword $\\mathbf{x} =(x_1,\\ldots,x_n) \\in \\{0,1\\}^n$ bit by bit via a channel limited to at most $pn$ corruptions. The channel is \"online\" in the sense that at the $i$th step of communication the channel decides whether to corrupt the $i$th bit or not based on its view so far, i.e., its decision depends only on the transmitted bits $(x_1,\\ldots,x_i)$. This is in contrast to the classical adversarial channel in which the error is chosen by a channel that has a full ","authors_text":"Michael Langberg, Sidharth Jaggi, Zitan Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-19T15:23:48Z","title":"A characterization of the capacity of online (causal) binary channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6376","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:222050159797f6b99aae21a9b6c046878d6752fee87cbfecab089bc16481d3fe","target":"record","created_at":"2026-05-18T02:30: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":"45e58b5d879584307b7b434e9058928a957127afc1e74fe663760eb9f4934522","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-19T15:23:48Z","title_canon_sha256":"72e9a2c3f041196bd631b21dd9e22cd42c907f06e201c759cfa8a798c168fde8"},"schema_version":"1.0","source":{"id":"1412.6376","kind":"arxiv","version":1}},"canonical_sha256":"25b4c063dc917753cd95045bf757d93a424e881a3517123c771751040f842dbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25b4c063dc917753cd95045bf757d93a424e881a3517123c771751040f842dbf","first_computed_at":"2026-05-18T02:30:53.673541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:53.673541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XAEd4AC1BuHPlQX3RaZkdGOxVHeaAZWsphfLLLplKmkTY/yFAxIbOe7OJG6h+KW+4F9VPuXl2MFtHRZpeLGYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:53.674164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:222050159797f6b99aae21a9b6c046878d6752fee87cbfecab089bc16481d3fe","sha256:bfee527265936dfad015c43efee00e81f8cf65e79697c2fbda7940b3fd0c739f"],"state_sha256":"1ceb93f064ef131192f4540e3ee362b417b39d71313fedd0774767ab68ab1b99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8F0nWP7weL/ODQyreEh8Aowr20uWJAyAUNZvA7LGsSVO6x/UmHrkrWQC2iAr+rRmTLww4RO1B7IERJhLcoYAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:07:10.126764Z","bundle_sha256":"c2be594eb877658db6a072402aaf79a3b0eec3c8cd53bddb8f1969cace28c5d1"}}