{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TLNYMTJICPBN2TH7R77F6S2T2U","short_pith_number":"pith:TLNYMTJI","schema_version":"1.0","canonical_sha256":"9adb864d2813c2dd4cff8ffe5f4b53d5304200b4109c6c88d1a7afb13b5c4999","source":{"kind":"arxiv","id":"2108.06658","version":1},"attestation_state":"computed","paper":{"title":"Efficient Byzantine-Resilient Stochastic Gradient Desce","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dakui Wang, Kaiyun Li, Peng Zhang, Shuai Zen, Xiaojun Chen, Ye Dong","submitted_at":"2021-08-15T05:01:55Z","abstract_excerpt":"Distributed Learning often suffers from Byzantine failures, and there have been a number of works studying the problem of distributed stochastic optimization under Byzantine failures, where only a portion of workers, instead of all the workers in a distributed learning system, compute stochastic gradients at each iteration. These methods, albeit workable under Byzantine failures, have the shortcomings of either a sub-optimal convergence rate or high computation cost. To this end, we propose a new Byzantine-resilient stochastic gradient descent algorithm (BrSGD for short) which is provably robu"},"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":"2108.06658","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-08-15T05:01:55Z","cross_cats_sorted":[],"title_canon_sha256":"02e987587e85a31c8fbdebf99685469c4239d471b44390c2faf25534b4f29ce7","abstract_canon_sha256":"4feb6a56571623e2b8dbf76836749399e30ae9ff49f936be1dbebe20c036193f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:56.748722Z","signature_b64":"UZk5OvIAre9MujQry/XWy6ahsIdSDx12DnrR3K7CBlkOjF0puKbEHRFvDqNbiR+QC4qjWyfdjDS1sqzP2CduBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9adb864d2813c2dd4cff8ffe5f4b53d5304200b4109c6c88d1a7afb13b5c4999","last_reissued_at":"2026-07-05T03:05:56.748310Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:56.748310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Byzantine-Resilient Stochastic Gradient Desce","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dakui Wang, Kaiyun Li, Peng Zhang, Shuai Zen, Xiaojun Chen, Ye Dong","submitted_at":"2021-08-15T05:01:55Z","abstract_excerpt":"Distributed Learning often suffers from Byzantine failures, and there have been a number of works studying the problem of distributed stochastic optimization under Byzantine failures, where only a portion of workers, instead of all the workers in a distributed learning system, compute stochastic gradients at each iteration. These methods, albeit workable under Byzantine failures, have the shortcomings of either a sub-optimal convergence rate or high computation cost. To this end, we propose a new Byzantine-resilient stochastic gradient descent algorithm (BrSGD for short) which is provably robu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.06658","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.06658/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2108.06658","created_at":"2026-07-05T03:05:56.748385+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.06658v1","created_at":"2026-07-05T03:05:56.748385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.06658","created_at":"2026-07-05T03:05:56.748385+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLNYMTJICPBN","created_at":"2026-07-05T03:05:56.748385+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLNYMTJICPBN2TH7","created_at":"2026-07-05T03:05:56.748385+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLNYMTJI","created_at":"2026-07-05T03:05:56.748385+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/TLNYMTJICPBN2TH7R77F6S2T2U","json":"https://pith.science/pith/TLNYMTJICPBN2TH7R77F6S2T2U.json","graph_json":"https://pith.science/api/pith-number/TLNYMTJICPBN2TH7R77F6S2T2U/graph.json","events_json":"https://pith.science/api/pith-number/TLNYMTJICPBN2TH7R77F6S2T2U/events.json","paper":"https://pith.science/paper/TLNYMTJI"},"agent_actions":{"view_html":"https://pith.science/pith/TLNYMTJICPBN2TH7R77F6S2T2U","download_json":"https://pith.science/pith/TLNYMTJICPBN2TH7R77F6S2T2U.json","view_paper":"https://pith.science/paper/TLNYMTJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.06658&json=true","fetch_graph":"https://pith.science/api/pith-number/TLNYMTJICPBN2TH7R77F6S2T2U/graph.json","fetch_events":"https://pith.science/api/pith-number/TLNYMTJICPBN2TH7R77F6S2T2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLNYMTJICPBN2TH7R77F6S2T2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLNYMTJICPBN2TH7R77F6S2T2U/action/storage_attestation","attest_author":"https://pith.science/pith/TLNYMTJICPBN2TH7R77F6S2T2U/action/author_attestation","sign_citation":"https://pith.science/pith/TLNYMTJICPBN2TH7R77F6S2T2U/action/citation_signature","submit_replication":"https://pith.science/pith/TLNYMTJICPBN2TH7R77F6S2T2U/action/replication_record"}},"created_at":"2026-07-05T03:05:56.748385+00:00","updated_at":"2026-07-05T03:05:56.748385+00:00"}