{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MB4SKPVUJ33SVXBYQOIYCTNVEH","short_pith_number":"pith:MB4SKPVU","canonical_record":{"source":{"id":"1701.03961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-14T19:48:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d0971cb5b21be5250f22897248402cb99fbe073591b8833d4b38990ad4fed58f","abstract_canon_sha256":"e49374ac57f9ed68cff9b021b24425408c3f2ce6f63be0d121f64ead41033268"},"schema_version":"1.0"},"canonical_sha256":"6079253eb44ef72adc388391814db521f568475b1ec98a071ea3dfd7f9a74bbe","source":{"kind":"arxiv","id":"1701.03961","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03961","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03961v2","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03961","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"MB4SKPVUJ33S","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MB4SKPVUJ33SVXBY","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MB4SKPVU","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MB4SKPVUJ33SVXBYQOIYCTNVEH","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-14T19:48:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d0971cb5b21be5250f22897248402cb99fbe073591b8833d4b38990ad4fed58f","abstract_canon_sha256":"e49374ac57f9ed68cff9b021b24425408c3f2ce6f63be0d121f64ead41033268"},"schema_version":"1.0"},"canonical_sha256":"6079253eb44ef72adc388391814db521f568475b1ec98a071ea3dfd7f9a74bbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:24.714519Z","signature_b64":"FoVGMGPumNTh/e1bUWTyw74pRaoW2LxxRngYhZtoE01i3BCO5GVD380W4vmtaLinZ7TbT7X+cGpKt0+KV9NYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6079253eb44ef72adc388391814db521f568475b1ec98a071ea3dfd7f9a74bbe","last_reissued_at":"2026-05-18T00:51:24.713947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:24.713947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03961","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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzRLHCMR799HNfx4S8L0GIHy9m7P3NeSOx+b7rRQqhIA0/f91JCLXzgWo+X55ISVxJsDVzhh+9qnz6lSLD0+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:47:27.345450Z"},"content_sha256":"82f347f2606942398fdd2a2bcf62b4db4bdeabfbcad0d7a4acb74250bf020646","schema_version":"1.0","event_id":"sha256:82f347f2606942398fdd2a2bcf62b4db4bdeabfbcad0d7a4acb74250bf020646"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MB4SKPVUJ33SVXBYQOIYCTNVEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Efficient Algorithms for Decentralized and Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Guanghui Lan, Soomin Lee, Yi Zhou","submitted_at":"2017-01-14T19:48:49Z","abstract_excerpt":"We present a new class of decentralized first-order methods for nonsmooth and stochastic optimization problems defined over multiagent networks. Considering that communication is a major bottleneck in decentralized optimization, our main goal in this paper is to develop algorithmic frameworks which can significantly reduce the number of inter-node communications. We first propose a decentralized primal-dual method which can find an $\\epsilon$-solution both in terms of functional optimality gap and feasibility residual in $O(1/\\epsilon)$ inter-node communication rounds when the objective functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03961","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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V9arKvXuJXxatPAfqvYc5vBM5TmezRzlsarUEf7APzrG+ZPnF/jYmrcdIcmW40onlbm/x7ABfHgFvTDimGpWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:47:27.345799Z"},"content_sha256":"293a7fb9dd48b01c619ab62050722fac448a605e46ec1e07eab4cbd1d46ce8cd","schema_version":"1.0","event_id":"sha256:293a7fb9dd48b01c619ab62050722fac448a605e46ec1e07eab4cbd1d46ce8cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MB4SKPVUJ33SVXBYQOIYCTNVEH/bundle.json","state_url":"https://pith.science/pith/MB4SKPVUJ33SVXBYQOIYCTNVEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MB4SKPVUJ33SVXBYQOIYCTNVEH/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-01T11:47:27Z","links":{"resolver":"https://pith.science/pith/MB4SKPVUJ33SVXBYQOIYCTNVEH","bundle":"https://pith.science/pith/MB4SKPVUJ33SVXBYQOIYCTNVEH/bundle.json","state":"https://pith.science/pith/MB4SKPVUJ33SVXBYQOIYCTNVEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MB4SKPVUJ33SVXBYQOIYCTNVEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MB4SKPVUJ33SVXBYQOIYCTNVEH","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":"e49374ac57f9ed68cff9b021b24425408c3f2ce6f63be0d121f64ead41033268","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-14T19:48:49Z","title_canon_sha256":"d0971cb5b21be5250f22897248402cb99fbe073591b8833d4b38990ad4fed58f"},"schema_version":"1.0","source":{"id":"1701.03961","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03961","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03961v2","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03961","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"MB4SKPVUJ33S","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MB4SKPVUJ33SVXBY","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MB4SKPVU","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:293a7fb9dd48b01c619ab62050722fac448a605e46ec1e07eab4cbd1d46ce8cd","target":"graph","created_at":"2026-05-18T00:51:24Z","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":"We present a new class of decentralized first-order methods for nonsmooth and stochastic optimization problems defined over multiagent networks. Considering that communication is a major bottleneck in decentralized optimization, our main goal in this paper is to develop algorithmic frameworks which can significantly reduce the number of inter-node communications. We first propose a decentralized primal-dual method which can find an $\\epsilon$-solution both in terms of functional optimality gap and feasibility residual in $O(1/\\epsilon)$ inter-node communication rounds when the objective functi","authors_text":"Guanghui Lan, Soomin Lee, Yi Zhou","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-14T19:48:49Z","title":"Communication-Efficient Algorithms for Decentralized and Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03961","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:82f347f2606942398fdd2a2bcf62b4db4bdeabfbcad0d7a4acb74250bf020646","target":"record","created_at":"2026-05-18T00:51:24Z","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":"e49374ac57f9ed68cff9b021b24425408c3f2ce6f63be0d121f64ead41033268","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-14T19:48:49Z","title_canon_sha256":"d0971cb5b21be5250f22897248402cb99fbe073591b8833d4b38990ad4fed58f"},"schema_version":"1.0","source":{"id":"1701.03961","kind":"arxiv","version":2}},"canonical_sha256":"6079253eb44ef72adc388391814db521f568475b1ec98a071ea3dfd7f9a74bbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6079253eb44ef72adc388391814db521f568475b1ec98a071ea3dfd7f9a74bbe","first_computed_at":"2026-05-18T00:51:24.713947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:24.713947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FoVGMGPumNTh/e1bUWTyw74pRaoW2LxxRngYhZtoE01i3BCO5GVD380W4vmtaLinZ7TbT7X+cGpKt0+KV9NYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:24.714519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03961","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82f347f2606942398fdd2a2bcf62b4db4bdeabfbcad0d7a4acb74250bf020646","sha256:293a7fb9dd48b01c619ab62050722fac448a605e46ec1e07eab4cbd1d46ce8cd"],"state_sha256":"8ba2d50286df15c5fd85952e34a082cb0b897eaaec79eb568362ea06cd2114df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8bTpsjXYbf+WEpt8Bx/Rko0YejamXJXAbsNGqmYmH7FYjAzK0M79izapzVuWFZ/uyS7ABrWn/Z206rO7bg/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:47:27.347757Z","bundle_sha256":"98e65409fd69af40c4afdc99b0b9bb50206ba0af0fe938293b3bfd283b6281cd"}}