{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PCPZNDBQZMY6XBNXRZ37CZJDUP","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":"322d8e014df60d12e242880ea9954a4ed4d99c892de29c5171b98be6f7d24531","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-15T11:22:34Z","title_canon_sha256":"e285578e958f6cf0cdb0c25fcb17c2f6cbee64ef8f652897e87484f12149c578"},"schema_version":"1.0","source":{"id":"2310.09804","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.09804","created_at":"2026-07-05T07:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"2310.09804v2","created_at":"2026-07-05T07:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.09804","created_at":"2026-07-05T07:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"PCPZNDBQZMY6","created_at":"2026-07-05T07:54:05Z"},{"alias_kind":"pith_short_16","alias_value":"PCPZNDBQZMY6XBNX","created_at":"2026-07-05T07:54:05Z"},{"alias_kind":"pith_short_8","alias_value":"PCPZNDBQ","created_at":"2026-07-05T07:54:05Z"}],"graph_snapshots":[{"event_id":"sha256:f7ce46fc204fb1b9a47791e6b3978ef10fee3e91d7f868af2b69d694648fa324","target":"graph","created_at":"2026-07-05T07:54:05Z","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/2310.09804/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Byzantine robustness is an essential feature of algorithms for certain distributed optimization problems, typically encountered in collaborative/federated learning. These problems are usually huge-scale, implying that communication compression is also imperative for their resolution. These factors have spurred recent algorithmic and theoretical developments in the literature of Byzantine-robust learning with compression. In this paper, we contribute to this research area in two main directions. First, we propose a new Byzantine-robust method with compression - Byz-DASHA-PAGE - and prove that t","authors_text":"Ahmad Rammal, Eduard Gorbunov, Kaja Gruntkowska, Nikita Fedin, Peter Richt\\'arik","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-15T11:22:34Z","title":"Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.09804","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:faf2dc6d23288ca72a6d39d5c1e5348825adb4640801b784de50aba81aeda9be","target":"record","created_at":"2026-07-05T07:54:05Z","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":"322d8e014df60d12e242880ea9954a4ed4d99c892de29c5171b98be6f7d24531","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-15T11:22:34Z","title_canon_sha256":"e285578e958f6cf0cdb0c25fcb17c2f6cbee64ef8f652897e87484f12149c578"},"schema_version":"1.0","source":{"id":"2310.09804","kind":"arxiv","version":2}},"canonical_sha256":"789f968c30cb31eb85b78e77f16523a3f58cd1b546439d0d3de76930eaaa50a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"789f968c30cb31eb85b78e77f16523a3f58cd1b546439d0d3de76930eaaa50a6","first_computed_at":"2026-07-05T07:54:05.009697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:54:05.009697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lg/v42U6tBCdtRC8p0KtJPoeWSGGHplkhY30DSLGxgEtxwt8mvaPKmMAK4f+Y4FsoQjKEDI3QjgMicou4CkACw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:54:05.010194Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.09804","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faf2dc6d23288ca72a6d39d5c1e5348825adb4640801b784de50aba81aeda9be","sha256:f7ce46fc204fb1b9a47791e6b3978ef10fee3e91d7f868af2b69d694648fa324"],"state_sha256":"b11dafe2239218279d56f61fcddff6aad6b14186e78adcec36c83a705c0277f8"}