{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AIC66H6YMMUNN5QEQVFYOUCIZQ","short_pith_number":"pith:AIC66H6Y","schema_version":"1.0","canonical_sha256":"0205ef1fd86328d6f604854b875048cc323865ea9f0e8b8b8277dc6813e18239","source":{"kind":"arxiv","id":"1510.08580","version":2},"attestation_state":"computed","paper":{"title":"Primal-Dual Algorithm for Distributed Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hai-Tao Fang, Han-Fu Chen, Jinlong Lei","submitted_at":"2015-10-29T07:07:40Z","abstract_excerpt":"The paper studies a distributed constrained optimization problem, where multiple agents connected in a network collectively minimize the sum of individual objective functions subject to a global constraint being an intersection of the local constraint sets assigned to the agents. Based on the augmented Lagrange method, a distributed primal-dual algorithm with a projection operation included is proposed to solve the problem. It is shown that with appropriately chosen constant step size, the local estimates derived at all agents asymptotically reach a consensus at an optimal solution. In additio"},"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":"1510.08580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T07:07:40Z","cross_cats_sorted":[],"title_canon_sha256":"f54b9b6fcd295d6bab76e651bcbb103121abb5b1dd5c244d86d1745e8ca7fbee","abstract_canon_sha256":"eeab8a674c8af3c0a6c42b66f9b5c6a9f83d8aef23bdf4c04c26f0f3c46bf12e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:34.041576Z","signature_b64":"hsBPuS2DY73/lBFR4LODgAsY+cK218DQI4dIrTk5CXpkGMnm+ha0xvc/e8aSedVyhxjld2ZeWDtB9g7na/raBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0205ef1fd86328d6f604854b875048cc323865ea9f0e8b8b8277dc6813e18239","last_reissued_at":"2026-05-18T01:19:34.041138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:34.041138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primal-Dual Algorithm for Distributed Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hai-Tao Fang, Han-Fu Chen, Jinlong Lei","submitted_at":"2015-10-29T07:07:40Z","abstract_excerpt":"The paper studies a distributed constrained optimization problem, where multiple agents connected in a network collectively minimize the sum of individual objective functions subject to a global constraint being an intersection of the local constraint sets assigned to the agents. Based on the augmented Lagrange method, a distributed primal-dual algorithm with a projection operation included is proposed to solve the problem. It is shown that with appropriately chosen constant step size, the local estimates derived at all agents asymptotically reach a consensus at an optimal solution. In additio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08580","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":"1510.08580","created_at":"2026-05-18T01:19:34.041201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08580v2","created_at":"2026-05-18T01:19:34.041201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08580","created_at":"2026-05-18T01:19:34.041201+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIC66H6YMMUN","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIC66H6YMMUNN5QE","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIC66H6Y","created_at":"2026-05-18T12:29:10.953037+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/AIC66H6YMMUNN5QEQVFYOUCIZQ","json":"https://pith.science/pith/AIC66H6YMMUNN5QEQVFYOUCIZQ.json","graph_json":"https://pith.science/api/pith-number/AIC66H6YMMUNN5QEQVFYOUCIZQ/graph.json","events_json":"https://pith.science/api/pith-number/AIC66H6YMMUNN5QEQVFYOUCIZQ/events.json","paper":"https://pith.science/paper/AIC66H6Y"},"agent_actions":{"view_html":"https://pith.science/pith/AIC66H6YMMUNN5QEQVFYOUCIZQ","download_json":"https://pith.science/pith/AIC66H6YMMUNN5QEQVFYOUCIZQ.json","view_paper":"https://pith.science/paper/AIC66H6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08580&json=true","fetch_graph":"https://pith.science/api/pith-number/AIC66H6YMMUNN5QEQVFYOUCIZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AIC66H6YMMUNN5QEQVFYOUCIZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIC66H6YMMUNN5QEQVFYOUCIZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIC66H6YMMUNN5QEQVFYOUCIZQ/action/storage_attestation","attest_author":"https://pith.science/pith/AIC66H6YMMUNN5QEQVFYOUCIZQ/action/author_attestation","sign_citation":"https://pith.science/pith/AIC66H6YMMUNN5QEQVFYOUCIZQ/action/citation_signature","submit_replication":"https://pith.science/pith/AIC66H6YMMUNN5QEQVFYOUCIZQ/action/replication_record"}},"created_at":"2026-05-18T01:19:34.041201+00:00","updated_at":"2026-05-18T01:19:34.041201+00:00"}