{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6GPANTGA2M77Y26INOUVVDZU3P","short_pith_number":"pith:6GPANTGA","schema_version":"1.0","canonical_sha256":"f19e06ccc0d33ffc6bc86ba95a8f34dbd54657900c4d79f1ac0c7abd56911c6b","source":{"kind":"arxiv","id":"1612.05943","version":2},"attestation_state":"computed","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$; "},"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":"1612.05943","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-12-18T16:36:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8fe4691596a93c77a689ee19e122da11ef5c1d9a2f4c755185e18a5baf40ebc8","abstract_canon_sha256":"b4ea463525650756d1bff352aa8bc009bb2fc6311b8fc421978f5b2e1b5f76bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:39.377722Z","signature_b64":"zRs8avnJtYjYj1poqOyFQVP+B6aVyjYmvvNhd6ZTe75E83yeasvge3MWOcchcnmUF/irHyNTbkpWwO4Sc8l5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f19e06ccc0d33ffc6bc86ba95a8f34dbd54657900c4d79f1ac0c7abd56911c6b","last_reissued_at":"2026-05-18T00:39:39.376987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:39.376987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.05943","created_at":"2026-05-18T00:39:39.377108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.05943v2","created_at":"2026-05-18T00:39:39.377108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05943","created_at":"2026-05-18T00:39:39.377108+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GPANTGA2M77","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GPANTGA2M77Y26I","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GPANTGA","created_at":"2026-05-18T12:30:01.593930+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/6GPANTGA2M77Y26INOUVVDZU3P","json":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P.json","graph_json":"https://pith.science/api/pith-number/6GPANTGA2M77Y26INOUVVDZU3P/graph.json","events_json":"https://pith.science/api/pith-number/6GPANTGA2M77Y26INOUVVDZU3P/events.json","paper":"https://pith.science/paper/6GPANTGA"},"agent_actions":{"view_html":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P","download_json":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P.json","view_paper":"https://pith.science/paper/6GPANTGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.05943&json=true","fetch_graph":"https://pith.science/api/pith-number/6GPANTGA2M77Y26INOUVVDZU3P/graph.json","fetch_events":"https://pith.science/api/pith-number/6GPANTGA2M77Y26INOUVVDZU3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P/action/storage_attestation","attest_author":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P/action/author_attestation","sign_citation":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P/action/citation_signature","submit_replication":"https://pith.science/pith/6GPANTGA2M77Y26INOUVVDZU3P/action/replication_record"}},"created_at":"2026-05-18T00:39:39.377108+00:00","updated_at":"2026-05-18T00:39:39.377108+00:00"}