{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NJ3OAOPPNJ3LME7N2GWJVD4ZZZ","short_pith_number":"pith:NJ3OAOPP","schema_version":"1.0","canonical_sha256":"6a76e039ef6a76b613edd1ac9a8f99ce6fa6d4b49379112fe74fb002fb621cf1","source":{"kind":"arxiv","id":"1804.09105","version":1},"attestation_state":"computed","paper":{"title":"A Duality-Based Approach for Distributed Optimization with Coupling Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2018-04-24T15:50:04Z","abstract_excerpt":"In this paper we consider a distributed optimization scenario in which a set of agents has to solve a convex optimization problem with separable cost function, local constraint sets and a coupling inequality constraint. We propose a novel 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 intuitive structure. That is, each node solves a local version of the original problem relaxation, and updates suitable dual variables. We"},"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":"1804.09105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-24T15:50:04Z","cross_cats_sorted":[],"title_canon_sha256":"442609a0c81fd09c3a1d9f037d1ba30733c1d18c24726837be0b62636d940c31","abstract_canon_sha256":"affbacc7a516048cbe96f398d5bc386c5de83f3d4a128c1ff6d17870259d582d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:36.313257Z","signature_b64":"H3XP1GNk/luHiRX2liZQ8qwUZ6vyBeUYAeZUXHgG9CG2HNrOihLHJACYyStYCLy8P9p0iz4GGTCw8NCLQu1mBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a76e039ef6a76b613edd1ac9a8f99ce6fa6d4b49379112fe74fb002fb621cf1","last_reissued_at":"2026-05-18T00:17:36.312648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:36.312648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Duality-Based Approach for Distributed Optimization with Coupling Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2018-04-24T15:50:04Z","abstract_excerpt":"In this paper we consider a distributed optimization scenario in which a set of agents has to solve a convex optimization problem with separable cost function, local constraint sets and a coupling inequality constraint. We propose a novel 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 intuitive structure. That is, each node solves a local version of the original problem relaxation, and updates suitable dual variables. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09105","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":"1804.09105","created_at":"2026-05-18T00:17:36.312736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09105v1","created_at":"2026-05-18T00:17:36.312736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09105","created_at":"2026-05-18T00:17:36.312736+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJ3OAOPPNJ3L","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJ3OAOPPNJ3LME7N","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJ3OAOPP","created_at":"2026-05-18T12:32:40.477152+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/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ","json":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ.json","graph_json":"https://pith.science/api/pith-number/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/graph.json","events_json":"https://pith.science/api/pith-number/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/events.json","paper":"https://pith.science/paper/NJ3OAOPP"},"agent_actions":{"view_html":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ","download_json":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ.json","view_paper":"https://pith.science/paper/NJ3OAOPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09105&json=true","fetch_graph":"https://pith.science/api/pith-number/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/action/storage_attestation","attest_author":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/action/author_attestation","sign_citation":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/action/citation_signature","submit_replication":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/action/replication_record"}},"created_at":"2026-05-18T00:17:36.312736+00:00","updated_at":"2026-05-18T00:17:36.312736+00:00"}