{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:57KB2YVVXBF3ZJQHW6DYNC7NAI","short_pith_number":"pith:57KB2YVV","canonical_record":{"source":{"id":"2002.11364","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-26T09:03:23Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"580c2beee5d9be037f2afda3de43aae5187c42596b6e6387d79979e60205abd8","abstract_canon_sha256":"190757c962cc1fa7168aae31e9bd34968e6fda6cf02fcc2783f64ba78a2df130"},"schema_version":"1.0"},"canonical_sha256":"efd41d62b5b84bbca607b787868bed02393c35dc33039265608a0c0cb69717ba","source":{"kind":"arxiv","id":"2002.11364","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.11364","created_at":"2026-07-05T01:13:34Z"},{"alias_kind":"arxiv_version","alias_value":"2002.11364v2","created_at":"2026-07-05T01:13:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.11364","created_at":"2026-07-05T01:13:34Z"},{"alias_kind":"pith_short_12","alias_value":"57KB2YVVXBF3","created_at":"2026-07-05T01:13:34Z"},{"alias_kind":"pith_short_16","alias_value":"57KB2YVVXBF3ZJQH","created_at":"2026-07-05T01:13:34Z"},{"alias_kind":"pith_short_8","alias_value":"57KB2YVV","created_at":"2026-07-05T01:13:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:57KB2YVVXBF3ZJQHW6DYNC7NAI","target":"record","payload":{"canonical_record":{"source":{"id":"2002.11364","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-26T09:03:23Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"580c2beee5d9be037f2afda3de43aae5187c42596b6e6387d79979e60205abd8","abstract_canon_sha256":"190757c962cc1fa7168aae31e9bd34968e6fda6cf02fcc2783f64ba78a2df130"},"schema_version":"1.0"},"canonical_sha256":"efd41d62b5b84bbca607b787868bed02393c35dc33039265608a0c0cb69717ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:34.954997Z","signature_b64":"SfA2NiEou7cgN2sUYoN1frBp2DKOaROZDeGwSbV3/DQI8/1RJb1JKWC3x2MK9Y2r0G5K+UjsBS/r8SdZ32doAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efd41d62b5b84bbca607b787868bed02393c35dc33039265608a0c0cb69717ba","last_reissued_at":"2026-07-05T01:13:34.954593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:34.954593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.11364","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:13:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5key4VvTTlrnmCuexozB2ANjqQQMwMRvPJZx9MdELBbGqz2BRSQyJkoSDL94UY/+XJUx6wBinAkq64qvnrDuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:54:44.958955Z"},"content_sha256":"8bdbae5e859d6b1b3845583e1654d9631790f9cfe70c4c0ec8b252c3e885c503","schema_version":"1.0","event_id":"sha256:8bdbae5e859d6b1b3845583e1654d9631790f9cfe70c4c0ec8b252c3e885c503"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:57KB2YVVXBF3ZJQHW6DYNC7NAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Acceleration for Compressed Gradient Descent in Distributed and Federated Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"math.OC","authors_text":"Dmitry Kovalev, Peter Richt\\'arik, Xun Qian, Zhize Li","submitted_at":"2020-02-26T09:03:23Z","abstract_excerpt":"Due to the high communication cost in distributed and federated learning problems, methods relying on compression of communicated messages are becoming increasingly popular. While in other contexts the best performing gradient-type methods invariably rely on some form of acceleration/momentum to reduce the number of iterations, there are no methods which combine the benefits of both gradient compression and acceleration. In this paper, we remedy this situation and propose the first accelerated compressed gradient descent (ACGD) methods. In the single machine regime, we prove that ACGD enjoys t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.11364","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/2002.11364/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:13:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txRzl3ZTw8rE/HkLaBKyebt4plVKZ5KI2s8isgFfApRzkcstswX6tukBCcOSlueetaunx9I/myDZMUo4JmqxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:54:44.959856Z"},"content_sha256":"8227d94ad335749859e47ee5b20b7e267adafef9857da95dfe3c55a2d7f49478","schema_version":"1.0","event_id":"sha256:8227d94ad335749859e47ee5b20b7e267adafef9857da95dfe3c55a2d7f49478"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57KB2YVVXBF3ZJQHW6DYNC7NAI/bundle.json","state_url":"https://pith.science/pith/57KB2YVVXBF3ZJQHW6DYNC7NAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57KB2YVVXBF3ZJQHW6DYNC7NAI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T14:54:44Z","links":{"resolver":"https://pith.science/pith/57KB2YVVXBF3ZJQHW6DYNC7NAI","bundle":"https://pith.science/pith/57KB2YVVXBF3ZJQHW6DYNC7NAI/bundle.json","state":"https://pith.science/pith/57KB2YVVXBF3ZJQHW6DYNC7NAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57KB2YVVXBF3ZJQHW6DYNC7NAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:57KB2YVVXBF3ZJQHW6DYNC7NAI","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":"190757c962cc1fa7168aae31e9bd34968e6fda6cf02fcc2783f64ba78a2df130","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-26T09:03:23Z","title_canon_sha256":"580c2beee5d9be037f2afda3de43aae5187c42596b6e6387d79979e60205abd8"},"schema_version":"1.0","source":{"id":"2002.11364","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.11364","created_at":"2026-07-05T01:13:34Z"},{"alias_kind":"arxiv_version","alias_value":"2002.11364v2","created_at":"2026-07-05T01:13:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.11364","created_at":"2026-07-05T01:13:34Z"},{"alias_kind":"pith_short_12","alias_value":"57KB2YVVXBF3","created_at":"2026-07-05T01:13:34Z"},{"alias_kind":"pith_short_16","alias_value":"57KB2YVVXBF3ZJQH","created_at":"2026-07-05T01:13:34Z"},{"alias_kind":"pith_short_8","alias_value":"57KB2YVV","created_at":"2026-07-05T01:13:34Z"}],"graph_snapshots":[{"event_id":"sha256:8227d94ad335749859e47ee5b20b7e267adafef9857da95dfe3c55a2d7f49478","target":"graph","created_at":"2026-07-05T01:13:34Z","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/2002.11364/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Due to the high communication cost in distributed and federated learning problems, methods relying on compression of communicated messages are becoming increasingly popular. While in other contexts the best performing gradient-type methods invariably rely on some form of acceleration/momentum to reduce the number of iterations, there are no methods which combine the benefits of both gradient compression and acceleration. In this paper, we remedy this situation and propose the first accelerated compressed gradient descent (ACGD) methods. In the single machine regime, we prove that ACGD enjoys t","authors_text":"Dmitry Kovalev, Peter Richt\\'arik, Xun Qian, Zhize Li","cross_cats":["cs.DC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-26T09:03:23Z","title":"Acceleration for Compressed Gradient Descent in Distributed and Federated Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.11364","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:8bdbae5e859d6b1b3845583e1654d9631790f9cfe70c4c0ec8b252c3e885c503","target":"record","created_at":"2026-07-05T01:13:34Z","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":"190757c962cc1fa7168aae31e9bd34968e6fda6cf02fcc2783f64ba78a2df130","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-26T09:03:23Z","title_canon_sha256":"580c2beee5d9be037f2afda3de43aae5187c42596b6e6387d79979e60205abd8"},"schema_version":"1.0","source":{"id":"2002.11364","kind":"arxiv","version":2}},"canonical_sha256":"efd41d62b5b84bbca607b787868bed02393c35dc33039265608a0c0cb69717ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efd41d62b5b84bbca607b787868bed02393c35dc33039265608a0c0cb69717ba","first_computed_at":"2026-07-05T01:13:34.954593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:13:34.954593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SfA2NiEou7cgN2sUYoN1frBp2DKOaROZDeGwSbV3/DQI8/1RJb1JKWC3x2MK9Y2r0G5K+UjsBS/r8SdZ32doAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:13:34.954997Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.11364","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bdbae5e859d6b1b3845583e1654d9631790f9cfe70c4c0ec8b252c3e885c503","sha256:8227d94ad335749859e47ee5b20b7e267adafef9857da95dfe3c55a2d7f49478"],"state_sha256":"27fb48c1ddec2ea2dbf126a928240047206749330024773bdde8836b6c80f908"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRwGd2k/WPSsMKLauDlQjdbmExgDA9Wbs6sTEHsWKZIkNFKrWiOcjKanrvy6RKgsGgds+0RJRmTUizGWbdINCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T14:54:44.967311Z","bundle_sha256":"f8ea761e7cdc8acc99bc510b4e2a180b48712760cb549c43cc87fdb18c46718c"}}