{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JUGSYVMTHAP2QIN5NNG6JBJOSI","short_pith_number":"pith:JUGSYVMT","canonical_record":{"source":{"id":"1805.09965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T03:36:14Z","cross_cats_sorted":["cs.DC","cs.LG","math.OC"],"title_canon_sha256":"44b823808522e2a92e1fb95af33344facfeea2e0294d5fb79f9c3af20a21875e","abstract_canon_sha256":"86a6481c18dd648f38f77828adb1be71a995be074d13f666596658c4018458f9"},"schema_version":"1.0"},"canonical_sha256":"4d0d2c5593381fa821bd6b4de4852e921edc8660afee0598b45fede731dcad6f","source":{"kind":"arxiv","id":"1805.09965","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09965","created_at":"2026-05-18T00:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09965v2","created_at":"2026-05-18T00:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09965","created_at":"2026-05-18T00:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"JUGSYVMTHAP2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JUGSYVMTHAP2QIN5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JUGSYVMT","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JUGSYVMTHAP2QIN5NNG6JBJOSI","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T03:36:14Z","cross_cats_sorted":["cs.DC","cs.LG","math.OC"],"title_canon_sha256":"44b823808522e2a92e1fb95af33344facfeea2e0294d5fb79f9c3af20a21875e","abstract_canon_sha256":"86a6481c18dd648f38f77828adb1be71a995be074d13f666596658c4018458f9"},"schema_version":"1.0"},"canonical_sha256":"4d0d2c5593381fa821bd6b4de4852e921edc8660afee0598b45fede731dcad6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:37.480522Z","signature_b64":"accsvspt/ZNVanZ5lwjc54HcEmZk6IlhmLTzokNjT1dh/NGrVD0dw+HUYW4ZB8NvkXC9r4gEx2tZb7v/maBhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d0d2c5593381fa821bd6b4de4852e921edc8660afee0598b45fede731dcad6f","last_reissued_at":"2026-05-18T00:14:37.479636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:37.479636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09965","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-18T00:14:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBLvxSR9SkUlkpNeVn0cvIMkhlhV0xdauJhzxgFQGYcPCYpZkr2KETEkabvfnoeCSBkbZuAyJ2+6S5ZClZJZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:48:05.261346Z"},"content_sha256":"bd31378ca1067a374541c9db9860ba79fba15694758b4818e91f8d7ae26d8e7e","schema_version":"1.0","event_id":"sha256:bd31378ca1067a374541c9db9860ba79fba15694758b4818e91f8d7ae26d8e7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JUGSYVMTHAP2QIN5NNG6JBJOSI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LAG: Lazily Aggregated Gradient for Communication-Efficient Distributed Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Georgios B. Giannakis, Tao Sun, Tianyi Chen, Wotao Yin","submitted_at":"2018-05-25T03:36:14Z","abstract_excerpt":"This paper presents a new class of gradient methods for distributed machine learning that adaptively skip the gradient calculations to learn with reduced communication and computation. Simple rules are designed to detect slowly-varying gradients and, therefore, trigger the reuse of outdated gradients. The resultant gradient-based algorithms are termed Lazily Aggregated Gradient --- justifying our acronym LAG used henceforth. Theoretically, the merits of this contribution are: i) the convergence rate is the same as batch gradient descent in strongly-convex, convex, and nonconvex smooth cases; a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09965","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-18T00:14:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7VEJ/OBoczCRKMeZ9AuyKe2q+bHZvu4JPbzL5Gqe55EWaA5tyhPw0cs0GgN33OVt4ojXhpXnlQjYAhL6zRkyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:48:05.261963Z"},"content_sha256":"d0462dd33642c62bc5cfdbfa5ee22b92820168e2656a5a18554a4ca1b8a155aa","schema_version":"1.0","event_id":"sha256:d0462dd33642c62bc5cfdbfa5ee22b92820168e2656a5a18554a4ca1b8a155aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUGSYVMTHAP2QIN5NNG6JBJOSI/bundle.json","state_url":"https://pith.science/pith/JUGSYVMTHAP2QIN5NNG6JBJOSI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUGSYVMTHAP2QIN5NNG6JBJOSI/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-05-30T03:48:05Z","links":{"resolver":"https://pith.science/pith/JUGSYVMTHAP2QIN5NNG6JBJOSI","bundle":"https://pith.science/pith/JUGSYVMTHAP2QIN5NNG6JBJOSI/bundle.json","state":"https://pith.science/pith/JUGSYVMTHAP2QIN5NNG6JBJOSI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUGSYVMTHAP2QIN5NNG6JBJOSI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JUGSYVMTHAP2QIN5NNG6JBJOSI","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":"86a6481c18dd648f38f77828adb1be71a995be074d13f666596658c4018458f9","cross_cats_sorted":["cs.DC","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T03:36:14Z","title_canon_sha256":"44b823808522e2a92e1fb95af33344facfeea2e0294d5fb79f9c3af20a21875e"},"schema_version":"1.0","source":{"id":"1805.09965","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09965","created_at":"2026-05-18T00:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09965v2","created_at":"2026-05-18T00:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09965","created_at":"2026-05-18T00:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"JUGSYVMTHAP2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JUGSYVMTHAP2QIN5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JUGSYVMT","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:d0462dd33642c62bc5cfdbfa5ee22b92820168e2656a5a18554a4ca1b8a155aa","target":"graph","created_at":"2026-05-18T00:14:37Z","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":"This paper presents a new class of gradient methods for distributed machine learning that adaptively skip the gradient calculations to learn with reduced communication and computation. Simple rules are designed to detect slowly-varying gradients and, therefore, trigger the reuse of outdated gradients. The resultant gradient-based algorithms are termed Lazily Aggregated Gradient --- justifying our acronym LAG used henceforth. Theoretically, the merits of this contribution are: i) the convergence rate is the same as batch gradient descent in strongly-convex, convex, and nonconvex smooth cases; a","authors_text":"Georgios B. Giannakis, Tao Sun, Tianyi Chen, Wotao Yin","cross_cats":["cs.DC","cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T03:36:14Z","title":"LAG: Lazily Aggregated Gradient for Communication-Efficient Distributed Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09965","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:bd31378ca1067a374541c9db9860ba79fba15694758b4818e91f8d7ae26d8e7e","target":"record","created_at":"2026-05-18T00:14:37Z","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":"86a6481c18dd648f38f77828adb1be71a995be074d13f666596658c4018458f9","cross_cats_sorted":["cs.DC","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T03:36:14Z","title_canon_sha256":"44b823808522e2a92e1fb95af33344facfeea2e0294d5fb79f9c3af20a21875e"},"schema_version":"1.0","source":{"id":"1805.09965","kind":"arxiv","version":2}},"canonical_sha256":"4d0d2c5593381fa821bd6b4de4852e921edc8660afee0598b45fede731dcad6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d0d2c5593381fa821bd6b4de4852e921edc8660afee0598b45fede731dcad6f","first_computed_at":"2026-05-18T00:14:37.479636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:37.479636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"accsvspt/ZNVanZ5lwjc54HcEmZk6IlhmLTzokNjT1dh/NGrVD0dw+HUYW4ZB8NvkXC9r4gEx2tZb7v/maBhCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:37.480522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09965","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd31378ca1067a374541c9db9860ba79fba15694758b4818e91f8d7ae26d8e7e","sha256:d0462dd33642c62bc5cfdbfa5ee22b92820168e2656a5a18554a4ca1b8a155aa"],"state_sha256":"6f9bd8aa8614deeb17b2cbd13d6db80246e358e4e3a8a831275d8c1062a5299d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZV7XBSpJ8GBHX64gkFDUB4C09l75XY6Qn4xEBj7YVJa1RQX3HlgdT7DodUkhy3bUfnt6AS4OvsqaLF/uWp9gBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:48:05.264537Z","bundle_sha256":"6fff8f5fa16fc469b55121cf34dd94d97c5e195329b2b1c2d4b0ab5c70e03ec6"}}