{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TCAPQNQOVJIJTFRPBLXAYACHQU","short_pith_number":"pith:TCAPQNQO","canonical_record":{"source":{"id":"1703.02757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-08T09:26:36Z","cross_cats_sorted":["cs.LG","cs.NE","math.OC","stat.ML"],"title_canon_sha256":"0d9a52adca48acd7b27d89f7d2b38f3c8065bd7f3c6e3a470bb5ba1e6ee60bcd","abstract_canon_sha256":"dc7f90b25d086d43f5663a34f70b95dd9ed916f64d4aa7c9184ed045127e6a0c"},"schema_version":"1.0"},"canonical_sha256":"9880f8360eaa5099962f0aee0c004785120fc83580beddbeaf7306413997a48f","source":{"kind":"arxiv","id":"1703.02757","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02757","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02757v1","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02757","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"TCAPQNQOVJIJ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TCAPQNQOVJIJTFRP","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TCAPQNQO","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TCAPQNQOVJIJTFRPBLXAYACHQU","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-08T09:26:36Z","cross_cats_sorted":["cs.LG","cs.NE","math.OC","stat.ML"],"title_canon_sha256":"0d9a52adca48acd7b27d89f7d2b38f3c8065bd7f3c6e3a470bb5ba1e6ee60bcd","abstract_canon_sha256":"dc7f90b25d086d43f5663a34f70b95dd9ed916f64d4aa7c9184ed045127e6a0c"},"schema_version":"1.0"},"canonical_sha256":"9880f8360eaa5099962f0aee0c004785120fc83580beddbeaf7306413997a48f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:53.170468Z","signature_b64":"+Ga4eA5VTP3TeTFqPS5wPW/OkBIL9bZGPxdI8e2F54C0Da64k7vrxcyamAWehBFXC4XcuMGF7/uPzXi7Ndt/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9880f8360eaa5099962f0aee0c004785120fc83580beddbeaf7306413997a48f","last_reissued_at":"2026-05-18T00:48:53.169671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:53.169671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02757","source_version":1,"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-18T00:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFw2en0hYqK5eCPL+BPN4Ri5UcAf8EEe0r8XVCsRTRSgoNEz3cAj3HTOgkK1RVVEtAWhm6JXd811C1JLpi51Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:12:26.302268Z"},"content_sha256":"de678a5e1fd69979919aa437cb887a5f8f53cd660e1b2e9269d7cd1fcf138509","schema_version":"1.0","event_id":"sha256:de678a5e1fd69979919aa437cb887a5f8f53cd660e1b2e9269d7cd1fcf138509"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TCAPQNQOVJIJTFRPBLXAYACHQU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Byzantine-Tolerant Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","math.OC","stat.ML"],"primary_cat":"cs.DC","authors_text":"El Mahdi El Mhamdi, Julien Stainer, Peva Blanchard, Rachid Guerraoui","submitted_at":"2017-03-08T09:26:36Z","abstract_excerpt":"The growth of data, the need for scalability and the complexity of models used in modern machine learning calls for distributed implementations. Yet, as of today, distributed machine learning frameworks have largely ignored the possibility of arbitrary (i.e., Byzantine) failures. In this paper, we study the robustness to Byzantine failures at the fundamental level of stochastic gradient descent (SGD), the heart of most machine learning algorithms. Assuming a set of $n$ workers, up to $f$ of them being Byzantine, we ask how robust can SGD be, without limiting the dimension, nor the size of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02757","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"},"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-18T00:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XTU5/wuRh+vk2Veg/9hRewFKUTSKn5PiSo1vI9glkz4r3mFBL0mS7in2uLBibTXbhMeM2dNvsT7LeN3PBsGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:12:26.303006Z"},"content_sha256":"20d627e4b0268c7d67881d1b47d42fac73d3a5e5df5474066f0686ffb406827e","schema_version":"1.0","event_id":"sha256:20d627e4b0268c7d67881d1b47d42fac73d3a5e5df5474066f0686ffb406827e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCAPQNQOVJIJTFRPBLXAYACHQU/bundle.json","state_url":"https://pith.science/pith/TCAPQNQOVJIJTFRPBLXAYACHQU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCAPQNQOVJIJTFRPBLXAYACHQU/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-06-10T10:12:26Z","links":{"resolver":"https://pith.science/pith/TCAPQNQOVJIJTFRPBLXAYACHQU","bundle":"https://pith.science/pith/TCAPQNQOVJIJTFRPBLXAYACHQU/bundle.json","state":"https://pith.science/pith/TCAPQNQOVJIJTFRPBLXAYACHQU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCAPQNQOVJIJTFRPBLXAYACHQU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TCAPQNQOVJIJTFRPBLXAYACHQU","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":"dc7f90b25d086d43f5663a34f70b95dd9ed916f64d4aa7c9184ed045127e6a0c","cross_cats_sorted":["cs.LG","cs.NE","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-08T09:26:36Z","title_canon_sha256":"0d9a52adca48acd7b27d89f7d2b38f3c8065bd7f3c6e3a470bb5ba1e6ee60bcd"},"schema_version":"1.0","source":{"id":"1703.02757","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02757","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02757v1","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02757","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"TCAPQNQOVJIJ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TCAPQNQOVJIJTFRP","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TCAPQNQO","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:20d627e4b0268c7d67881d1b47d42fac73d3a5e5df5474066f0686ffb406827e","target":"graph","created_at":"2026-05-18T00:48: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":"The growth of data, the need for scalability and the complexity of models used in modern machine learning calls for distributed implementations. Yet, as of today, distributed machine learning frameworks have largely ignored the possibility of arbitrary (i.e., Byzantine) failures. In this paper, we study the robustness to Byzantine failures at the fundamental level of stochastic gradient descent (SGD), the heart of most machine learning algorithms. Assuming a set of $n$ workers, up to $f$ of them being Byzantine, we ask how robust can SGD be, without limiting the dimension, nor the size of the ","authors_text":"El Mahdi El Mhamdi, Julien Stainer, Peva Blanchard, Rachid Guerraoui","cross_cats":["cs.LG","cs.NE","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-08T09:26:36Z","title":"Byzantine-Tolerant Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02757","kind":"arxiv","version":1},"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:de678a5e1fd69979919aa437cb887a5f8f53cd660e1b2e9269d7cd1fcf138509","target":"record","created_at":"2026-05-18T00:48: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":"dc7f90b25d086d43f5663a34f70b95dd9ed916f64d4aa7c9184ed045127e6a0c","cross_cats_sorted":["cs.LG","cs.NE","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-08T09:26:36Z","title_canon_sha256":"0d9a52adca48acd7b27d89f7d2b38f3c8065bd7f3c6e3a470bb5ba1e6ee60bcd"},"schema_version":"1.0","source":{"id":"1703.02757","kind":"arxiv","version":1}},"canonical_sha256":"9880f8360eaa5099962f0aee0c004785120fc83580beddbeaf7306413997a48f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9880f8360eaa5099962f0aee0c004785120fc83580beddbeaf7306413997a48f","first_computed_at":"2026-05-18T00:48:53.169671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:53.169671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Ga4eA5VTP3TeTFqPS5wPW/OkBIL9bZGPxdI8e2F54C0Da64k7vrxcyamAWehBFXC4XcuMGF7/uPzXi7Ndt/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:53.170468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02757","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de678a5e1fd69979919aa437cb887a5f8f53cd660e1b2e9269d7cd1fcf138509","sha256:20d627e4b0268c7d67881d1b47d42fac73d3a5e5df5474066f0686ffb406827e"],"state_sha256":"b920c93e3686947bba1406b7f0d49eccddbd49aa5694549d44d0da100e889b4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFRSV5y/iPX3rmJi2VXAljLVKPYt0l1Xz/4z5ssO4fPVWwV6AIb5kGNJHmrAnLEV2Ibv4aKSRxrKmSUwL78jBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:12:26.307368Z","bundle_sha256":"771e81d23a22e2bcbb3daa8fefb63b15c0924be0910ac36384016f2d2bf85feb"}}