{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UT4LT2PDPSNEZXLPLOJDALCROE","short_pith_number":"pith:UT4LT2PD","canonical_record":{"source":{"id":"1702.06219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-21T00:18:14Z","cross_cats_sorted":["cs.MA","stat.ML"],"title_canon_sha256":"a9574c3007da109de0403ec020ee16f417ef2e91e3fabcee544a6156a0a72a18","abstract_canon_sha256":"fbdc29acbce65d2862d2e4d96832c0390b81ec41b74a0f5229442a24238e7a4b"},"schema_version":"1.0"},"canonical_sha256":"a4f8b9e9e37c9a4cdd6f5b92302c517121ca069da98c9ccef57ab0ccfe339ee8","source":{"kind":"arxiv","id":"1702.06219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06219","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06219v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06219","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"UT4LT2PDPSNE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UT4LT2PDPSNEZXLP","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UT4LT2PD","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UT4LT2PDPSNEZXLPLOJDALCROE","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-21T00:18:14Z","cross_cats_sorted":["cs.MA","stat.ML"],"title_canon_sha256":"a9574c3007da109de0403ec020ee16f417ef2e91e3fabcee544a6156a0a72a18","abstract_canon_sha256":"fbdc29acbce65d2862d2e4d96832c0390b81ec41b74a0f5229442a24238e7a4b"},"schema_version":"1.0"},"canonical_sha256":"a4f8b9e9e37c9a4cdd6f5b92302c517121ca069da98c9ccef57ab0ccfe339ee8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:14.701976Z","signature_b64":"VLEaKTRudYDNcu5GUD6IvqlG8eem64UrRz3UwHOTgAXodh7cObaCkEM0jfbsdPRSR5tgIebx7/7QPf3lNSYLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4f8b9e9e37c9a4cdd6f5b92302c517121ca069da98c9ccef57ab0ccfe339ee8","last_reissued_at":"2026-05-18T00:50:14.701403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:14.701403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06219","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:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luwbnJpELCgHD9mXLRpSfovmscMohP2tlizYEXihtZK+JPCF2nFMJRrRZLHB8uB8riBOHtmfOL0Uz8kVIfE6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:02:12.719352Z"},"content_sha256":"974b6600c6a1ad551a1796e2687e5429f9f234f64ef8795c4362e0925376e0aa","schema_version":"1.0","event_id":"sha256:974b6600c6a1ad551a1796e2687e5429f9f234f64ef8795c4362e0925376e0aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UT4LT2PDPSNEZXLPLOJDALCROE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Online Optimization Approach for Multi-Agent Tracking of Dynamic Parameters in the Presence of Adversarial Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","stat.ML"],"primary_cat":"math.OC","authors_text":"Ali Jadbabaie, Shahin Shahrampour","submitted_at":"2017-02-21T00:18:14Z","abstract_excerpt":"This paper addresses tracking of a moving target in a multi-agent network. The target follows a linear dynamics corrupted by an adversarial noise, i.e., the noise is not generated from a statistical distribution. The location of the target at each time induces a global time-varying loss function, and the global loss is a sum of local losses, each of which is associated to one agent. Agents noisy observations could be nonlinear. We formulate this problem as a distributed online optimization where agents communicate with each other to track the minimizer of the global loss. We then propose a dec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06219","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:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wJ0tb4cPB0n6HGFhDQ+5ZrJ+ykaffs0UTCBzXYGyO4zoA16o32jogRC9EYn3R7N62m8fMBtKcAqkoxZ/0z7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:02:12.720019Z"},"content_sha256":"bf0632ce1a97c7d5897be4b730424cd2f2e2cc7b9f32281a3e73e4906cba0573","schema_version":"1.0","event_id":"sha256:bf0632ce1a97c7d5897be4b730424cd2f2e2cc7b9f32281a3e73e4906cba0573"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UT4LT2PDPSNEZXLPLOJDALCROE/bundle.json","state_url":"https://pith.science/pith/UT4LT2PDPSNEZXLPLOJDALCROE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UT4LT2PDPSNEZXLPLOJDALCROE/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-28T20:02:12Z","links":{"resolver":"https://pith.science/pith/UT4LT2PDPSNEZXLPLOJDALCROE","bundle":"https://pith.science/pith/UT4LT2PDPSNEZXLPLOJDALCROE/bundle.json","state":"https://pith.science/pith/UT4LT2PDPSNEZXLPLOJDALCROE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UT4LT2PDPSNEZXLPLOJDALCROE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UT4LT2PDPSNEZXLPLOJDALCROE","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":"fbdc29acbce65d2862d2e4d96832c0390b81ec41b74a0f5229442a24238e7a4b","cross_cats_sorted":["cs.MA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-21T00:18:14Z","title_canon_sha256":"a9574c3007da109de0403ec020ee16f417ef2e91e3fabcee544a6156a0a72a18"},"schema_version":"1.0","source":{"id":"1702.06219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06219","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06219v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06219","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"UT4LT2PDPSNE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UT4LT2PDPSNEZXLP","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UT4LT2PD","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:bf0632ce1a97c7d5897be4b730424cd2f2e2cc7b9f32281a3e73e4906cba0573","target":"graph","created_at":"2026-05-18T00:50:14Z","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 addresses tracking of a moving target in a multi-agent network. The target follows a linear dynamics corrupted by an adversarial noise, i.e., the noise is not generated from a statistical distribution. The location of the target at each time induces a global time-varying loss function, and the global loss is a sum of local losses, each of which is associated to one agent. Agents noisy observations could be nonlinear. We formulate this problem as a distributed online optimization where agents communicate with each other to track the minimizer of the global loss. We then propose a dec","authors_text":"Ali Jadbabaie, Shahin Shahrampour","cross_cats":["cs.MA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-21T00:18:14Z","title":"An Online Optimization Approach for Multi-Agent Tracking of Dynamic Parameters in the Presence of Adversarial Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06219","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:974b6600c6a1ad551a1796e2687e5429f9f234f64ef8795c4362e0925376e0aa","target":"record","created_at":"2026-05-18T00:50:14Z","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":"fbdc29acbce65d2862d2e4d96832c0390b81ec41b74a0f5229442a24238e7a4b","cross_cats_sorted":["cs.MA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-21T00:18:14Z","title_canon_sha256":"a9574c3007da109de0403ec020ee16f417ef2e91e3fabcee544a6156a0a72a18"},"schema_version":"1.0","source":{"id":"1702.06219","kind":"arxiv","version":1}},"canonical_sha256":"a4f8b9e9e37c9a4cdd6f5b92302c517121ca069da98c9ccef57ab0ccfe339ee8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4f8b9e9e37c9a4cdd6f5b92302c517121ca069da98c9ccef57ab0ccfe339ee8","first_computed_at":"2026-05-18T00:50:14.701403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:14.701403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VLEaKTRudYDNcu5GUD6IvqlG8eem64UrRz3UwHOTgAXodh7cObaCkEM0jfbsdPRSR5tgIebx7/7QPf3lNSYLAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:14.701976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:974b6600c6a1ad551a1796e2687e5429f9f234f64ef8795c4362e0925376e0aa","sha256:bf0632ce1a97c7d5897be4b730424cd2f2e2cc7b9f32281a3e73e4906cba0573"],"state_sha256":"b230d1ba96a01f57e1ddd3f7e8c72f583e16cf37681ff55c2bc8a54ed857227b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4rVTODliyCorC/gT0HBGk+zfC12Su9VxgSJDYVoguXHbkV+n3UwR5jrIEAaumiVitwuOzVb1oQkblJIg8uHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:02:12.723460Z","bundle_sha256":"70f8f4a66cd06661b1abbcaf4e04f5c572d9f3a457763160a144420244c9e0aa"}}