{"paper":{"title":"Distributed Computing with Channel Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Abhinav Aggarwal, Jared Saia, Thomas P. Hayes, Varsha Dani","submitted_at":"2016-12-18T16:36:37Z","abstract_excerpt":"A group of $n$ users want to run a distributed protocol $\\pi$ over a network where communication occurs via private point-to-point channels. Unfortunately, an adversary, who knows $\\pi$, is able to maliciously flip bits on the channels. Can we efficiently simulate $\\pi$ in the presence of such an adversary? We show that this is possible, even when $L$, the number of bits sent in $\\pi$, and $T$, the number of bits flipped by the adversary are not known in advance. In particular, we show how to create a robust version of $\\pi$ that 1) fails with probability at most $\\delta$, for any $\\delta>0$; "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05943","kind":"arxiv","version":2},"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"}