{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GEJXNPSL4ILF32EO6AWWUS37DV","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":"5aac9108922419623157a266a8435a702ac6e2b1c532216c1139e1df3b3279c0","cross_cats_sorted":["cs.DC","cs.NA","math.NA","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-10T19:52:09Z","title_canon_sha256":"a5037d5de25d3e5cace50ed847acc74ff8fdd90fc121d7a3392d5722b812f5ed"},"schema_version":"1.0","source":{"id":"1909.04716","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.04716","created_at":"2026-07-05T00:49:00Z"},{"alias_kind":"arxiv_version","alias_value":"1909.04716v2","created_at":"2026-07-05T00:49:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04716","created_at":"2026-07-05T00:49:00Z"},{"alias_kind":"pith_short_12","alias_value":"GEJXNPSL4ILF","created_at":"2026-07-05T00:49:00Z"},{"alias_kind":"pith_short_16","alias_value":"GEJXNPSL4ILF32EO","created_at":"2026-07-05T00:49:00Z"},{"alias_kind":"pith_short_8","alias_value":"GEJXNPSL","created_at":"2026-07-05T00:49:00Z"}],"graph_snapshots":[{"event_id":"sha256:0f7ac0c803fe8360ec02b8643adab2de435e22207662c1b65b1805617f18618c","target":"graph","created_at":"2026-07-05T00:49:00Z","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/1909.04716/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose and analyze a new type of stochastic first order method: gradient descent with compressed iterates (GDCI). GDCI in each iteration first compresses the current iterate using a lossy randomized compression technique, and subsequently takes a gradient step. This method is a distillation of a key ingredient in the current practice of federated learning, where a model needs to be compressed by a mobile device before it is sent back to a server for aggregation. Our analysis provides a step towards closing the gap between the theory and practice of federated learning, and opens the possibi","authors_text":"Ahmed Khaled, Peter Richt\\'arik","cross_cats":["cs.DC","cs.NA","math.NA","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-10T19:52:09Z","title":"Gradient Descent with Compressed Iterates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04716","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:645e9b29633024b52bb30ef57a41051d6e988af77031903d3d73bd971e475245","target":"record","created_at":"2026-07-05T00:49:00Z","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":"5aac9108922419623157a266a8435a702ac6e2b1c532216c1139e1df3b3279c0","cross_cats_sorted":["cs.DC","cs.NA","math.NA","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-10T19:52:09Z","title_canon_sha256":"a5037d5de25d3e5cace50ed847acc74ff8fdd90fc121d7a3392d5722b812f5ed"},"schema_version":"1.0","source":{"id":"1909.04716","kind":"arxiv","version":2}},"canonical_sha256":"311376be4be2165de88ef02d6a4b7f1d768cd443de1bde533d8b5845e7c9ea9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"311376be4be2165de88ef02d6a4b7f1d768cd443de1bde533d8b5845e7c9ea9c","first_computed_at":"2026-07-05T00:49:00.014047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:49:00.014047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zD5iUOqW+OXUDz0MHpxVhZCisLxsQ5Uvs5hG8jSV5OPbxfv4KrlwmYF91hmgyW3RIt0mTi5lz4XhBBNbintsAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:49:00.014463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.04716","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:645e9b29633024b52bb30ef57a41051d6e988af77031903d3d73bd971e475245","sha256:0f7ac0c803fe8360ec02b8643adab2de435e22207662c1b65b1805617f18618c"],"state_sha256":"1fd0a61158f18d87129dea658d5486bf93c8b57a06d3a52a70300fec17234e58"}