{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6S5ZLGAQRIYSLNMSYCTCTXJN5E","short_pith_number":"pith:6S5ZLGAQ","schema_version":"1.0","canonical_sha256":"f4bb9598108a3125b592c0a629dd2de92224b04d1ec7f5629fb7875c8a81f29d","source":{"kind":"arxiv","id":"2009.05837","version":1},"attestation_state":"computed","paper":{"title":"A general framework for decentralized optimization with first-order methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY","eess.SY","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Angelia Nedi\\'c, Ran Xin, Shi Pu, Usman A. Khan","submitted_at":"2020-09-12T17:52:10Z","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,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2009.05837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-12T17:52:10Z","cross_cats_sorted":["cs.MA","cs.SY","eess.SY","math.OC","stat.ML"],"title_canon_sha256":"2aa1d457f277c083c8bcdcf1e2f5ee5bda2764181acec95280f553a4722b15a0","abstract_canon_sha256":"58d0906e1a275717faffd7d7515ba56c047a6dd74ee0336f7c62fc2b7411c6b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:35:01.739872Z","signature_b64":"kdLuB9pNu7KkYdvWotbX+WgX92deMRp5NYmf/zrasJVDOOrn9tpaJABqBwpTgWzMmUcayRhdPlbKo1rxzD3mAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4bb9598108a3125b592c0a629dd2de92224b04d1ec7f5629fb7875c8a81f29d","last_reissued_at":"2026-07-05T01:35:01.739482Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:35:01.739482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A general framework for decentralized optimization with first-order methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY","eess.SY","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Angelia Nedi\\'c, Ran Xin, Shi Pu, Usman A. Khan","submitted_at":"2020-09-12T17:52:10Z","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,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.05837","kind":"arxiv","version":1},"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/2009.05837/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2009.05837","created_at":"2026-07-05T01:35:01.739544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.05837v1","created_at":"2026-07-05T01:35:01.739544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.05837","created_at":"2026-07-05T01:35:01.739544+00:00"},{"alias_kind":"pith_short_12","alias_value":"6S5ZLGAQRIYS","created_at":"2026-07-05T01:35:01.739544+00:00"},{"alias_kind":"pith_short_16","alias_value":"6S5ZLGAQRIYSLNMS","created_at":"2026-07-05T01:35:01.739544+00:00"},{"alias_kind":"pith_short_8","alias_value":"6S5ZLGAQ","created_at":"2026-07-05T01:35:01.739544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6S5ZLGAQRIYSLNMSYCTCTXJN5E","json":"https://pith.science/pith/6S5ZLGAQRIYSLNMSYCTCTXJN5E.json","graph_json":"https://pith.science/api/pith-number/6S5ZLGAQRIYSLNMSYCTCTXJN5E/graph.json","events_json":"https://pith.science/api/pith-number/6S5ZLGAQRIYSLNMSYCTCTXJN5E/events.json","paper":"https://pith.science/paper/6S5ZLGAQ"},"agent_actions":{"view_html":"https://pith.science/pith/6S5ZLGAQRIYSLNMSYCTCTXJN5E","download_json":"https://pith.science/pith/6S5ZLGAQRIYSLNMSYCTCTXJN5E.json","view_paper":"https://pith.science/paper/6S5ZLGAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.05837&json=true","fetch_graph":"https://pith.science/api/pith-number/6S5ZLGAQRIYSLNMSYCTCTXJN5E/graph.json","fetch_events":"https://pith.science/api/pith-number/6S5ZLGAQRIYSLNMSYCTCTXJN5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6S5ZLGAQRIYSLNMSYCTCTXJN5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6S5ZLGAQRIYSLNMSYCTCTXJN5E/action/storage_attestation","attest_author":"https://pith.science/pith/6S5ZLGAQRIYSLNMSYCTCTXJN5E/action/author_attestation","sign_citation":"https://pith.science/pith/6S5ZLGAQRIYSLNMSYCTCTXJN5E/action/citation_signature","submit_replication":"https://pith.science/pith/6S5ZLGAQRIYSLNMSYCTCTXJN5E/action/replication_record"}},"created_at":"2026-07-05T01:35:01.739544+00:00","updated_at":"2026-07-05T01:35:01.739544+00:00"}