{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CHWFBCIV2FOY4ZCCB3PPGCMVSO","short_pith_number":"pith:CHWFBCIV","canonical_record":{"source":{"id":"1806.06573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-18T09:37:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"46479d007b0a8a32a8997bcafe32687e3599d62827edd2db015962a1cc1a3fc3","abstract_canon_sha256":"e4edb5d910b67d76763876c8abc7e42cba2c6440da8e7e0a3c56d4518ab01e76"},"schema_version":"1.0"},"canonical_sha256":"11ec508915d15d8e64420edef309959398e7e263df628271e7b46fb0838a0745","source":{"kind":"arxiv","id":"1806.06573","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06573","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06573v2","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06573","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"CHWFBCIV2FOY","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CHWFBCIV2FOY4ZCC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CHWFBCIV","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CHWFBCIV2FOY4ZCCB3PPGCMVSO","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-18T09:37:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"46479d007b0a8a32a8997bcafe32687e3599d62827edd2db015962a1cc1a3fc3","abstract_canon_sha256":"e4edb5d910b67d76763876c8abc7e42cba2c6440da8e7e0a3c56d4518ab01e76"},"schema_version":"1.0"},"canonical_sha256":"11ec508915d15d8e64420edef309959398e7e263df628271e7b46fb0838a0745","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:38.684605Z","signature_b64":"Dxogciegnwzp0gVw833Qp69iAWc7yC7uUg02gyIETF1EOvnhk43SWHx2LGEqzuABgb2XNR4lJ6lHoAWn04geBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11ec508915d15d8e64420edef309959398e7e263df628271e7b46fb0838a0745","last_reissued_at":"2026-05-17T23:59:38.683895Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:38.683895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06573","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-05-17T23:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JdqdveFPKrwksiE29zrbrvUncjbc8fpjdYz8+UI/quFPROjuELr5Zdr4NpIT1Wpt8mb/PKsYq3OWgSc3ZwEiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:32:07.478080Z"},"content_sha256":"8ce05786fd5505ba478e778431dcfea7d792ffac48b978d8f0a071607f4ca539","schema_version":"1.0","event_id":"sha256:8ce05786fd5505ba478e778431dcfea7d792ffac48b978d8f0a071607f4ca539"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CHWFBCIV2FOY4ZCCB3PPGCMVSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed learning with compressed gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Hamid Reza Feyzmahdavian, Mikael Johansson, Sarit Khirirat","submitted_at":"2018-06-18T09:37:39Z","abstract_excerpt":"Asynchronous computation and gradient compression have emerged as two key techniques for achieving scalability in distributed optimization for large-scale machine learning. This paper presents a unified analysis framework for distributed gradient methods operating with staled and compressed gradients. Non-asymptotic bounds on convergence rates and information exchange are derived for several optimization algorithms. These bounds give explicit expressions for step-sizes and characterize how the amount of asynchrony and the compression accuracy affect iteration and communication complexity guara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06573","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":""},"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-05-17T23:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+shwHFzv2U7VMGFmav1+qMPBXeq9ivNTZMX6gOzN+7xXsdrHAEp0+9H1RtIL+D0HNnhzEkyaoVAreyaASMWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:32:07.478441Z"},"content_sha256":"064a126ed96dffa391ca155f33defb9b6bc7f3a63c6832e5197a9261591f81ad","schema_version":"1.0","event_id":"sha256:064a126ed96dffa391ca155f33defb9b6bc7f3a63c6832e5197a9261591f81ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO/bundle.json","state_url":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO/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-06-03T22:32:07Z","links":{"resolver":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO","bundle":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO/bundle.json","state":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CHWFBCIV2FOY4ZCCB3PPGCMVSO","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":"e4edb5d910b67d76763876c8abc7e42cba2c6440da8e7e0a3c56d4518ab01e76","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-18T09:37:39Z","title_canon_sha256":"46479d007b0a8a32a8997bcafe32687e3599d62827edd2db015962a1cc1a3fc3"},"schema_version":"1.0","source":{"id":"1806.06573","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06573","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06573v2","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06573","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"CHWFBCIV2FOY","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CHWFBCIV2FOY4ZCC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CHWFBCIV","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:064a126ed96dffa391ca155f33defb9b6bc7f3a63c6832e5197a9261591f81ad","target":"graph","created_at":"2026-05-17T23:59:38Z","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"},"paper":{"abstract_excerpt":"Asynchronous computation and gradient compression have emerged as two key techniques for achieving scalability in distributed optimization for large-scale machine learning. This paper presents a unified analysis framework for distributed gradient methods operating with staled and compressed gradients. Non-asymptotic bounds on convergence rates and information exchange are derived for several optimization algorithms. These bounds give explicit expressions for step-sizes and characterize how the amount of asynchrony and the compression accuracy affect iteration and communication complexity guara","authors_text":"Hamid Reza Feyzmahdavian, Mikael Johansson, Sarit Khirirat","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-18T09:37:39Z","title":"Distributed learning with compressed gradients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06573","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:8ce05786fd5505ba478e778431dcfea7d792ffac48b978d8f0a071607f4ca539","target":"record","created_at":"2026-05-17T23:59:38Z","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":"e4edb5d910b67d76763876c8abc7e42cba2c6440da8e7e0a3c56d4518ab01e76","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-18T09:37:39Z","title_canon_sha256":"46479d007b0a8a32a8997bcafe32687e3599d62827edd2db015962a1cc1a3fc3"},"schema_version":"1.0","source":{"id":"1806.06573","kind":"arxiv","version":2}},"canonical_sha256":"11ec508915d15d8e64420edef309959398e7e263df628271e7b46fb0838a0745","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11ec508915d15d8e64420edef309959398e7e263df628271e7b46fb0838a0745","first_computed_at":"2026-05-17T23:59:38.683895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:38.683895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dxogciegnwzp0gVw833Qp69iAWc7yC7uUg02gyIETF1EOvnhk43SWHx2LGEqzuABgb2XNR4lJ6lHoAWn04geBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:38.684605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06573","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ce05786fd5505ba478e778431dcfea7d792ffac48b978d8f0a071607f4ca539","sha256:064a126ed96dffa391ca155f33defb9b6bc7f3a63c6832e5197a9261591f81ad"],"state_sha256":"4da53bc3a8e2b00d7a89f90d43d291619baedea2e27733cff089670754e1028b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KggbYu7qflX7X25TunrjUZkCApWA5FmgsbIQsdBJmYTxaJUvaTknj9ZlqVjxQWdZuHjbX7Hg91Qc1Js8GxZEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:32:07.480432Z","bundle_sha256":"d4950bb118a3b6061fb92818c39e5465a65199295eaaa7db6ee532673f3a179c"}}