{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:76SA3DJ27SUBLLC5T5RRHQCMS3","short_pith_number":"pith:76SA3DJ2","schema_version":"1.0","canonical_sha256":"ffa40d8d3afca815ac5d9f6313c04c96d3b2cd05f95d9608ab5b780572894185","source":{"kind":"arxiv","id":"2404.07609","version":1},"attestation_state":"computed","paper":{"title":"Achieving violation-free distributed optimization under coupling constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Changxin Liu, Dimos V. Dimarogonas, Karl H. Johansson, Xiao Tan, Xuyang Wu","submitted_at":"2024-04-11T09:56:51Z","abstract_excerpt":"Constraint satisfaction is a critical component in a wide range of engineering applications, including but not limited to safe multi-agent control and economic dispatch in power systems. This study explores violation-free distributed optimization techniques for problems characterized by separable objective functions and coupling constraints. First, we incorporate auxiliary decision variables together with a network-dependent linear mapping to each coupling constraint. For the reformulated problem, we show that the projection of its feasible set onto the space of primal variables is identical t"},"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":"2404.07609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-11T09:56:51Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"42e4541533b7ee9b29223635944fc6b13e7b1a9aa8674af829a1d37dbdbda35e","abstract_canon_sha256":"e508fdf3f5c5bce1b16c2c08f5e6e67df21cbeb7596c5e1e8b1d33963b5c1abc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:55.246398Z","signature_b64":"PI4LnP2ULcVODxPB6N8btsvVZo4e+lRg+2yq3/vS4kcGAy2TYfFNzUn0QwuTojT2iyCPHz6QE/2OTXLArh6zDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffa40d8d3afca815ac5d9f6313c04c96d3b2cd05f95d9608ab5b780572894185","last_reissued_at":"2026-07-05T08:06:55.245977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:55.245977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving violation-free distributed optimization under coupling constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Changxin Liu, Dimos V. Dimarogonas, Karl H. Johansson, Xiao Tan, Xuyang Wu","submitted_at":"2024-04-11T09:56:51Z","abstract_excerpt":"Constraint satisfaction is a critical component in a wide range of engineering applications, including but not limited to safe multi-agent control and economic dispatch in power systems. This study explores violation-free distributed optimization techniques for problems characterized by separable objective functions and coupling constraints. First, we incorporate auxiliary decision variables together with a network-dependent linear mapping to each coupling constraint. For the reformulated problem, we show that the projection of its feasible set onto the space of primal variables is identical t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07609","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.07609/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":"2404.07609","created_at":"2026-07-05T08:06:55.246044+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.07609v1","created_at":"2026-07-05T08:06:55.246044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07609","created_at":"2026-07-05T08:06:55.246044+00:00"},{"alias_kind":"pith_short_12","alias_value":"76SA3DJ27SUB","created_at":"2026-07-05T08:06:55.246044+00:00"},{"alias_kind":"pith_short_16","alias_value":"76SA3DJ27SUBLLC5","created_at":"2026-07-05T08:06:55.246044+00:00"},{"alias_kind":"pith_short_8","alias_value":"76SA3DJ2","created_at":"2026-07-05T08:06:55.246044+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.15768","citing_title":"Distributed model predictive control without terminal cost under inexact distributed optimization","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/76SA3DJ27SUBLLC5T5RRHQCMS3","json":"https://pith.science/pith/76SA3DJ27SUBLLC5T5RRHQCMS3.json","graph_json":"https://pith.science/api/pith-number/76SA3DJ27SUBLLC5T5RRHQCMS3/graph.json","events_json":"https://pith.science/api/pith-number/76SA3DJ27SUBLLC5T5RRHQCMS3/events.json","paper":"https://pith.science/paper/76SA3DJ2"},"agent_actions":{"view_html":"https://pith.science/pith/76SA3DJ27SUBLLC5T5RRHQCMS3","download_json":"https://pith.science/pith/76SA3DJ27SUBLLC5T5RRHQCMS3.json","view_paper":"https://pith.science/paper/76SA3DJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.07609&json=true","fetch_graph":"https://pith.science/api/pith-number/76SA3DJ27SUBLLC5T5RRHQCMS3/graph.json","fetch_events":"https://pith.science/api/pith-number/76SA3DJ27SUBLLC5T5RRHQCMS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76SA3DJ27SUBLLC5T5RRHQCMS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76SA3DJ27SUBLLC5T5RRHQCMS3/action/storage_attestation","attest_author":"https://pith.science/pith/76SA3DJ27SUBLLC5T5RRHQCMS3/action/author_attestation","sign_citation":"https://pith.science/pith/76SA3DJ27SUBLLC5T5RRHQCMS3/action/citation_signature","submit_replication":"https://pith.science/pith/76SA3DJ27SUBLLC5T5RRHQCMS3/action/replication_record"}},"created_at":"2026-07-05T08:06:55.246044+00:00","updated_at":"2026-07-05T08:06:55.246044+00:00"}