{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B4TTELSJSWXSP7BUYTKMFKX53T","short_pith_number":"pith:B4TTELSJ","schema_version":"1.0","canonical_sha256":"0f27322e4995af27fc34c4d4c2aafddcdaef1deaaeacec416fe4a58920444cb6","source":{"kind":"arxiv","id":"1711.09221","version":2},"attestation_state":"computed","paper":{"title":"Constraint Coupled Distributed Optimization: a Relaxation and Duality Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.SY","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2017-11-25T09:15:43Z","abstract_excerpt":"In this paper we consider a general, challenging distributed optimization set-up arising in several important network control applications. Agents of a network want to minimize the sum of local cost functions, each one depending on a local variable, subject to local and coupling constraints, with the latter involving all the decision variables. We propose a novel fully distributed algorithm based on a relaxation of the primal problem and an elegant exploration of duality theory. Despite its complex derivation, based on several duality steps, the distributed algorithm has a very simple and intu"},"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":"1711.09221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-25T09:15:43Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"7b15545e4f67753e68a761d6e6b357aa7ab1447675979b0c810fab85545133df","abstract_canon_sha256":"251362422b4915963f880ee7c3c8dfc156b52b7507d102d51344c83f5ac3b536"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:15.523527Z","signature_b64":"8XKBZruqlwkQJzIfkahTXW9e9gDJb7x9CY9ZDJ7xp5oyZCYiWgBS5Iyj88UQMPhqcx1zGIjluG1bjRPGuJngAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f27322e4995af27fc34c4d4c2aafddcdaef1deaaeacec416fe4a58920444cb6","last_reissued_at":"2026-05-18T00:13:15.522861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:15.522861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constraint Coupled Distributed Optimization: a Relaxation and Duality Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.SY","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2017-11-25T09:15:43Z","abstract_excerpt":"In this paper we consider a general, challenging distributed optimization set-up arising in several important network control applications. Agents of a network want to minimize the sum of local cost functions, each one depending on a local variable, subject to local and coupling constraints, with the latter involving all the decision variables. We propose a novel fully distributed algorithm based on a relaxation of the primal problem and an elegant exploration of duality theory. Despite its complex derivation, based on several duality steps, the distributed algorithm has a very simple and intu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09221","kind":"arxiv","version":2},"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":"1711.09221","created_at":"2026-05-18T00:13:15.522949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.09221v2","created_at":"2026-05-18T00:13:15.522949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09221","created_at":"2026-05-18T00:13:15.522949+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4TTELSJSWXS","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4TTELSJSWXSP7BU","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4TTELSJ","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.10860","citing_title":"Tracking-ADMM for Distributed Constraint-Coupled Optimization","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T","json":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T.json","graph_json":"https://pith.science/api/pith-number/B4TTELSJSWXSP7BUYTKMFKX53T/graph.json","events_json":"https://pith.science/api/pith-number/B4TTELSJSWXSP7BUYTKMFKX53T/events.json","paper":"https://pith.science/paper/B4TTELSJ"},"agent_actions":{"view_html":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T","download_json":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T.json","view_paper":"https://pith.science/paper/B4TTELSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.09221&json=true","fetch_graph":"https://pith.science/api/pith-number/B4TTELSJSWXSP7BUYTKMFKX53T/graph.json","fetch_events":"https://pith.science/api/pith-number/B4TTELSJSWXSP7BUYTKMFKX53T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T/action/storage_attestation","attest_author":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T/action/author_attestation","sign_citation":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T/action/citation_signature","submit_replication":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T/action/replication_record"}},"created_at":"2026-05-18T00:13:15.522949+00:00","updated_at":"2026-05-18T00:13:15.522949+00:00"}