{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CCXYJUEDM5NMGWFD5UK3SSDCWS","short_pith_number":"pith:CCXYJUED","canonical_record":{"source":{"id":"1905.04374","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-05T16:41:25Z","cross_cats_sorted":["cs.CR","cs.LG","stat.ML"],"title_canon_sha256":"7641086064dc2023c2bd86062b1ba539951da6669d75a5fe9bb5998d95e5cad4","abstract_canon_sha256":"fb682c6da1f3313da7a3b9793c9f7eeec2d652e3c68cdeb2d8fa102efbb5d35d"},"schema_version":"1.0"},"canonical_sha256":"10af84d083675ac358a3ed15b94862b4b39e01875ffce7f814a5f5aaa9c5394f","source":{"kind":"arxiv","id":"1905.04374","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04374","created_at":"2026-07-05T02:13:01Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04374v2","created_at":"2026-07-05T02:13:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04374","created_at":"2026-07-05T02:13:01Z"},{"alias_kind":"pith_short_12","alias_value":"CCXYJUEDM5NM","created_at":"2026-07-05T02:13:01Z"},{"alias_kind":"pith_short_16","alias_value":"CCXYJUEDM5NMGWFD","created_at":"2026-07-05T02:13:01Z"},{"alias_kind":"pith_short_8","alias_value":"CCXYJUED","created_at":"2026-07-05T02:13:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CCXYJUEDM5NMGWFD5UK3SSDCWS","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04374","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-05T16:41:25Z","cross_cats_sorted":["cs.CR","cs.LG","stat.ML"],"title_canon_sha256":"7641086064dc2023c2bd86062b1ba539951da6669d75a5fe9bb5998d95e5cad4","abstract_canon_sha256":"fb682c6da1f3313da7a3b9793c9f7eeec2d652e3c68cdeb2d8fa102efbb5d35d"},"schema_version":"1.0"},"canonical_sha256":"10af84d083675ac358a3ed15b94862b4b39e01875ffce7f814a5f5aaa9c5394f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:13:01.520893Z","signature_b64":"waoH0AMJe3NIvJtzHqrgc73A6TK2O1CNK57ffNsdR5ahY7SusI0kv7D6cOH0weTDrqMPqzKUgPpqtFK47t0ZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10af84d083675ac358a3ed15b94862b4b39e01875ffce7f814a5f5aaa9c5394f","last_reissued_at":"2026-07-05T02:13:01.519481Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:13:01.519481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04374","source_version":2,"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-07-05T02:13:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4verizvHnXwWLm3ISCslG8+vN3A+vpJsNVxbPWNRvB7G5bLtxR92/7id05/uWiGa8MdYANpgU4qGNLLAkE5KBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:33:21.012600Z"},"content_sha256":"1e9fe2d2c686119ff47cd970c737f48d14b6df8789eeb8c6c36f3f4421b47a70","schema_version":"1.0","event_id":"sha256:1e9fe2d2c686119ff47cd970c737f48d14b6df8789eeb8c6c36f3f4421b47a70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CCXYJUEDM5NMGWFD5UK3SSDCWS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Robust Distributed Learning in High Dimension","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CR","cs.LG","stat.ML"],"primary_cat":"cs.DC","authors_text":"El-Mahdi El-Mhamdi, Rachid Guerraoui, S\\'ebastien Rouault","submitted_at":"2019-05-05T16:41:25Z","abstract_excerpt":"Could a gradient aggregation rule (GAR) for distributed machine learning be both robust and fast? This paper answers by the affirmative through multi-Bulyan. Given $n$ workers, $f$ of which are arbitrary malicious (Byzantine) and $m=n-f$ are not, we prove that multi-Bulyan can ensure a strong form of Byzantine resilience, as well as an ${\\frac{m}{n}}$ slowdown, compared to averaging, the fastest (but non Byzantine resilient) rule for distributed machine learning. When $m \\approx n$ (almost all workers are correct), multi-Bulyan reaches the speed of averaging. We also prove that multi-Bulyan's "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04374","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.04374/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:13:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4LC3ETb4A7O2tsI87EpkXi6QrNmQRGx7W6PLHHQzYDlIM+cm38Z62xjCHjLFwqP0/xb5cmH6lpUx1U6i0m2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:33:21.013842Z"},"content_sha256":"5799936682e7ac3174823a4c8f125fc6624182fa55c0e399fe782892062c0e54","schema_version":"1.0","event_id":"sha256:5799936682e7ac3174823a4c8f125fc6624182fa55c0e399fe782892062c0e54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCXYJUEDM5NMGWFD5UK3SSDCWS/bundle.json","state_url":"https://pith.science/pith/CCXYJUEDM5NMGWFD5UK3SSDCWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCXYJUEDM5NMGWFD5UK3SSDCWS/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-08-13T02:33:21Z","links":{"resolver":"https://pith.science/pith/CCXYJUEDM5NMGWFD5UK3SSDCWS","bundle":"https://pith.science/pith/CCXYJUEDM5NMGWFD5UK3SSDCWS/bundle.json","state":"https://pith.science/pith/CCXYJUEDM5NMGWFD5UK3SSDCWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCXYJUEDM5NMGWFD5UK3SSDCWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CCXYJUEDM5NMGWFD5UK3SSDCWS","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":"fb682c6da1f3313da7a3b9793c9f7eeec2d652e3c68cdeb2d8fa102efbb5d35d","cross_cats_sorted":["cs.CR","cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-05T16:41:25Z","title_canon_sha256":"7641086064dc2023c2bd86062b1ba539951da6669d75a5fe9bb5998d95e5cad4"},"schema_version":"1.0","source":{"id":"1905.04374","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04374","created_at":"2026-07-05T02:13:01Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04374v2","created_at":"2026-07-05T02:13:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04374","created_at":"2026-07-05T02:13:01Z"},{"alias_kind":"pith_short_12","alias_value":"CCXYJUEDM5NM","created_at":"2026-07-05T02:13:01Z"},{"alias_kind":"pith_short_16","alias_value":"CCXYJUEDM5NMGWFD","created_at":"2026-07-05T02:13:01Z"},{"alias_kind":"pith_short_8","alias_value":"CCXYJUED","created_at":"2026-07-05T02:13:01Z"}],"graph_snapshots":[{"event_id":"sha256:5799936682e7ac3174823a4c8f125fc6624182fa55c0e399fe782892062c0e54","target":"graph","created_at":"2026-07-05T02:13:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.04374/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Could a gradient aggregation rule (GAR) for distributed machine learning be both robust and fast? This paper answers by the affirmative through multi-Bulyan. Given $n$ workers, $f$ of which are arbitrary malicious (Byzantine) and $m=n-f$ are not, we prove that multi-Bulyan can ensure a strong form of Byzantine resilience, as well as an ${\\frac{m}{n}}$ slowdown, compared to averaging, the fastest (but non Byzantine resilient) rule for distributed machine learning. When $m \\approx n$ (almost all workers are correct), multi-Bulyan reaches the speed of averaging. We also prove that multi-Bulyan's ","authors_text":"El-Mahdi El-Mhamdi, Rachid Guerraoui, S\\'ebastien Rouault","cross_cats":["cs.CR","cs.LG","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-05T16:41:25Z","title":"Fast and Robust Distributed Learning in High Dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04374","kind":"arxiv","version":2},"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:1e9fe2d2c686119ff47cd970c737f48d14b6df8789eeb8c6c36f3f4421b47a70","target":"record","created_at":"2026-07-05T02:13:01Z","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":"fb682c6da1f3313da7a3b9793c9f7eeec2d652e3c68cdeb2d8fa102efbb5d35d","cross_cats_sorted":["cs.CR","cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-05T16:41:25Z","title_canon_sha256":"7641086064dc2023c2bd86062b1ba539951da6669d75a5fe9bb5998d95e5cad4"},"schema_version":"1.0","source":{"id":"1905.04374","kind":"arxiv","version":2}},"canonical_sha256":"10af84d083675ac358a3ed15b94862b4b39e01875ffce7f814a5f5aaa9c5394f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10af84d083675ac358a3ed15b94862b4b39e01875ffce7f814a5f5aaa9c5394f","first_computed_at":"2026-07-05T02:13:01.519481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:13:01.519481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"waoH0AMJe3NIvJtzHqrgc73A6TK2O1CNK57ffNsdR5ahY7SusI0kv7D6cOH0weTDrqMPqzKUgPpqtFK47t0ZDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:13:01.520893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04374","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e9fe2d2c686119ff47cd970c737f48d14b6df8789eeb8c6c36f3f4421b47a70","sha256:5799936682e7ac3174823a4c8f125fc6624182fa55c0e399fe782892062c0e54"],"state_sha256":"24f7b5b1baa0c4d91eee24c27efa97b7fb4b9ad7653912e7b4ce6ba2918ebcb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzLP3tKRuXsbj3b4eypULTweTZKgqxCj3wAwCIt+ub9cBj1FAyLE+CBi1BqIUHp0IaYoOp5ZT1JVvuv8z/3vDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T02:33:21.021745Z","bundle_sha256":"71e3af7e42b290e77d0bf89f1da1e3a6240e46491fc48df035acab52e63c592c"}}