{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EW2MAY64SF3VHTMVARN7OV6ZHJ","short_pith_number":"pith:EW2MAY64","schema_version":"1.0","canonical_sha256":"25b4c063dc917753cd95045bf757d93a424e881a3517123c771751040f842dbf","source":{"kind":"arxiv","id":"1412.6376","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.6376","created_at":"2026-05-18T02:30:53.673643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6376v1","created_at":"2026-05-18T02:30:53.673643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6376","created_at":"2026-05-18T02:30:53.673643+00:00"},{"alias_kind":"pith_short_12","alias_value":"EW2MAY64SF3V","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EW2MAY64SF3VHTMV","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EW2MAY64","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ","json":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ.json","graph_json":"https://pith.science/api/pith-number/EW2MAY64SF3VHTMVARN7OV6ZHJ/graph.json","events_json":"https://pith.science/api/pith-number/EW2MAY64SF3VHTMVARN7OV6ZHJ/events.json","paper":"https://pith.science/paper/EW2MAY64"},"agent_actions":{"view_html":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ","download_json":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ.json","view_paper":"https://pith.science/paper/EW2MAY64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6376&json=true","fetch_graph":"https://pith.science/api/pith-number/EW2MAY64SF3VHTMVARN7OV6ZHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/EW2MAY64SF3VHTMVARN7OV6ZHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ/action/storage_attestation","attest_author":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ/action/author_attestation","sign_citation":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ/action/citation_signature","submit_replication":"https://pith.science/pith/EW2MAY64SF3VHTMVARN7OV6ZHJ/action/replication_record"}},"created_at":"2026-05-18T02:30:53.673643+00:00","updated_at":"2026-05-18T02:30:53.673643+00:00"}