{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JPOGEJNPUSWNGUP24GECSLQVOX","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":"8422916806c93ecad833b413a5f634affa43b082d179ec4435c4fe4753b2692e","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-03T12:04:36Z","title_canon_sha256":"ae8befcd454e9cd89eddde81a8f576af53e5589e603860ca36b26c560549ddd5"},"schema_version":"1.0","source":{"id":"2202.01545","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.01545","created_at":"2026-07-05T06:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"2202.01545v2","created_at":"2026-07-05T06:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.01545","created_at":"2026-07-05T06:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"JPOGEJNPUSWN","created_at":"2026-07-05T06:02:45Z"},{"alias_kind":"pith_short_16","alias_value":"JPOGEJNPUSWNGUP2","created_at":"2026-07-05T06:02:45Z"},{"alias_kind":"pith_short_8","alias_value":"JPOGEJNP","created_at":"2026-07-05T06:02:45Z"}],"graph_snapshots":[{"event_id":"sha256:42ef2ad30f97865eb4c2720c37852c4360ad355f97d1c1221ec0d346e5ac43c6","target":"graph","created_at":"2026-07-05T06:02:45Z","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/2202.01545/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Lie He, Martin Jaggi, Sai Praneeth Karimireddy","cross_cats":["cs.DC","math.OC","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-03T12:04:36Z","title":"Byzantine-Robust Decentralized Learning via ClippedGossip"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.01545","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:af6b832212946e2fc952f5d6f815942419d72f87a647450b7ce8f7142afbfb3d","target":"record","created_at":"2026-07-05T06:02:45Z","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":"8422916806c93ecad833b413a5f634affa43b082d179ec4435c4fe4753b2692e","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-03T12:04:36Z","title_canon_sha256":"ae8befcd454e9cd89eddde81a8f576af53e5589e603860ca36b26c560549ddd5"},"schema_version":"1.0","source":{"id":"2202.01545","kind":"arxiv","version":2}},"canonical_sha256":"4bdc6225afa4acd351fae188292e1575e63f1eb200825e9f07b17ad0b08b23f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bdc6225afa4acd351fae188292e1575e63f1eb200825e9f07b17ad0b08b23f9","first_computed_at":"2026-07-05T06:02:45.003591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:02:45.003591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iGPDKPzDYNj0BTVWurvBu97GNMOz2crOusGWRoEDPTpcMUFgfQOrCYWqG8E/Vp0WxA7Zjq6ifFMhdypUpgCNDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:02:45.004036Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.01545","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af6b832212946e2fc952f5d6f815942419d72f87a647450b7ce8f7142afbfb3d","sha256:42ef2ad30f97865eb4c2720c37852c4360ad355f97d1c1221ec0d346e5ac43c6"],"state_sha256":"57406067fc22e8ac89453cee9a47391ed0b10527d864c0163239731eb1c81547"}