{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M7GTDZZBATYBZAJVUHG4ZBM7ET","short_pith_number":"pith:M7GTDZZB","canonical_record":{"source":{"id":"1703.06387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-19T03:53:37Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b0f039c5cdbe5c0fa1941b64dcaee262e9a366a8a74cdfd923e803d107d644c2","abstract_canon_sha256":"c404a20679cf94e196616f511c453dcaf51c64b0f0524f3cfd757307f6e0ee10"},"schema_version":"1.0"},"canonical_sha256":"67cd31e72104f01c8135a1cdcc859f24f947f48c2708b4a12788e6e4fb1380bc","source":{"kind":"arxiv","id":"1703.06387","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06387","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06387v1","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06387","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"pith_short_12","alias_value":"M7GTDZZBATYB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"M7GTDZZBATYBZAJV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"M7GTDZZB","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M7GTDZZBATYBZAJVUHG4ZBM7ET","target":"record","payload":{"canonical_record":{"source":{"id":"1703.06387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-19T03:53:37Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b0f039c5cdbe5c0fa1941b64dcaee262e9a366a8a74cdfd923e803d107d644c2","abstract_canon_sha256":"c404a20679cf94e196616f511c453dcaf51c64b0f0524f3cfd757307f6e0ee10"},"schema_version":"1.0"},"canonical_sha256":"67cd31e72104f01c8135a1cdcc859f24f947f48c2708b4a12788e6e4fb1380bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:23.054311Z","signature_b64":"Z0rp5K/fHod1j6cAJMxprfhPEJeoCwdy0MHzXmUWbk3KfQGpzFOj/TeWR/ar1bVd9wk20ImhXrlG+rutozxiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67cd31e72104f01c8135a1cdcc859f24f947f48c2708b4a12788e6e4fb1380bc","last_reissued_at":"2026-05-18T00:48:23.053815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:23.053815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.06387","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:48:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+cnddZlmWjgvjeWXv2uiebQ1OmGlsJQDoUVJ+ePoWONrpcJo4qjQ2CJOl+OCMqomVxe0ncfLe2M0gXRlKjVWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:10:35.971436Z"},"content_sha256":"69608cadc4f3866396775bfd0a947238ce9f376b8a8498b04b2242fde1acaaa7","schema_version":"1.0","event_id":"sha256:69608cadc4f3866396775bfd0a947238ce9f376b8a8498b04b2242fde1acaaa7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M7GTDZZBATYBZAJVUHG4ZBM7ET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An opportunistic linear-convex algorithm for localization in mobile robot networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.RO","authors_text":"Sam Safavi, Usman Khan","submitted_at":"2017-03-19T03:53:37Z","abstract_excerpt":"In this paper, we develop a \\textcolor{black}{\\emph{distributed}} algorithm to localize a network of robots moving arbitrarily in a bounded region. In the case of such mobile networks, the main challenge is that the robots may not be able to find nearby robots to implement a distributed algorithm. We address this issue by providing an opportunistic algorithm that only implements a location update when there are nearby robots and does not update otherwise. We assume that each robot measures a noisy version of its motion and the distances to the nearby robots. To localize a network of mobile rob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06387","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:48:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+hGe5jp7TPD3IMcLk5K6wy15RAXpjVBL9smLTg6ejwQiIQHXj/35Ugbrk/32kxViLq+r6a8n1Sy4y/OjI4mCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:10:35.972168Z"},"content_sha256":"a59ef06e7ff994385bd2aef548a0690fce7a808ea07a28f2cd4e2cac215e7e64","schema_version":"1.0","event_id":"sha256:a59ef06e7ff994385bd2aef548a0690fce7a808ea07a28f2cd4e2cac215e7e64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7GTDZZBATYBZAJVUHG4ZBM7ET/bundle.json","state_url":"https://pith.science/pith/M7GTDZZBATYBZAJVUHG4ZBM7ET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7GTDZZBATYBZAJVUHG4ZBM7ET/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-08T18:10:35Z","links":{"resolver":"https://pith.science/pith/M7GTDZZBATYBZAJVUHG4ZBM7ET","bundle":"https://pith.science/pith/M7GTDZZBATYBZAJVUHG4ZBM7ET/bundle.json","state":"https://pith.science/pith/M7GTDZZBATYBZAJVUHG4ZBM7ET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7GTDZZBATYBZAJVUHG4ZBM7ET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M7GTDZZBATYBZAJVUHG4ZBM7ET","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":"c404a20679cf94e196616f511c453dcaf51c64b0f0524f3cfd757307f6e0ee10","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-19T03:53:37Z","title_canon_sha256":"b0f039c5cdbe5c0fa1941b64dcaee262e9a366a8a74cdfd923e803d107d644c2"},"schema_version":"1.0","source":{"id":"1703.06387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06387","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06387v1","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06387","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"pith_short_12","alias_value":"M7GTDZZBATYB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"M7GTDZZBATYBZAJV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"M7GTDZZB","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:a59ef06e7ff994385bd2aef548a0690fce7a808ea07a28f2cd4e2cac215e7e64","target":"graph","created_at":"2026-05-18T00:48:23Z","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":"In this paper, we develop a \\textcolor{black}{\\emph{distributed}} algorithm to localize a network of robots moving arbitrarily in a bounded region. In the case of such mobile networks, the main challenge is that the robots may not be able to find nearby robots to implement a distributed algorithm. We address this issue by providing an opportunistic algorithm that only implements a location update when there are nearby robots and does not update otherwise. We assume that each robot measures a noisy version of its motion and the distances to the nearby robots. To localize a network of mobile rob","authors_text":"Sam Safavi, Usman Khan","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-19T03:53:37Z","title":"An opportunistic linear-convex algorithm for localization in mobile robot networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06387","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:69608cadc4f3866396775bfd0a947238ce9f376b8a8498b04b2242fde1acaaa7","target":"record","created_at":"2026-05-18T00:48:23Z","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":"c404a20679cf94e196616f511c453dcaf51c64b0f0524f3cfd757307f6e0ee10","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-19T03:53:37Z","title_canon_sha256":"b0f039c5cdbe5c0fa1941b64dcaee262e9a366a8a74cdfd923e803d107d644c2"},"schema_version":"1.0","source":{"id":"1703.06387","kind":"arxiv","version":1}},"canonical_sha256":"67cd31e72104f01c8135a1cdcc859f24f947f48c2708b4a12788e6e4fb1380bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67cd31e72104f01c8135a1cdcc859f24f947f48c2708b4a12788e6e4fb1380bc","first_computed_at":"2026-05-18T00:48:23.053815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:23.053815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z0rp5K/fHod1j6cAJMxprfhPEJeoCwdy0MHzXmUWbk3KfQGpzFOj/TeWR/ar1bVd9wk20ImhXrlG+rutozxiCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:23.054311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06387","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69608cadc4f3866396775bfd0a947238ce9f376b8a8498b04b2242fde1acaaa7","sha256:a59ef06e7ff994385bd2aef548a0690fce7a808ea07a28f2cd4e2cac215e7e64"],"state_sha256":"f6b3f506fdfcaf464b33bf7c0aea12de644af74d4bb76b895ae2e5ce71684b51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lHiKgR/aoGt7/np0RM6GxU2gCgzQn6mZExGRS0/5DsSvUpxcugMZasIbzdWE+gbl3mY15rz9Rylwb4V+f/umDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:10:35.976424Z","bundle_sha256":"f8309d71a04396a6d68964f8c76b220b59a5714cd8faeb7dd937995c9d0d48a2"}}