{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A2HTUNJD6PSCAQAIXVMDAGMDMJ","short_pith_number":"pith:A2HTUNJD","schema_version":"1.0","canonical_sha256":"068f3a3523f3e4204008bd583019836262fb7bde49e84cc05f6458b893857255","source":{"kind":"arxiv","id":"1412.7215","version":1},"attestation_state":"computed","paper":{"title":"Online Distributed Optimization on Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","cs.MA","cs.SY"],"primary_cat":"math.OC","authors_text":"Airlie Chapman, Mehran Mesbahi, Saghar Hosseini","submitted_at":"2014-12-22T23:57:30Z","abstract_excerpt":"This paper presents a distributed optimization scheme over a network of agents in the presence of cost uncertainties and over switching communication topologies. Inspired by recent advances in distributed convex optimization, we propose a distributed algorithm based on a dual sub-gradient averaging. The objective of this algorithm is to minimize a cost function cooperatively. Furthermore, the algorithm changes the weights on the communication links in the network to adapt to varying reliability of neighboring agents. A convergence rate analysis as a function of the underlying network topology "},"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":"1412.7215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-22T23:57:30Z","cross_cats_sorted":["cs.DS","cs.LG","cs.MA","cs.SY"],"title_canon_sha256":"9db8bc59bc8aeff392fd98156f0a6a8a1729252454cd6de6d57e71deab943a2e","abstract_canon_sha256":"3cb0596431ab21ce18e43dab635ff0914826ddebb883e6feeb507169519c9a5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:02.229536Z","signature_b64":"t6VPFaLKVmvfzKwEho4X661MXlqulklkF3kKP4awGYk7S0WnS31snR/Nhf3dnDDnk74yaur3OyXu8KGEg41wAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"068f3a3523f3e4204008bd583019836262fb7bde49e84cc05f6458b893857255","last_reissued_at":"2026-05-18T00:59:02.229069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:02.229069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Distributed Optimization on Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","cs.MA","cs.SY"],"primary_cat":"math.OC","authors_text":"Airlie Chapman, Mehran Mesbahi, Saghar Hosseini","submitted_at":"2014-12-22T23:57:30Z","abstract_excerpt":"This paper presents a distributed optimization scheme over a network of agents in the presence of cost uncertainties and over switching communication topologies. Inspired by recent advances in distributed convex optimization, we propose a distributed algorithm based on a dual sub-gradient averaging. The objective of this algorithm is to minimize a cost function cooperatively. Furthermore, the algorithm changes the weights on the communication links in the network to adapt to varying reliability of neighboring agents. A convergence rate analysis as a function of the underlying network topology "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7215","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":"1412.7215","created_at":"2026-05-18T00:59:02.229142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7215v1","created_at":"2026-05-18T00:59:02.229142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7215","created_at":"2026-05-18T00:59:02.229142+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2HTUNJD6PSC","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2HTUNJD6PSCAQAI","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2HTUNJD","created_at":"2026-05-18T12:28:19.803747+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/A2HTUNJD6PSCAQAIXVMDAGMDMJ","json":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ.json","graph_json":"https://pith.science/api/pith-number/A2HTUNJD6PSCAQAIXVMDAGMDMJ/graph.json","events_json":"https://pith.science/api/pith-number/A2HTUNJD6PSCAQAIXVMDAGMDMJ/events.json","paper":"https://pith.science/paper/A2HTUNJD"},"agent_actions":{"view_html":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ","download_json":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ.json","view_paper":"https://pith.science/paper/A2HTUNJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7215&json=true","fetch_graph":"https://pith.science/api/pith-number/A2HTUNJD6PSCAQAIXVMDAGMDMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/A2HTUNJD6PSCAQAIXVMDAGMDMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ/action/storage_attestation","attest_author":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ/action/author_attestation","sign_citation":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ/action/citation_signature","submit_replication":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ/action/replication_record"}},"created_at":"2026-05-18T00:59:02.229142+00:00","updated_at":"2026-05-18T00:59:02.229142+00:00"}