{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4S7JCZKEYKYRBNZP5OASETFFK4","short_pith_number":"pith:4S7JCZKE","schema_version":"1.0","canonical_sha256":"e4be916544c2b110b72feb81224ca557326c56423fa38572c7a8533671aeb3c8","source":{"kind":"arxiv","id":"1805.10032","version":3},"attestation_state":"computed","paper":{"title":"Zeno: Distributed Stochastic Gradient Descent with Suspicion-based Fault-tolerance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cong Xie, Indranil Gupta, Oluwasanmi Koyejo","submitted_at":"2018-05-25T08:33:24Z","abstract_excerpt":"We present Zeno, a technique to make distributed machine learning, particularly Stochastic Gradient Descent (SGD), tolerant to an arbitrary number of faulty workers. Zeno generalizes previous results that assumed a majority of non-faulty nodes; we need assume only one non-faulty worker. Our key idea is to suspect workers that are potentially defective. Since this is likely to lead to false positives, we use a ranking-based preference mechanism. We prove the convergence of SGD for non-convex problems under these scenarios. Experimental results show that Zeno outperforms existing approaches."},"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":"1805.10032","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T08:33:24Z","cross_cats_sorted":["cs.CR","cs.DC","stat.ML"],"title_canon_sha256":"40640cd246b01df688903ddd27af210825b6c093efd19495ae01cc0372c96455","abstract_canon_sha256":"ebb6473cc8cfa6e64f7ed3e1965b78caadbbbf18fa373eb178c206089d1abb20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:53.102426Z","signature_b64":"8t/1RvrhUfsIH0V8i11H7JuV/i1xUXdSN8TYVMFARV/kiSx2kfuFaWHDZmoME982j77lM2rNPJy6onPRXcOcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4be916544c2b110b72feb81224ca557326c56423fa38572c7a8533671aeb3c8","last_reissued_at":"2026-05-17T23:45:53.101905Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:53.101905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zeno: Distributed Stochastic Gradient Descent with Suspicion-based Fault-tolerance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cong Xie, Indranil Gupta, Oluwasanmi Koyejo","submitted_at":"2018-05-25T08:33:24Z","abstract_excerpt":"We present Zeno, a technique to make distributed machine learning, particularly Stochastic Gradient Descent (SGD), tolerant to an arbitrary number of faulty workers. Zeno generalizes previous results that assumed a majority of non-faulty nodes; we need assume only one non-faulty worker. Our key idea is to suspect workers that are potentially defective. Since this is likely to lead to false positives, we use a ranking-based preference mechanism. We prove the convergence of SGD for non-convex problems under these scenarios. Experimental results show that Zeno outperforms existing approaches."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10032","kind":"arxiv","version":3},"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":"1805.10032","created_at":"2026-05-17T23:45:53.101981+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10032v3","created_at":"2026-05-17T23:45:53.101981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10032","created_at":"2026-05-17T23:45:53.101981+00:00"},{"alias_kind":"pith_short_12","alias_value":"4S7JCZKEYKYR","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4S7JCZKEYKYRBNZP","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4S7JCZKE","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07977","citing_title":"RESIST: Resilient Decentralized Learning Using Consensus Gradient Descent","ref_index":72,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4","json":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4.json","graph_json":"https://pith.science/api/pith-number/4S7JCZKEYKYRBNZP5OASETFFK4/graph.json","events_json":"https://pith.science/api/pith-number/4S7JCZKEYKYRBNZP5OASETFFK4/events.json","paper":"https://pith.science/paper/4S7JCZKE"},"agent_actions":{"view_html":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4","download_json":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4.json","view_paper":"https://pith.science/paper/4S7JCZKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10032&json=true","fetch_graph":"https://pith.science/api/pith-number/4S7JCZKEYKYRBNZP5OASETFFK4/graph.json","fetch_events":"https://pith.science/api/pith-number/4S7JCZKEYKYRBNZP5OASETFFK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4/action/storage_attestation","attest_author":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4/action/author_attestation","sign_citation":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4/action/citation_signature","submit_replication":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4/action/replication_record"}},"created_at":"2026-05-17T23:45:53.101981+00:00","updated_at":"2026-05-17T23:45:53.101981+00:00"}