{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:WEDTQMGXJS7PSTPLRJXMWKDYKB","short_pith_number":"pith:WEDTQMGX","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"},"canonical_sha256":"b1073830d74cbef94deb8a6ecb287850504f282b21a9100f3abafcac239d8fbc","source":{"kind":"arxiv","id":"2007.05141","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.05141","created_at":"2026-07-05T04:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"2007.05141v3","created_at":"2026-07-05T04:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05141","created_at":"2026-07-05T04:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"WEDTQMGXJS7P","created_at":"2026-07-05T04:48:05Z"},{"alias_kind":"pith_short_16","alias_value":"WEDTQMGXJS7PSTPL","created_at":"2026-07-05T04:48:05Z"},{"alias_kind":"pith_short_8","alias_value":"WEDTQMGX","created_at":"2026-07-05T04:48:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:WEDTQMGXJS7PSTPLRJXMWKDYKB","target":"record","payload":{"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"},"canonical_sha256":"b1073830d74cbef94deb8a6ecb287850504f282b21a9100f3abafcac239d8fbc","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"},"source_kind":"arxiv","source_id":"2007.05141","source_version":3,"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-07-05T04:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+i/eRNRsFk8pslSLzLA2ywAVZBdDWkd/znriwtg3JVPqstvoGknaKEOexE8/w8rPFur1jZodgyU3pCysGt1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:16:32.914217Z"},"content_sha256":"0a99fb264fc3f54de6c8e877587f5a54561292a97c816bc13eb91c20953397fa","schema_version":"1.0","event_id":"sha256:0a99fb264fc3f54de6c8e877587f5a54561292a97c816bc13eb91c20953397fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:WEDTQMGXJS7PSTPLRJXMWKDYKB","target":"graph","payload":{"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"},"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-07-05T04:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jjrBLi0jdN5UAGp+cXHtgU0NKMsGY1s3Su4oaD7HcRM6bTEfJVDtxi+RF6l4i6sJy+RIr6PhR0h4+x9OnUyEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:16:32.914612Z"},"content_sha256":"3d1586e6fd161b6c44ab4d1122dd3e63eaeacc27e521f326999674396112800e","schema_version":"1.0","event_id":"sha256:3d1586e6fd161b6c44ab4d1122dd3e63eaeacc27e521f326999674396112800e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB/bundle.json","state_url":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB/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-07-06T15:16:32Z","links":{"resolver":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB","bundle":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB/bundle.json","state":"https://pith.science/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEDTQMGXJS7PSTPLRJXMWKDYKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:WEDTQMGXJS7PSTPLRJXMWKDYKB","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":"58d3ed35109fc64b35416cee1fc6472f6cf5b4fc742bc74c52f7eba2f5b8619c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-10T02:23:57Z","title_canon_sha256":"9941a4266242fc5778d3af6312041c9dbdfbad03515da88ed2d3fa559ac6b49a"},"schema_version":"1.0","source":{"id":"2007.05141","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.05141","created_at":"2026-07-05T04:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"2007.05141v3","created_at":"2026-07-05T04:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05141","created_at":"2026-07-05T04:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"WEDTQMGXJS7P","created_at":"2026-07-05T04:48:05Z"},{"alias_kind":"pith_short_16","alias_value":"WEDTQMGXJS7PSTPL","created_at":"2026-07-05T04:48:05Z"},{"alias_kind":"pith_short_8","alias_value":"WEDTQMGX","created_at":"2026-07-05T04:48:05Z"}],"graph_snapshots":[{"event_id":"sha256:3d1586e6fd161b6c44ab4d1122dd3e63eaeacc27e521f326999674396112800e","target":"graph","created_at":"2026-07-05T04:48:05Z","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/2007.05141/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Changxin Liu, Huiping Li, Wenli Du, Yang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-10T02:23:57Z","title":"Accelerated Dual Averaging Methods for Decentralized Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05141","kind":"arxiv","version":3},"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:0a99fb264fc3f54de6c8e877587f5a54561292a97c816bc13eb91c20953397fa","target":"record","created_at":"2026-07-05T04:48:05Z","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":"58d3ed35109fc64b35416cee1fc6472f6cf5b4fc742bc74c52f7eba2f5b8619c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-10T02:23:57Z","title_canon_sha256":"9941a4266242fc5778d3af6312041c9dbdfbad03515da88ed2d3fa559ac6b49a"},"schema_version":"1.0","source":{"id":"2007.05141","kind":"arxiv","version":3}},"canonical_sha256":"b1073830d74cbef94deb8a6ecb287850504f282b21a9100f3abafcac239d8fbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1073830d74cbef94deb8a6ecb287850504f282b21a9100f3abafcac239d8fbc","first_computed_at":"2026-07-05T04:48:05.935002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:48:05.935002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cFhwK/n5PA2RckLCFl/6rcJkPZWT2jGdq8njXrJ88f/04HKdT0KjYXuCZPQ+0Qo8BUeaLck7DCSvK/tEt44ACw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:48:05.935429Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.05141","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a99fb264fc3f54de6c8e877587f5a54561292a97c816bc13eb91c20953397fa","sha256:3d1586e6fd161b6c44ab4d1122dd3e63eaeacc27e521f326999674396112800e"],"state_sha256":"82f6187f3e597ec48cf0ff430cbab5e002a1924877e16d3d74f72326ec1530a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wD5eLAsyjGicv6DOlo3cLEejRoDKdWYTE/k6aq1qyLTTUGdvEthby1vcvTjvPy4Y1lcKCYQT+KCjsqm0rqSHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:16:32.916596Z","bundle_sha256":"f3976a945ab9eb2b9d74c85b2e7063877c5dc7cdf3792ec36ac234dd47ebda2e"}}