{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D2YGF6OGPRAPQJLH2S2TB74XJK","short_pith_number":"pith:D2YGF6OG","schema_version":"1.0","canonical_sha256":"1eb062f9c67c40f82567d4b530ff974aa3f9c4d1fa8b558815cb20734ccd1f7c","source":{"kind":"arxiv","id":"1412.8097","version":2},"attestation_state":"computed","paper":{"title":"The Adversarial Noise Threshold for Distributed Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Leonard J. Schulman, William M. Hoza","submitted_at":"2014-12-28T02:02:03Z","abstract_excerpt":"We consider the problem of implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology.\n  In our first result we show that any $n$-party $T$-round protocol on an undirected communication network $G$ can be compiled into a robust simulation protocol on a sparse ($\\mathcal{O}(n)$ edges) subnetwork so that the simulation tolerates an adversarial error rate of $\\Omega\\left(\\frac{1}{n}\\right)$; the simulation has a round complexity of $\\mathcal{O}\\left(\\frac{m \\log n}{n} T\\right)$, where $m$ is the number of edges in $G$. (So the"},"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.8097","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T02:02:03Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"title_canon_sha256":"920fe6681cae5dcca494ae4e76fb51f9368b407622ddfe9cb5f55703a8ae391a","abstract_canon_sha256":"99c67ef3bccf72107714aa28831d43cdab09c13289992eeb7090fb46699cc391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:33.298584Z","signature_b64":"bJTRw3DHpe6i0h+6D7MbSCJbOyGzXILQJP0Q5ohHnpA5gEbi+sZ0DKqKlz5WAy7skLmKKQGGNm0pzam68RX/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eb062f9c67c40f82567d4b530ff974aa3f9c4d1fa8b558815cb20734ccd1f7c","last_reissued_at":"2026-05-18T02:17:33.297918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:33.297918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Adversarial Noise Threshold for Distributed Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Leonard J. Schulman, William M. Hoza","submitted_at":"2014-12-28T02:02:03Z","abstract_excerpt":"We consider the problem of implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology.\n  In our first result we show that any $n$-party $T$-round protocol on an undirected communication network $G$ can be compiled into a robust simulation protocol on a sparse ($\\mathcal{O}(n)$ edges) subnetwork so that the simulation tolerates an adversarial error rate of $\\Omega\\left(\\frac{1}{n}\\right)$; the simulation has a round complexity of $\\mathcal{O}\\left(\\frac{m \\log n}{n} T\\right)$, where $m$ is the number of edges in $G$. (So the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8097","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":"1412.8097","created_at":"2026-05-18T02:17:33.298019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8097v2","created_at":"2026-05-18T02:17:33.298019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8097","created_at":"2026-05-18T02:17:33.298019+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2YGF6OGPRAP","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2YGF6OGPRAPQJLH","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2YGF6OG","created_at":"2026-05-18T12:28:25.294606+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/D2YGF6OGPRAPQJLH2S2TB74XJK","json":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK.json","graph_json":"https://pith.science/api/pith-number/D2YGF6OGPRAPQJLH2S2TB74XJK/graph.json","events_json":"https://pith.science/api/pith-number/D2YGF6OGPRAPQJLH2S2TB74XJK/events.json","paper":"https://pith.science/paper/D2YGF6OG"},"agent_actions":{"view_html":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK","download_json":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK.json","view_paper":"https://pith.science/paper/D2YGF6OG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8097&json=true","fetch_graph":"https://pith.science/api/pith-number/D2YGF6OGPRAPQJLH2S2TB74XJK/graph.json","fetch_events":"https://pith.science/api/pith-number/D2YGF6OGPRAPQJLH2S2TB74XJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK/action/storage_attestation","attest_author":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK/action/author_attestation","sign_citation":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK/action/citation_signature","submit_replication":"https://pith.science/pith/D2YGF6OGPRAPQJLH2S2TB74XJK/action/replication_record"}},"created_at":"2026-05-18T02:17:33.298019+00:00","updated_at":"2026-05-18T02:17:33.298019+00:00"}