{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X7URT345IMJHSE6P4VXT2DIQRM","short_pith_number":"pith:X7URT345","schema_version":"1.0","canonical_sha256":"bfe919ef9d43127913cfe56f3d0d108b1282a5bed20a6bed74a497d6b61008dd","source":{"kind":"arxiv","id":"1908.06634","version":4},"attestation_state":"computed","paper":{"title":"Cluster-based Distributed Augmented Lagrangian Algorithm for a Class of Constrained Convex Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.MA","authors_text":"Hossein Moradian, Solmaz S. Kia","submitted_at":"2019-08-19T08:14:07Z","abstract_excerpt":"We propose a distributed solution for a constrained convex optimization problem over a network of clustered agents each consisted of a set of subagents. The communication range of the clustered agents is such that they can form a connected undirected graph topology. The total cost in this optimization problem is the sum of the local convex costs of the subagents of each cluster. We seek a minimizer of this cost subject to a set of affine equality constraints, and a set of affine inequality constraints specifying the bounds on the decision variables if such bounds exist. We design our distribut"},"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":"1908.06634","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-08-19T08:14:07Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b11b6b4e71f787d6b8084c1ca09d895fac7296c913cd6c1074e81677c1c3819a","abstract_canon_sha256":"984466c963f739a94f140b02cc6dbf90c7a43e6639526627a4426d00ac25d29c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:47.441954Z","signature_b64":"Z++e4tJnTVP3+VUeGw09eQD06egytNyuAg8Oi5xhvQoNsHPc6xaTWk7Rt5sZuHx/46kWCY79B0ppcZnlRIkpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfe919ef9d43127913cfe56f3d0d108b1282a5bed20a6bed74a497d6b61008dd","last_reissued_at":"2026-07-05T02:28:47.441598Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:47.441598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cluster-based Distributed Augmented Lagrangian Algorithm for a Class of Constrained Convex Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.MA","authors_text":"Hossein Moradian, Solmaz S. Kia","submitted_at":"2019-08-19T08:14:07Z","abstract_excerpt":"We propose a distributed solution for a constrained convex optimization problem over a network of clustered agents each consisted of a set of subagents. The communication range of the clustered agents is such that they can form a connected undirected graph topology. The total cost in this optimization problem is the sum of the local convex costs of the subagents of each cluster. We seek a minimizer of this cost subject to a set of affine equality constraints, and a set of affine inequality constraints specifying the bounds on the decision variables if such bounds exist. We design our distribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06634","kind":"arxiv","version":4},"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/1908.06634/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":"1908.06634","created_at":"2026-07-05T02:28:47.441655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06634v4","created_at":"2026-07-05T02:28:47.441655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06634","created_at":"2026-07-05T02:28:47.441655+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7URT345IMJH","created_at":"2026-07-05T02:28:47.441655+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7URT345IMJHSE6P","created_at":"2026-07-05T02:28:47.441655+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7URT345","created_at":"2026-07-05T02:28:47.441655+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/X7URT345IMJHSE6P4VXT2DIQRM","json":"https://pith.science/pith/X7URT345IMJHSE6P4VXT2DIQRM.json","graph_json":"https://pith.science/api/pith-number/X7URT345IMJHSE6P4VXT2DIQRM/graph.json","events_json":"https://pith.science/api/pith-number/X7URT345IMJHSE6P4VXT2DIQRM/events.json","paper":"https://pith.science/paper/X7URT345"},"agent_actions":{"view_html":"https://pith.science/pith/X7URT345IMJHSE6P4VXT2DIQRM","download_json":"https://pith.science/pith/X7URT345IMJHSE6P4VXT2DIQRM.json","view_paper":"https://pith.science/paper/X7URT345","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06634&json=true","fetch_graph":"https://pith.science/api/pith-number/X7URT345IMJHSE6P4VXT2DIQRM/graph.json","fetch_events":"https://pith.science/api/pith-number/X7URT345IMJHSE6P4VXT2DIQRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7URT345IMJHSE6P4VXT2DIQRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7URT345IMJHSE6P4VXT2DIQRM/action/storage_attestation","attest_author":"https://pith.science/pith/X7URT345IMJHSE6P4VXT2DIQRM/action/author_attestation","sign_citation":"https://pith.science/pith/X7URT345IMJHSE6P4VXT2DIQRM/action/citation_signature","submit_replication":"https://pith.science/pith/X7URT345IMJHSE6P4VXT2DIQRM/action/replication_record"}},"created_at":"2026-07-05T02:28:47.441655+00:00","updated_at":"2026-07-05T02:28:47.441655+00:00"}