{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A2HTUNJD6PSCAQAIXVMDAGMDMJ","short_pith_number":"pith:A2HTUNJD","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"},"canonical_sha256":"068f3a3523f3e4204008bd583019836262fb7bde49e84cc05f6458b893857255","source":{"kind":"arxiv","id":"1412.7215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7215","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7215v1","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7215","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"A2HTUNJD6PSC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A2HTUNJD6PSCAQAI","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A2HTUNJD","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A2HTUNJD6PSCAQAIXVMDAGMDMJ","target":"record","payload":{"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"},"canonical_sha256":"068f3a3523f3e4204008bd583019836262fb7bde49e84cc05f6458b893857255","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"},"source_kind":"arxiv","source_id":"1412.7215","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sy/6NrL8Z6f8n6qnVXN4eP18vB+AK9t9qOzD5SLNs+dqa9XY8pzGRNp00iE+urLUk4E+05pGzzfOliaOwC3aBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:09:59.879535Z"},"content_sha256":"cbe7c1e2c743f539698c21813df0fdaebc8310d957156a3854caa0f0b690532c","schema_version":"1.0","event_id":"sha256:cbe7c1e2c743f539698c21813df0fdaebc8310d957156a3854caa0f0b690532c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A2HTUNJD6PSCAQAIXVMDAGMDMJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGbP+RN8aMLX5/eVqg7JA0+1oL9DOnYp5Y2vBcRg91EMo0MzZ2Su+yEz377JTwOPOStrRpBc4prERUVqVDMzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:09:59.879879Z"},"content_sha256":"232a07c4433e1e31cac9636497bab2362befb0ed8558f1273f0ecc0761bf13d1","schema_version":"1.0","event_id":"sha256:232a07c4433e1e31cac9636497bab2362befb0ed8558f1273f0ecc0761bf13d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ/bundle.json","state_url":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T14:09:59Z","links":{"resolver":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ","bundle":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ/bundle.json","state":"https://pith.science/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2HTUNJD6PSCAQAIXVMDAGMDMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A2HTUNJD6PSCAQAIXVMDAGMDMJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3cb0596431ab21ce18e43dab635ff0914826ddebb883e6feeb507169519c9a5b","cross_cats_sorted":["cs.DS","cs.LG","cs.MA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-22T23:57:30Z","title_canon_sha256":"9db8bc59bc8aeff392fd98156f0a6a8a1729252454cd6de6d57e71deab943a2e"},"schema_version":"1.0","source":{"id":"1412.7215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7215","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7215v1","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7215","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"A2HTUNJD6PSC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A2HTUNJD6PSCAQAI","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A2HTUNJD","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:232a07c4433e1e31cac9636497bab2362befb0ed8558f1273f0ecc0761bf13d1","target":"graph","created_at":"2026-05-18T00:59:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Airlie Chapman, Mehran Mesbahi, Saghar Hosseini","cross_cats":["cs.DS","cs.LG","cs.MA","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-22T23:57:30Z","title":"Online Distributed Optimization on Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7215","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cbe7c1e2c743f539698c21813df0fdaebc8310d957156a3854caa0f0b690532c","target":"record","created_at":"2026-05-18T00:59:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3cb0596431ab21ce18e43dab635ff0914826ddebb883e6feeb507169519c9a5b","cross_cats_sorted":["cs.DS","cs.LG","cs.MA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-22T23:57:30Z","title_canon_sha256":"9db8bc59bc8aeff392fd98156f0a6a8a1729252454cd6de6d57e71deab943a2e"},"schema_version":"1.0","source":{"id":"1412.7215","kind":"arxiv","version":1}},"canonical_sha256":"068f3a3523f3e4204008bd583019836262fb7bde49e84cc05f6458b893857255","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"068f3a3523f3e4204008bd583019836262fb7bde49e84cc05f6458b893857255","first_computed_at":"2026-05-18T00:59:02.229069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:02.229069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t6VPFaLKVmvfzKwEho4X661MXlqulklkF3kKP4awGYk7S0WnS31snR/Nhf3dnDDnk74yaur3OyXu8KGEg41wAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:02.229536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.7215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbe7c1e2c743f539698c21813df0fdaebc8310d957156a3854caa0f0b690532c","sha256:232a07c4433e1e31cac9636497bab2362befb0ed8558f1273f0ecc0761bf13d1"],"state_sha256":"371203bc0f672e209779ed329dcf89c02349d949ead8c36d654619492164f87e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"701xCF1Tjy02nZXc2cqTZLg3epREL/THl/YKvJV0w2EhmMjRZ0NF3v8hhIhKDKadyr02AKiLYjz+aRxgEqVHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:09:59.881797Z","bundle_sha256":"18c4f36f1e83c5fbb3b8e68b4604fff6ef24e1624d4e8ff41cf0546f266dcf2d"}}