{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JPOGEJNPUSWNGUP24GECSLQVOX","short_pith_number":"pith:JPOGEJNP","schema_version":"1.0","canonical_sha256":"4bdc6225afa4acd351fae188292e1575e63f1eb200825e9f07b17ad0b08b23f9","source":{"kind":"arxiv","id":"2202.01545","version":2},"attestation_state":"computed","paper":{"title":"Byzantine-Robust Decentralized Learning via ClippedGossip","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Lie He, Martin Jaggi, Sai Praneeth Karimireddy","submitted_at":"2022-02-03T12:04:36Z","abstract_excerpt":"In this paper, we study the challenging task of Byzantine-robust decentralized training on arbitrary communication graphs. Unlike federated learning where workers communicate through a server, workers in the decentralized environment can only talk to their neighbors, making it harder to reach consensus and benefit from collaborative training. To address these issues, we propose a ClippedGossip algorithm for Byzantine-robust consensus and optimization, which is the first to provably converge to a $O(\\delta_{\\max}\\zeta^2/\\gamma^2)$ neighborhood of the stationary point for non-convex objectives u"},"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":"2202.01545","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-03T12:04:36Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"ae8befcd454e9cd89eddde81a8f576af53e5589e603860ca36b26c560549ddd5","abstract_canon_sha256":"8422916806c93ecad833b413a5f634affa43b082d179ec4435c4fe4753b2692e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:45.004036Z","signature_b64":"iGPDKPzDYNj0BTVWurvBu97GNMOz2crOusGWRoEDPTpcMUFgfQOrCYWqG8E/Vp0WxA7Zjq6ifFMhdypUpgCNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bdc6225afa4acd351fae188292e1575e63f1eb200825e9f07b17ad0b08b23f9","last_reissued_at":"2026-07-05T06:02:45.003591Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:45.003591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine-Robust Decentralized Learning via ClippedGossip","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Lie He, Martin Jaggi, Sai Praneeth Karimireddy","submitted_at":"2022-02-03T12:04:36Z","abstract_excerpt":"In this paper, we study the challenging task of Byzantine-robust decentralized training on arbitrary communication graphs. Unlike federated learning where workers communicate through a server, workers in the decentralized environment can only talk to their neighbors, making it harder to reach consensus and benefit from collaborative training. To address these issues, we propose a ClippedGossip algorithm for Byzantine-robust consensus and optimization, which is the first to provably converge to a $O(\\delta_{\\max}\\zeta^2/\\gamma^2)$ neighborhood of the stationary point for non-convex objectives u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.01545","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/2202.01545/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":"2202.01545","created_at":"2026-07-05T06:02:45.003652+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.01545v2","created_at":"2026-07-05T06:02:45.003652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.01545","created_at":"2026-07-05T06:02:45.003652+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPOGEJNPUSWN","created_at":"2026-07-05T06:02:45.003652+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPOGEJNPUSWNGUP2","created_at":"2026-07-05T06:02:45.003652+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPOGEJNP","created_at":"2026-07-05T06:02:45.003652+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12246","citing_title":"Efficient and Robust Online Learning to Rank in Decentralized Systems","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04757","citing_title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2502.07977","citing_title":"RESIST: Resilient Decentralized Learning Using Consensus Gradient Descent","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2507.06542","citing_title":"On the Surprising Effectiveness of a Single Global Merging in Decentralized Learning","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2510.07922","citing_title":"SketchGuard: Scaling Byzantine-Robust Decentralized Federated Learning via Sketch-Based Screening","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.00449","citing_title":"Convergence of Byzantine-Resilient Gradient Tracking via Probabilistic Edge Dropout","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10013","citing_title":"Toward Exact Convergence in Byzantine-Robust Decentralized Learning: A Statistical Identification Approach","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPOGEJNPUSWNGUP24GECSLQVOX","json":"https://pith.science/pith/JPOGEJNPUSWNGUP24GECSLQVOX.json","graph_json":"https://pith.science/api/pith-number/JPOGEJNPUSWNGUP24GECSLQVOX/graph.json","events_json":"https://pith.science/api/pith-number/JPOGEJNPUSWNGUP24GECSLQVOX/events.json","paper":"https://pith.science/paper/JPOGEJNP"},"agent_actions":{"view_html":"https://pith.science/pith/JPOGEJNPUSWNGUP24GECSLQVOX","download_json":"https://pith.science/pith/JPOGEJNPUSWNGUP24GECSLQVOX.json","view_paper":"https://pith.science/paper/JPOGEJNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.01545&json=true","fetch_graph":"https://pith.science/api/pith-number/JPOGEJNPUSWNGUP24GECSLQVOX/graph.json","fetch_events":"https://pith.science/api/pith-number/JPOGEJNPUSWNGUP24GECSLQVOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPOGEJNPUSWNGUP24GECSLQVOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPOGEJNPUSWNGUP24GECSLQVOX/action/storage_attestation","attest_author":"https://pith.science/pith/JPOGEJNPUSWNGUP24GECSLQVOX/action/author_attestation","sign_citation":"https://pith.science/pith/JPOGEJNPUSWNGUP24GECSLQVOX/action/citation_signature","submit_replication":"https://pith.science/pith/JPOGEJNPUSWNGUP24GECSLQVOX/action/replication_record"}},"created_at":"2026-07-05T06:02:45.003652+00:00","updated_at":"2026-07-05T06:02:45.003652+00:00"}