{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6S5ZLGAQRIYSLNMSYCTCTXJN5E","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":"58d0906e1a275717faffd7d7515ba56c047a6dd74ee0336f7c62fc2b7411c6b7","cross_cats_sorted":["cs.MA","cs.SY","eess.SY","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-12T17:52:10Z","title_canon_sha256":"2aa1d457f277c083c8bcdcf1e2f5ee5bda2764181acec95280f553a4722b15a0"},"schema_version":"1.0","source":{"id":"2009.05837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.05837","created_at":"2026-07-05T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"2009.05837v1","created_at":"2026-07-05T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.05837","created_at":"2026-07-05T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"6S5ZLGAQRIYS","created_at":"2026-07-05T01:35:01Z"},{"alias_kind":"pith_short_16","alias_value":"6S5ZLGAQRIYSLNMS","created_at":"2026-07-05T01:35:01Z"},{"alias_kind":"pith_short_8","alias_value":"6S5ZLGAQ","created_at":"2026-07-05T01:35:01Z"}],"graph_snapshots":[{"event_id":"sha256:101ed852c11aa6852933a329ffaaf5be7df6d4a737f39df494b1dfd5c501189b","target":"graph","created_at":"2026-07-05T01:35:01Z","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/2009.05837/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decentralized optimization to minimize a finite sum of functions over a network of nodes has been a significant focus within control and signal processing research due to its natural relevance to optimal control and signal estimation problems. More recently, the emergence of sophisticated computing and large-scale data science needs have led to a resurgence of activity in this area. In this article, we discuss decentralized first-order gradient methods, which have found tremendous success in control, signal processing, and machine learning problems, where such methods, due to their simplicity,","authors_text":"Angelia Nedi\\'c, Ran Xin, Shi Pu, Usman A. Khan","cross_cats":["cs.MA","cs.SY","eess.SY","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-12T17:52:10Z","title":"A general framework for decentralized optimization with first-order methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.05837","kind":"arxiv","version":1},"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:283032ccd5d4208a1d78a884dfa2881db7033826932e5ca6794766186f23b4c2","target":"record","created_at":"2026-07-05T01:35:01Z","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":"58d0906e1a275717faffd7d7515ba56c047a6dd74ee0336f7c62fc2b7411c6b7","cross_cats_sorted":["cs.MA","cs.SY","eess.SY","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-12T17:52:10Z","title_canon_sha256":"2aa1d457f277c083c8bcdcf1e2f5ee5bda2764181acec95280f553a4722b15a0"},"schema_version":"1.0","source":{"id":"2009.05837","kind":"arxiv","version":1}},"canonical_sha256":"f4bb9598108a3125b592c0a629dd2de92224b04d1ec7f5629fb7875c8a81f29d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4bb9598108a3125b592c0a629dd2de92224b04d1ec7f5629fb7875c8a81f29d","first_computed_at":"2026-07-05T01:35:01.739482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:35:01.739482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kdLuB9pNu7KkYdvWotbX+WgX92deMRp5NYmf/zrasJVDOOrn9tpaJABqBwpTgWzMmUcayRhdPlbKo1rxzD3mAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:35:01.739872Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.05837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:283032ccd5d4208a1d78a884dfa2881db7033826932e5ca6794766186f23b4c2","sha256:101ed852c11aa6852933a329ffaaf5be7df6d4a737f39df494b1dfd5c501189b"],"state_sha256":"836dcf1cbf9c3fb3a008315b920e0b101adb55f10b93d5e3d93fa80fdf0d38d0"}