{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WWJA3LRAFGH2RPCNBGSN3V3ZPO","short_pith_number":"pith:WWJA3LRA","schema_version":"1.0","canonical_sha256":"b5920dae20298fa8bc4d09a4ddd7797b859e15416c1749210416cefb281094ff","source":{"kind":"arxiv","id":"1503.07678","version":1},"attestation_state":"computed","paper":{"title":"Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Simonetto, Hadi Jamali-Rad","submitted_at":"2015-03-26T10:31:10Z","abstract_excerpt":"Dual decomposition has been successfully employed in a variety of distributed convex optimization problems solved by a network of computing and communicating nodes. Often, when the cost function is separable but the constraints are coupled, the dual decomposition scheme involves local parallel subgradient calculations and a global subgradient update performed by a master node. In this paper, we propose a consensus-based dual decomposition to remove the need for such a master node and still enable the computing nodes to generate an approximate dual solution for the underlying convex optimizatio"},"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":"1503.07678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-26T10:31:10Z","cross_cats_sorted":[],"title_canon_sha256":"3f93f2009bf7f8154956c7a473dd870342b6d6e7202b6b3324cf5d7612a56ec8","abstract_canon_sha256":"699733af272cfe9b28087751a4c269bcefd3db4fa915bff721d125b50ac1fc9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:09.637496Z","signature_b64":"dDSns1zgKkvcxxL4G9y9qnk3/Imsl7AvpxpoFLEOwCev43WdCEPm5orAxNR+xrbEjDWLuBei39r0+Tntk6EEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5920dae20298fa8bc4d09a4ddd7797b859e15416c1749210416cefb281094ff","last_reissued_at":"2026-05-18T00:35:09.637147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:09.637147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Simonetto, Hadi Jamali-Rad","submitted_at":"2015-03-26T10:31:10Z","abstract_excerpt":"Dual decomposition has been successfully employed in a variety of distributed convex optimization problems solved by a network of computing and communicating nodes. Often, when the cost function is separable but the constraints are coupled, the dual decomposition scheme involves local parallel subgradient calculations and a global subgradient update performed by a master node. In this paper, we propose a consensus-based dual decomposition to remove the need for such a master node and still enable the computing nodes to generate an approximate dual solution for the underlying convex optimizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07678","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":""},"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":"1503.07678","created_at":"2026-05-18T00:35:09.637203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07678v1","created_at":"2026-05-18T00:35:09.637203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07678","created_at":"2026-05-18T00:35:09.637203+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWJA3LRAFGH2","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWJA3LRAFGH2RPCN","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWJA3LRA","created_at":"2026-05-18T12:29:47.479230+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/WWJA3LRAFGH2RPCNBGSN3V3ZPO","json":"https://pith.science/pith/WWJA3LRAFGH2RPCNBGSN3V3ZPO.json","graph_json":"https://pith.science/api/pith-number/WWJA3LRAFGH2RPCNBGSN3V3ZPO/graph.json","events_json":"https://pith.science/api/pith-number/WWJA3LRAFGH2RPCNBGSN3V3ZPO/events.json","paper":"https://pith.science/paper/WWJA3LRA"},"agent_actions":{"view_html":"https://pith.science/pith/WWJA3LRAFGH2RPCNBGSN3V3ZPO","download_json":"https://pith.science/pith/WWJA3LRAFGH2RPCNBGSN3V3ZPO.json","view_paper":"https://pith.science/paper/WWJA3LRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07678&json=true","fetch_graph":"https://pith.science/api/pith-number/WWJA3LRAFGH2RPCNBGSN3V3ZPO/graph.json","fetch_events":"https://pith.science/api/pith-number/WWJA3LRAFGH2RPCNBGSN3V3ZPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWJA3LRAFGH2RPCNBGSN3V3ZPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWJA3LRAFGH2RPCNBGSN3V3ZPO/action/storage_attestation","attest_author":"https://pith.science/pith/WWJA3LRAFGH2RPCNBGSN3V3ZPO/action/author_attestation","sign_citation":"https://pith.science/pith/WWJA3LRAFGH2RPCNBGSN3V3ZPO/action/citation_signature","submit_replication":"https://pith.science/pith/WWJA3LRAFGH2RPCNBGSN3V3ZPO/action/replication_record"}},"created_at":"2026-05-18T00:35:09.637203+00:00","updated_at":"2026-05-18T00:35:09.637203+00:00"}