{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YKH7VAIBKSDNHAJSBGVTQY2ZHV","short_pith_number":"pith:YKH7VAIB","schema_version":"1.0","canonical_sha256":"c28ffa81015486d3813209ab3863593d536840d6db82772b9006f779e1d1f706","source":{"kind":"arxiv","id":"1007.3706","version":2},"attestation_state":"computed","paper":{"title":"Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms with Directed Gossip Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dusan Jakovetic, Joao Xavier, Jose M. F. Moura","submitted_at":"2010-07-21T18:25:33Z","abstract_excerpt":"We study distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-M"},"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":"1007.3706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-21T18:25:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"efc36c432274c19153885501e0a85627ff635f5a5bf4287bd9460d6ba91d8fb3","abstract_canon_sha256":"3c25b9b90d6700d20b6148fc290151d9060abe0f7ac7bbd20527a45fc9c1aff0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:11.917367Z","signature_b64":"9gi0RgsSl6UgJcI9o2ikkKHwHnHTDEt3eZnRcLJHpM7xWgPeRB5XitwgLKPBuMJSxTylbivWhsExOpb3jgbKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c28ffa81015486d3813209ab3863593d536840d6db82772b9006f779e1d1f706","last_reissued_at":"2026-05-18T02:06:11.916780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:11.916780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms with Directed Gossip Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dusan Jakovetic, Joao Xavier, Jose M. F. Moura","submitted_at":"2010-07-21T18:25:33Z","abstract_excerpt":"We study distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3706","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":"1007.3706","created_at":"2026-05-18T02:06:11.916861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.3706v2","created_at":"2026-05-18T02:06:11.916861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3706","created_at":"2026-05-18T02:06:11.916861+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKH7VAIBKSDN","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKH7VAIBKSDNHAJS","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKH7VAIB","created_at":"2026-05-18T12:26:17.028572+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/YKH7VAIBKSDNHAJSBGVTQY2ZHV","json":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV.json","graph_json":"https://pith.science/api/pith-number/YKH7VAIBKSDNHAJSBGVTQY2ZHV/graph.json","events_json":"https://pith.science/api/pith-number/YKH7VAIBKSDNHAJSBGVTQY2ZHV/events.json","paper":"https://pith.science/paper/YKH7VAIB"},"agent_actions":{"view_html":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV","download_json":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV.json","view_paper":"https://pith.science/paper/YKH7VAIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.3706&json=true","fetch_graph":"https://pith.science/api/pith-number/YKH7VAIBKSDNHAJSBGVTQY2ZHV/graph.json","fetch_events":"https://pith.science/api/pith-number/YKH7VAIBKSDNHAJSBGVTQY2ZHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV/action/storage_attestation","attest_author":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV/action/author_attestation","sign_citation":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV/action/citation_signature","submit_replication":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV/action/replication_record"}},"created_at":"2026-05-18T02:06:11.916861+00:00","updated_at":"2026-05-18T02:06:11.916861+00:00"}