{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VHIHUTQQ7XSTVPFNCI4CTUPEI5","short_pith_number":"pith:VHIHUTQQ","schema_version":"1.0","canonical_sha256":"a9d07a4e10fde53abcad123829d1e4474af25642c0e2e268734a2520af2c98fc","source":{"kind":"arxiv","id":"2009.06459","version":2},"attestation_state":"computed","paper":{"title":"Communication Efficient Distributed Learning with Censored, Quantized, and Generalized Group ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anis Elgabli, Chaouki Ben Issaid, Jihong Park, Mehdi Bennis, M\\'erouane Debbah","submitted_at":"2020-09-14T14:18:19Z","abstract_excerpt":"In this paper, we propose a communication-efficiently decentralized machine learning framework that solves a consensus optimization problem defined over a network of inter-connected workers. The proposed algorithm, Censored and Quantized Generalized GADMM (CQ-GGADMM), leverages the worker grouping and decentralized learning ideas of Group Alternating Direction Method of Multipliers (GADMM), and pushes the frontier in communication efficiency by extending its applicability to generalized network topologies, while incorporating link censoring for negligible updates after quantization. We theoret"},"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":"2009.06459","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-14T14:18:19Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT","stat.ML"],"title_canon_sha256":"967935dc32bc191c32ae90b397dfda62a9768022c4cc7b1a0679909f4e440b5c","abstract_canon_sha256":"95158cd02df817c8d0d258104c7d1a4e422144296c6d42c5d01bc89f17c7b3eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:06:13.437701Z","signature_b64":"xGgPfqZ1spd+UClnNNPvRgWeN4EJGz3ZQ8SWX32J59GvvKr/6zeP+6QZoJFfFdhkaOnZvm7dfGuUBhSM7QkaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d07a4e10fde53abcad123829d1e4474af25642c0e2e268734a2520af2c98fc","last_reissued_at":"2026-07-05T02:06:13.437283Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:06:13.437283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Efficient Distributed Learning with Censored, Quantized, and Generalized Group ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anis Elgabli, Chaouki Ben Issaid, Jihong Park, Mehdi Bennis, M\\'erouane Debbah","submitted_at":"2020-09-14T14:18:19Z","abstract_excerpt":"In this paper, we propose a communication-efficiently decentralized machine learning framework that solves a consensus optimization problem defined over a network of inter-connected workers. The proposed algorithm, Censored and Quantized Generalized GADMM (CQ-GGADMM), leverages the worker grouping and decentralized learning ideas of Group Alternating Direction Method of Multipliers (GADMM), and pushes the frontier in communication efficiency by extending its applicability to generalized network topologies, while incorporating link censoring for negligible updates after quantization. We theoret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.06459","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/2009.06459/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":"2009.06459","created_at":"2026-07-05T02:06:13.437340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.06459v2","created_at":"2026-07-05T02:06:13.437340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.06459","created_at":"2026-07-05T02:06:13.437340+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHIHUTQQ7XST","created_at":"2026-07-05T02:06:13.437340+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHIHUTQQ7XSTVPFN","created_at":"2026-07-05T02:06:13.437340+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHIHUTQQ","created_at":"2026-07-05T02:06:13.437340+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/VHIHUTQQ7XSTVPFNCI4CTUPEI5","json":"https://pith.science/pith/VHIHUTQQ7XSTVPFNCI4CTUPEI5.json","graph_json":"https://pith.science/api/pith-number/VHIHUTQQ7XSTVPFNCI4CTUPEI5/graph.json","events_json":"https://pith.science/api/pith-number/VHIHUTQQ7XSTVPFNCI4CTUPEI5/events.json","paper":"https://pith.science/paper/VHIHUTQQ"},"agent_actions":{"view_html":"https://pith.science/pith/VHIHUTQQ7XSTVPFNCI4CTUPEI5","download_json":"https://pith.science/pith/VHIHUTQQ7XSTVPFNCI4CTUPEI5.json","view_paper":"https://pith.science/paper/VHIHUTQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.06459&json=true","fetch_graph":"https://pith.science/api/pith-number/VHIHUTQQ7XSTVPFNCI4CTUPEI5/graph.json","fetch_events":"https://pith.science/api/pith-number/VHIHUTQQ7XSTVPFNCI4CTUPEI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHIHUTQQ7XSTVPFNCI4CTUPEI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHIHUTQQ7XSTVPFNCI4CTUPEI5/action/storage_attestation","attest_author":"https://pith.science/pith/VHIHUTQQ7XSTVPFNCI4CTUPEI5/action/author_attestation","sign_citation":"https://pith.science/pith/VHIHUTQQ7XSTVPFNCI4CTUPEI5/action/citation_signature","submit_replication":"https://pith.science/pith/VHIHUTQQ7XSTVPFNCI4CTUPEI5/action/replication_record"}},"created_at":"2026-07-05T02:06:13.437340+00:00","updated_at":"2026-07-05T02:06:13.437340+00:00"}