{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4S7JCZKEYKYRBNZP5OASETFFK4","short_pith_number":"pith:4S7JCZKE","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"},"canonical_sha256":"e4be916544c2b110b72feb81224ca557326c56423fa38572c7a8533671aeb3c8","source":{"kind":"arxiv","id":"1805.10032","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10032","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10032v3","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10032","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"4S7JCZKEYKYR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4S7JCZKEYKYRBNZP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4S7JCZKE","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4S7JCZKEYKYRBNZP5OASETFFK4","target":"record","payload":{"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"},"canonical_sha256":"e4be916544c2b110b72feb81224ca557326c56423fa38572c7a8533671aeb3c8","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"},"source_kind":"arxiv","source_id":"1805.10032","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWmzFNRvDGrA9khe9BETO19LTkHzbIuh7QA9XyRTK6dlze6AvyIlkUVmKJb8CNITo+WxtEOYQVSW4GE/aHa5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:47:33.883498Z"},"content_sha256":"62ee9c28c12f01019358f5d9b6a6a50a5c35c9295c9b44fee8e6dfb30787cb4f","schema_version":"1.0","event_id":"sha256:62ee9c28c12f01019358f5d9b6a6a50a5c35c9295c9b44fee8e6dfb30787cb4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4S7JCZKEYKYRBNZP5OASETFFK4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iiwxKH5MDzxRcp9u342dAtvWTaYTxZulq9ccujRmVyTuTbqIf00cM2hqsjRoxa2fLkg98dYXpvY5xLxym2BzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:47:33.884173Z"},"content_sha256":"f4a690c869c440821657ae400eb4987e848c1d5c2115c1dc145b4ded2f376a6f","schema_version":"1.0","event_id":"sha256:f4a690c869c440821657ae400eb4987e848c1d5c2115c1dc145b4ded2f376a6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4/bundle.json","state_url":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4S7JCZKEYKYRBNZP5OASETFFK4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T11:47:33Z","links":{"resolver":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4","bundle":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4/bundle.json","state":"https://pith.science/pith/4S7JCZKEYKYRBNZP5OASETFFK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4S7JCZKEYKYRBNZP5OASETFFK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4S7JCZKEYKYRBNZP5OASETFFK4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ebb6473cc8cfa6e64f7ed3e1965b78caadbbbf18fa373eb178c206089d1abb20","cross_cats_sorted":["cs.CR","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T08:33:24Z","title_canon_sha256":"40640cd246b01df688903ddd27af210825b6c093efd19495ae01cc0372c96455"},"schema_version":"1.0","source":{"id":"1805.10032","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10032","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10032v3","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10032","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"4S7JCZKEYKYR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4S7JCZKEYKYRBNZP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4S7JCZKE","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:f4a690c869c440821657ae400eb4987e848c1d5c2115c1dc145b4ded2f376a6f","target":"graph","created_at":"2026-05-17T23:45:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Cong Xie, Indranil Gupta, Oluwasanmi Koyejo","cross_cats":["cs.CR","cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T08:33:24Z","title":"Zeno: Distributed Stochastic Gradient Descent with Suspicion-based Fault-tolerance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10032","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:62ee9c28c12f01019358f5d9b6a6a50a5c35c9295c9b44fee8e6dfb30787cb4f","target":"record","created_at":"2026-05-17T23:45:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ebb6473cc8cfa6e64f7ed3e1965b78caadbbbf18fa373eb178c206089d1abb20","cross_cats_sorted":["cs.CR","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T08:33:24Z","title_canon_sha256":"40640cd246b01df688903ddd27af210825b6c093efd19495ae01cc0372c96455"},"schema_version":"1.0","source":{"id":"1805.10032","kind":"arxiv","version":3}},"canonical_sha256":"e4be916544c2b110b72feb81224ca557326c56423fa38572c7a8533671aeb3c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4be916544c2b110b72feb81224ca557326c56423fa38572c7a8533671aeb3c8","first_computed_at":"2026-05-17T23:45:53.101905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:53.101905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8t/1RvrhUfsIH0V8i11H7JuV/i1xUXdSN8TYVMFARV/kiSx2kfuFaWHDZmoME982j77lM2rNPJy6onPRXcOcBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:53.102426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10032","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62ee9c28c12f01019358f5d9b6a6a50a5c35c9295c9b44fee8e6dfb30787cb4f","sha256:f4a690c869c440821657ae400eb4987e848c1d5c2115c1dc145b4ded2f376a6f"],"state_sha256":"93b9b694c8a391608369778c4ca805d4e8438e0174b5434b5196c6a2dd4c2d20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVT85fLRCTglWqe84xN8bMLnxWpttggKId6AlF9p0nTItoYKNtuv/AE6gpr8G8GH4QsEgsVLFGMthtuzntqaDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:47:33.887944Z","bundle_sha256":"bab2fa2b67701b391bb9b7813333b23cd04860a223a90a50a1c6fcee2de66c61"}}