{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WEDTQMGXJS7PSTPLRJXMWKDYKB","short_pith_number":"pith:WEDTQMGX","schema_version":"1.0","canonical_sha256":"b1073830d74cbef94deb8a6ecb287850504f282b21a9100f3abafcac239d8fbc","source":{"kind":"arxiv","id":"2007.05141","version":3},"attestation_state":"computed","paper":{"title":"Accelerated Dual Averaging Methods for Decentralized Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Changxin Liu, Huiping Li, Wenli Du, Yang Shi","submitted_at":"2020-07-10T02:23:57Z","abstract_excerpt":"In this work, we study decentralized convex constrained optimization problems in networks. We focus on the dual averaging-based algorithmic framework that is well-documented to be superior in handling constraints and complex communication environments simultaneously. Two new decentralized dual averaging (DDA) algorithms are proposed. In the first one, a second-order dynamic average consensus protocol is tailored for DDA-type algorithms, which equips each agent with a provably more accurate estimate of the global dual variable than conventional schemes. We rigorously prove that the proposed alg"},"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":"2007.05141","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-10T02:23:57Z","cross_cats_sorted":[],"title_canon_sha256":"9941a4266242fc5778d3af6312041c9dbdfbad03515da88ed2d3fa559ac6b49a","abstract_canon_sha256":"58d3ed35109fc64b35416cee1fc6472f6cf5b4fc742bc74c52f7eba2f5b8619c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:05.935429Z","signature_b64":"cFhwK/n5PA2RckLCFl/6rcJkPZWT2jGdq8njXrJ88f/04HKdT0KjYXuCZPQ+0Qo8BUeaLck7DCSvK/tEt44ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1073830d74cbef94deb8a6ecb287850504f282b21a9100f3abafcac239d8fbc","last_reissued_at":"2026-07-05T04:48:05.935002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:05.935002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Dual Averaging Methods for Decentralized Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Changxin Liu, Huiping Li, Wenli Du, Yang Shi","submitted_at":"2020-07-10T02:23:57Z","abstract_excerpt":"In this work, we study decentralized convex constrained optimization problems in networks. We focus on the dual averaging-based algorithmic framework that is well-documented to be superior in handling constraints and complex communication environments simultaneously. Two new decentralized dual averaging (DDA) algorithms are proposed. In the first one, a second-order dynamic average consensus protocol is tailored for DDA-type algorithms, which equips each agent with a provably more accurate estimate of the global dual variable than conventional schemes. We rigorously prove that the proposed alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05141","kind":"arxiv","version":3},"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/2007.05141/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":"2007.05141","created_at":"2026-07-05T04:48:05.935058+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.05141v3","created_at":"2026-07-05T04:48:05.935058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05141","created_at":"2026-07-05T04:48:05.935058+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEDTQMGXJS7P","created_at":"2026-07-05T04:48:05.935058+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEDTQMGXJS7PSTPL","created_at":"2026-07-05T04:48:05.935058+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEDTQMGX","created_at":"2026-07-05T04:48:05.935058+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/WEDTQMGXJS7PSTPLRJXMWKDYKB","json":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB.json","graph_json":"https://pith.science/api/pith-number/WEDTQMGXJS7PSTPLRJXMWKDYKB/graph.json","events_json":"https://pith.science/api/pith-number/WEDTQMGXJS7PSTPLRJXMWKDYKB/events.json","paper":"https://pith.science/paper/WEDTQMGX"},"agent_actions":{"view_html":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB","download_json":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB.json","view_paper":"https://pith.science/paper/WEDTQMGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.05141&json=true","fetch_graph":"https://pith.science/api/pith-number/WEDTQMGXJS7PSTPLRJXMWKDYKB/graph.json","fetch_events":"https://pith.science/api/pith-number/WEDTQMGXJS7PSTPLRJXMWKDYKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB/action/storage_attestation","attest_author":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB/action/author_attestation","sign_citation":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB/action/citation_signature","submit_replication":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB/action/replication_record"}},"created_at":"2026-07-05T04:48:05.935058+00:00","updated_at":"2026-07-05T04:48:05.935058+00:00"}