{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZY34EEVFME6NJOUYYVIJRBRCRX","short_pith_number":"pith:ZY34EEVF","schema_version":"1.0","canonical_sha256":"ce37c212a5613cd4ba98c5509886228df34e42ac48d29c27eb1677578c3e90b5","source":{"kind":"arxiv","id":"1803.06443","version":5},"attestation_state":"computed","paper":{"title":"Communication Compression for Decentralized Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ce Zhang, Hanlin Tang, Ji Liu, Shaoduo Gan, Tong Zhang","submitted_at":"2018-03-17T01:51:09Z","abstract_excerpt":"Optimizing distributed learning systems is an art of balancing between computation and communication. There have been two lines of research that try to deal with slower networks: {\\em communication compression} for low bandwidth networks, and {\\em decentralization} for high latency networks. In this paper, We explore a natural question: {\\em can the combination of both techniques lead to a system that is robust to both bandwidth and latency?}\n  Although the system implication of such combination is trivial, the underlying theoretical principle and algorithm design is challenging: unlike centra"},"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":"1803.06443","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-17T01:51:09Z","cross_cats_sorted":["cs.DC","cs.SY","stat.ML"],"title_canon_sha256":"9e95437884322de5cf66d7c0ce15ee65f8196a24759687003c19b0a60607b519","abstract_canon_sha256":"bac7984f0af29f7a2b260acfcc19c58d0c2d2a370081dd596fa4a610c329ec98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:59.267640Z","signature_b64":"bqW+MEAxJRaK6x+WjJQzEtOY/VcZ0p05n7Ax+oCSD2vZkZ/r0fdhiI8Ct1YK0s1PmIipa6K/4lmqF3DkugRxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce37c212a5613cd4ba98c5509886228df34e42ac48d29c27eb1677578c3e90b5","last_reissued_at":"2026-05-17T23:54:59.267168Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:59.267168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Compression for Decentralized Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ce Zhang, Hanlin Tang, Ji Liu, Shaoduo Gan, Tong Zhang","submitted_at":"2018-03-17T01:51:09Z","abstract_excerpt":"Optimizing distributed learning systems is an art of balancing between computation and communication. There have been two lines of research that try to deal with slower networks: {\\em communication compression} for low bandwidth networks, and {\\em decentralization} for high latency networks. In this paper, We explore a natural question: {\\em can the combination of both techniques lead to a system that is robust to both bandwidth and latency?}\n  Although the system implication of such combination is trivial, the underlying theoretical principle and algorithm design is challenging: unlike centra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06443","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1803.06443","created_at":"2026-05-17T23:54:59.267240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06443v5","created_at":"2026-05-17T23:54:59.267240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06443","created_at":"2026-05-17T23:54:59.267240+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZY34EEVFME6N","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZY34EEVFME6NJOUY","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZY34EEVF","created_at":"2026-05-18T12:33:07.085635+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/ZY34EEVFME6NJOUYYVIJRBRCRX","json":"https://pith.science/pith/ZY34EEVFME6NJOUYYVIJRBRCRX.json","graph_json":"https://pith.science/api/pith-number/ZY34EEVFME6NJOUYYVIJRBRCRX/graph.json","events_json":"https://pith.science/api/pith-number/ZY34EEVFME6NJOUYYVIJRBRCRX/events.json","paper":"https://pith.science/paper/ZY34EEVF"},"agent_actions":{"view_html":"https://pith.science/pith/ZY34EEVFME6NJOUYYVIJRBRCRX","download_json":"https://pith.science/pith/ZY34EEVFME6NJOUYYVIJRBRCRX.json","view_paper":"https://pith.science/paper/ZY34EEVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06443&json=true","fetch_graph":"https://pith.science/api/pith-number/ZY34EEVFME6NJOUYYVIJRBRCRX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZY34EEVFME6NJOUYYVIJRBRCRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZY34EEVFME6NJOUYYVIJRBRCRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZY34EEVFME6NJOUYYVIJRBRCRX/action/storage_attestation","attest_author":"https://pith.science/pith/ZY34EEVFME6NJOUYYVIJRBRCRX/action/author_attestation","sign_citation":"https://pith.science/pith/ZY34EEVFME6NJOUYYVIJRBRCRX/action/citation_signature","submit_replication":"https://pith.science/pith/ZY34EEVFME6NJOUYYVIJRBRCRX/action/replication_record"}},"created_at":"2026-05-17T23:54:59.267240+00:00","updated_at":"2026-05-17T23:54:59.267240+00:00"}