{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:27TXCXSQRVXK6C2BBUNUFSWSB5","short_pith_number":"pith:27TXCXSQ","canonical_record":{"source":{"id":"1710.05133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-14T04:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"fdfd45e976f59555aa1444b3cd675571ea280ae37a8daa29b631718d10f9682a","abstract_canon_sha256":"b5821006e7050357f0a94187af947b887ee9456028654634b45318d622619352"},"schema_version":"1.0"},"canonical_sha256":"d7e7715e508d6eaf0b410d1b42cad20f6f84a0511a5b590f079ca52a1516ada3","source":{"kind":"arxiv","id":"1710.05133","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05133","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05133v2","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05133","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"pith_short_12","alias_value":"27TXCXSQRVXK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"27TXCXSQRVXK6C2B","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"27TXCXSQ","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:27TXCXSQRVXK6C2BBUNUFSWSB5","target":"record","payload":{"canonical_record":{"source":{"id":"1710.05133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-14T04:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"fdfd45e976f59555aa1444b3cd675571ea280ae37a8daa29b631718d10f9682a","abstract_canon_sha256":"b5821006e7050357f0a94187af947b887ee9456028654634b45318d622619352"},"schema_version":"1.0"},"canonical_sha256":"d7e7715e508d6eaf0b410d1b42cad20f6f84a0511a5b590f079ca52a1516ada3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:18.169495Z","signature_b64":"gy+txC9XGXA9yT6VIXJ9axoI3lpHWr7Kjwrp+FpP4K6Ilu1a12THwwCFyRAAQ6+q8GaloXfjR/speMugc/C4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7e7715e508d6eaf0b410d1b42cad20f6f84a0511a5b590f079ca52a1516ada3","last_reissued_at":"2026-05-18T00:29:18.168835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:18.168835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.05133","source_version":2,"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:29:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYBlrmf1rTUSgLfVNjG/C945epB8oofzfwjcAPGtBIl48mhvkgM3Aj0Y69f8gXeRwKh85oUjU/kNanqmY6WzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:21:44.048979Z"},"content_sha256":"bc7b96de226afbb08c31d340fffdea5616879467c30b165065e11eb17d846a74","schema_version":"1.0","event_id":"sha256:bc7b96de226afbb08c31d340fffdea5616879467c30b165065e11eb17d846a74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:27TXCXSQRVXK6C2BBUNUFSWSB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tracking Moving Agents via Inexact Online Gradient Descent Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amrit Singh Bedi, Ketan Rajawat, Paban Sarma","submitted_at":"2017-10-14T04:59:33Z","abstract_excerpt":"Multi-agent systems are being increasingly deployed in challenging environments for performing complex tasks such as multi-target tracking, search-and-rescue, and intrusion detection. Notwithstanding the computational limitations of individual robots, such systems rely on collaboration to sense and react to the environment. This paper formulates the generic target tracking problem as a time-varying optimization problem and puts forth an inexact online gradient descent method for solving it sequentially. The performance of the proposed algorithm is studied by characterizing its dynamic regret, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05133","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"},"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:29:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WoskU6oUO+Npo/+3npyGNDpfS4icwVcqZ7q0YIHgAU58Slo1AFYiZ7sCkmw4ACcyCucCR+C9Kr/5HmMOX7/4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:21:44.049342Z"},"content_sha256":"e675a79aee796357602bb23efe00831a4fe4e82637a38ff110ece9f31d30ea45","schema_version":"1.0","event_id":"sha256:e675a79aee796357602bb23efe00831a4fe4e82637a38ff110ece9f31d30ea45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27TXCXSQRVXK6C2BBUNUFSWSB5/bundle.json","state_url":"https://pith.science/pith/27TXCXSQRVXK6C2BBUNUFSWSB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27TXCXSQRVXK6C2BBUNUFSWSB5/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-06-23T14:21:44Z","links":{"resolver":"https://pith.science/pith/27TXCXSQRVXK6C2BBUNUFSWSB5","bundle":"https://pith.science/pith/27TXCXSQRVXK6C2BBUNUFSWSB5/bundle.json","state":"https://pith.science/pith/27TXCXSQRVXK6C2BBUNUFSWSB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27TXCXSQRVXK6C2BBUNUFSWSB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:27TXCXSQRVXK6C2BBUNUFSWSB5","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":"b5821006e7050357f0a94187af947b887ee9456028654634b45318d622619352","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-14T04:59:33Z","title_canon_sha256":"fdfd45e976f59555aa1444b3cd675571ea280ae37a8daa29b631718d10f9682a"},"schema_version":"1.0","source":{"id":"1710.05133","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05133","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05133v2","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05133","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"pith_short_12","alias_value":"27TXCXSQRVXK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"27TXCXSQRVXK6C2B","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"27TXCXSQ","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:e675a79aee796357602bb23efe00831a4fe4e82637a38ff110ece9f31d30ea45","target":"graph","created_at":"2026-05-18T00:29:18Z","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":"Multi-agent systems are being increasingly deployed in challenging environments for performing complex tasks such as multi-target tracking, search-and-rescue, and intrusion detection. Notwithstanding the computational limitations of individual robots, such systems rely on collaboration to sense and react to the environment. This paper formulates the generic target tracking problem as a time-varying optimization problem and puts forth an inexact online gradient descent method for solving it sequentially. The performance of the proposed algorithm is studied by characterizing its dynamic regret, ","authors_text":"Amrit Singh Bedi, Ketan Rajawat, Paban Sarma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-14T04:59:33Z","title":"Tracking Moving Agents via Inexact Online Gradient Descent Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05133","kind":"arxiv","version":2},"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:bc7b96de226afbb08c31d340fffdea5616879467c30b165065e11eb17d846a74","target":"record","created_at":"2026-05-18T00:29:18Z","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":"b5821006e7050357f0a94187af947b887ee9456028654634b45318d622619352","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-14T04:59:33Z","title_canon_sha256":"fdfd45e976f59555aa1444b3cd675571ea280ae37a8daa29b631718d10f9682a"},"schema_version":"1.0","source":{"id":"1710.05133","kind":"arxiv","version":2}},"canonical_sha256":"d7e7715e508d6eaf0b410d1b42cad20f6f84a0511a5b590f079ca52a1516ada3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7e7715e508d6eaf0b410d1b42cad20f6f84a0511a5b590f079ca52a1516ada3","first_computed_at":"2026-05-18T00:29:18.168835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:18.168835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gy+txC9XGXA9yT6VIXJ9axoI3lpHWr7Kjwrp+FpP4K6Ilu1a12THwwCFyRAAQ6+q8GaloXfjR/speMugc/C4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:18.169495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05133","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc7b96de226afbb08c31d340fffdea5616879467c30b165065e11eb17d846a74","sha256:e675a79aee796357602bb23efe00831a4fe4e82637a38ff110ece9f31d30ea45"],"state_sha256":"888b082caf221b0832c27230c6619d1a53427b04e415dfe8757b66820a2d9cb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTVZjPpzQu0C5pWOQQQ808/o601Rany15w0JVWNRWT2dfxp0D/qO7TkXQh3xx5HUn0CIyDdbXR37ds/51hLwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:21:44.051272Z","bundle_sha256":"cc4509e2b6ead20ae3ccd0e0631a0c989b125884f43d6f157d280810d899b0ef"}}