{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PD7YKGFEMVSJU7QDKJICBNPOQC","short_pith_number":"pith:PD7YKGFE","schema_version":"1.0","canonical_sha256":"78ff8518a465649a7e03525020b5ee8085ed6a4bb7a9b2077b40bf895923fda8","source":{"kind":"arxiv","id":"1702.07403","version":1},"attestation_state":"computed","paper":{"title":"Making Asynchronous Distributed Computations Robust to Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Keren Censor-Hillel, Ran Gelles","submitted_at":"2017-02-23T21:49:52Z","abstract_excerpt":"We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous distributed protocol while tolerating an optimal corruption of a $\\Theta(1/n)$ fraction of all messages while incurring a moderate blowup of $O(n\\log^2 n)$ in the communication complexity.\n  Our result is the first fully distributed interactive coding scheme in which the topology of the communication network is not known in advance. Prior work required either a coor"},"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":"1702.07403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-23T21:49:52Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5f42f38a271484ab1586153bdc3e3ac5a26ed0bf86f9dfa5a2700777a42b192d","abstract_canon_sha256":"cfc4c4f7d16d4f34a5897544f490e89b805bcb1a2f51ecb744d79edf09037517"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:03.489718Z","signature_b64":"q3cWM/ve/AttAfqaSLAFMIEoATCCQ+oYYcgrN4ibs7QMKjIS8BQAfSjfT4J006EAuZe8qjJkBrc2l35XqG5yBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78ff8518a465649a7e03525020b5ee8085ed6a4bb7a9b2077b40bf895923fda8","last_reissued_at":"2026-05-18T00:50:03.489013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:03.489013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Making Asynchronous Distributed Computations Robust to Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Keren Censor-Hillel, Ran Gelles","submitted_at":"2017-02-23T21:49:52Z","abstract_excerpt":"We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous distributed protocol while tolerating an optimal corruption of a $\\Theta(1/n)$ fraction of all messages while incurring a moderate blowup of $O(n\\log^2 n)$ in the communication complexity.\n  Our result is the first fully distributed interactive coding scheme in which the topology of the communication network is not known in advance. Prior work required either a coor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07403","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":"1702.07403","created_at":"2026-05-18T00:50:03.489150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07403v1","created_at":"2026-05-18T00:50:03.489150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07403","created_at":"2026-05-18T00:50:03.489150+00:00"},{"alias_kind":"pith_short_12","alias_value":"PD7YKGFEMVSJ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PD7YKGFEMVSJU7QD","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PD7YKGFE","created_at":"2026-05-18T12:31:37.085036+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/PD7YKGFEMVSJU7QDKJICBNPOQC","json":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC.json","graph_json":"https://pith.science/api/pith-number/PD7YKGFEMVSJU7QDKJICBNPOQC/graph.json","events_json":"https://pith.science/api/pith-number/PD7YKGFEMVSJU7QDKJICBNPOQC/events.json","paper":"https://pith.science/paper/PD7YKGFE"},"agent_actions":{"view_html":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC","download_json":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC.json","view_paper":"https://pith.science/paper/PD7YKGFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07403&json=true","fetch_graph":"https://pith.science/api/pith-number/PD7YKGFEMVSJU7QDKJICBNPOQC/graph.json","fetch_events":"https://pith.science/api/pith-number/PD7YKGFEMVSJU7QDKJICBNPOQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC/action/storage_attestation","attest_author":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC/action/author_attestation","sign_citation":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC/action/citation_signature","submit_replication":"https://pith.science/pith/PD7YKGFEMVSJU7QDKJICBNPOQC/action/replication_record"}},"created_at":"2026-05-18T00:50:03.489150+00:00","updated_at":"2026-05-18T00:50:03.489150+00:00"}