{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:JY5SWCRS2WPI6VIRLO7FSIO7F7","short_pith_number":"pith:JY5SWCRS","canonical_record":{"source":{"id":"2210.03300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-10-07T03:14:02Z","cross_cats_sorted":[],"title_canon_sha256":"89c5635eb29846d5b893cad42a88e986466df066fe405a86121263c14423da4d","abstract_canon_sha256":"3a7f813406969af9838c7cb93b26fe2ba667f71901afbbd71e5251dbee0ea497"},"schema_version":"1.0"},"canonical_sha256":"4e3b2b0a32d59e8f55115bbe5921df2fc77311baef39f9d59229028bf4e6e286","source":{"kind":"arxiv","id":"2210.03300","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.03300","created_at":"2026-07-05T05:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"2210.03300v2","created_at":"2026-07-05T05:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03300","created_at":"2026-07-05T05:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"JY5SWCRS2WPI","created_at":"2026-07-05T05:05:10Z"},{"alias_kind":"pith_short_16","alias_value":"JY5SWCRS2WPI6VIR","created_at":"2026-07-05T05:05:10Z"},{"alias_kind":"pith_short_8","alias_value":"JY5SWCRS","created_at":"2026-07-05T05:05:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:JY5SWCRS2WPI6VIRLO7FSIO7F7","target":"record","payload":{"canonical_record":{"source":{"id":"2210.03300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-10-07T03:14:02Z","cross_cats_sorted":[],"title_canon_sha256":"89c5635eb29846d5b893cad42a88e986466df066fe405a86121263c14423da4d","abstract_canon_sha256":"3a7f813406969af9838c7cb93b26fe2ba667f71901afbbd71e5251dbee0ea497"},"schema_version":"1.0"},"canonical_sha256":"4e3b2b0a32d59e8f55115bbe5921df2fc77311baef39f9d59229028bf4e6e286","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:05:10.409405Z","signature_b64":"k1wRRLdQlaY4yY0TyJFIuw+G5BeafSiI6nLXHQ4arONpByj9mhztpRf1VH0/VbVV7WlqKitxmPBctq3e0Q7EBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e3b2b0a32d59e8f55115bbe5921df2fc77311baef39f9d59229028bf4e6e286","last_reissued_at":"2026-07-05T05:05:10.409017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:05:10.409017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.03300","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-07-05T05:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6wQnJzj7va6kt9kjlyBJYSW33mv3xTcfUO9r4jgRZotuiCykmog9M0BUy89CKxgV+m7QzRFo5BOD5PUzSNjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T05:45:08.312563Z"},"content_sha256":"69336be74135a762d269003cbcea873d6548e72089bae5d9ac91ba639d5d8113","schema_version":"1.0","event_id":"sha256:69336be74135a762d269003cbcea873d6548e72089bae5d9ac91ba639d5d8113"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:JY5SWCRS2WPI6VIRLO7FSIO7F7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Robot Localization and Target Tracking with Connectivity Maintenance and Collision Avoidance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jiazhen Liu, Lifeng Zhou, Rahul Zahroof, Vijay Kumar","submitted_at":"2022-10-07T03:14:02Z","abstract_excerpt":"We study the problem that requires a team of robots to perform joint localization and target tracking task while ensuring team connectivity and collision avoidance. The problem can be formalized as a nonlinear, non-convex optimization program, which is typically hard to solve. To this end, we design a two-staged approach that utilizes a greedy algorithm to optimize the joint localization and target tracking performance and applies control barrier functions to ensure safety constraints, i.e., maintaining connectivity of the robot team and preventing inter-robot collisions. Simulated Gazebo expe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03300","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.03300/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/SsT1yqpMbJpwK5uBSDq4R2e+J7QuWRCwzi6iEBOJrmxAwlE+peCx6X1oP958eu2gw9oQLqwjMoVDR2C+/WDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T05:45:08.313177Z"},"content_sha256":"47247d78e19bcd7f9f6e6727d9c260aa8c1c8cc329347679028f636802d90003","schema_version":"1.0","event_id":"sha256:47247d78e19bcd7f9f6e6727d9c260aa8c1c8cc329347679028f636802d90003"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JY5SWCRS2WPI6VIRLO7FSIO7F7/bundle.json","state_url":"https://pith.science/pith/JY5SWCRS2WPI6VIRLO7FSIO7F7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JY5SWCRS2WPI6VIRLO7FSIO7F7/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-08-06T05:45:08Z","links":{"resolver":"https://pith.science/pith/JY5SWCRS2WPI6VIRLO7FSIO7F7","bundle":"https://pith.science/pith/JY5SWCRS2WPI6VIRLO7FSIO7F7/bundle.json","state":"https://pith.science/pith/JY5SWCRS2WPI6VIRLO7FSIO7F7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JY5SWCRS2WPI6VIRLO7FSIO7F7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JY5SWCRS2WPI6VIRLO7FSIO7F7","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":"3a7f813406969af9838c7cb93b26fe2ba667f71901afbbd71e5251dbee0ea497","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-10-07T03:14:02Z","title_canon_sha256":"89c5635eb29846d5b893cad42a88e986466df066fe405a86121263c14423da4d"},"schema_version":"1.0","source":{"id":"2210.03300","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.03300","created_at":"2026-07-05T05:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"2210.03300v2","created_at":"2026-07-05T05:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03300","created_at":"2026-07-05T05:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"JY5SWCRS2WPI","created_at":"2026-07-05T05:05:10Z"},{"alias_kind":"pith_short_16","alias_value":"JY5SWCRS2WPI6VIR","created_at":"2026-07-05T05:05:10Z"},{"alias_kind":"pith_short_8","alias_value":"JY5SWCRS","created_at":"2026-07-05T05:05:10Z"}],"graph_snapshots":[{"event_id":"sha256:47247d78e19bcd7f9f6e6727d9c260aa8c1c8cc329347679028f636802d90003","target":"graph","created_at":"2026-07-05T05:05:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.03300/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem that requires a team of robots to perform joint localization and target tracking task while ensuring team connectivity and collision avoidance. The problem can be formalized as a nonlinear, non-convex optimization program, which is typically hard to solve. To this end, we design a two-staged approach that utilizes a greedy algorithm to optimize the joint localization and target tracking performance and applies control barrier functions to ensure safety constraints, i.e., maintaining connectivity of the robot team and preventing inter-robot collisions. Simulated Gazebo expe","authors_text":"Jiazhen Liu, Lifeng Zhou, Rahul Zahroof, Vijay Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-10-07T03:14:02Z","title":"Multi-Robot Localization and Target Tracking with Connectivity Maintenance and Collision Avoidance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03300","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:69336be74135a762d269003cbcea873d6548e72089bae5d9ac91ba639d5d8113","target":"record","created_at":"2026-07-05T05:05:10Z","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":"3a7f813406969af9838c7cb93b26fe2ba667f71901afbbd71e5251dbee0ea497","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-10-07T03:14:02Z","title_canon_sha256":"89c5635eb29846d5b893cad42a88e986466df066fe405a86121263c14423da4d"},"schema_version":"1.0","source":{"id":"2210.03300","kind":"arxiv","version":2}},"canonical_sha256":"4e3b2b0a32d59e8f55115bbe5921df2fc77311baef39f9d59229028bf4e6e286","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e3b2b0a32d59e8f55115bbe5921df2fc77311baef39f9d59229028bf4e6e286","first_computed_at":"2026-07-05T05:05:10.409017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:05:10.409017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k1wRRLdQlaY4yY0TyJFIuw+G5BeafSiI6nLXHQ4arONpByj9mhztpRf1VH0/VbVV7WlqKitxmPBctq3e0Q7EBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:05:10.409405Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.03300","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69336be74135a762d269003cbcea873d6548e72089bae5d9ac91ba639d5d8113","sha256:47247d78e19bcd7f9f6e6727d9c260aa8c1c8cc329347679028f636802d90003"],"state_sha256":"55cd51de0c1e02fa6703a58557cbb62d74c1f6f08cf9f5e16703751989e3ea4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hENLXSJfMJ2ZDoYhvhUnnwU3KXVcZe7OYPuBtPMstS8hYkfxjKitwmCwn3DAdxvZIZVnjEMetGWgXnPNdmFtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T05:45:08.317438Z","bundle_sha256":"d861c8ee873516525aedd341163e4127a0785c1271877e1250b498e65e523c59"}}