{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JRBUXTOX2EIWIM6QWGZXFV72JQ","short_pith_number":"pith:JRBUXTOX","schema_version":"1.0","canonical_sha256":"4c434bcdd7d1116433d0b1b372d7fa4c2d99cbf0c6463b30d14d0609246e2fc6","source":{"kind":"arxiv","id":"1505.05441","version":3},"attestation_state":"computed","paper":{"title":"Decentralized Simultaneous Multi-target Exploration using a Connected Network of Multiple Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Antonio Franchi, Heinrich H. B\\\"ulthoff, Paolo Robuffo Giordano, Thomas Nestmeyer","submitted_at":"2015-05-20T16:13:03Z","abstract_excerpt":"This paper presents a novel decentralized control strategy for a multi-robot system that enables parallel multi-target exploration while ensuring a time-varying connected topology in cluttered 3D environments. Flexible continuous connectivity is guaranteed by building upon a recent connectivity maintenance method, in which limited range, line-of-sight visibility, and collision avoidance are taken into account at the same time. Completeness of the decentralized multi-target exploration algorithm is guaranteed by dynamically assigning the robots with different motion behaviors during the explora"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1505.05441","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-05-20T16:13:03Z","cross_cats_sorted":[],"title_canon_sha256":"118b888e730a1056080810e1829adb47940dc6e75d9870bbdd2cc8484eb1db4c","abstract_canon_sha256":"0fc4673d59f93decdbd249e5787f8459d4e37512d239b9ee3b122d4e1ff05585"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:37.637329Z","signature_b64":"sXexBOd3B3BgcjwH/+IyfocV1QNyosZ7XMJLPB/DQO2z08eUozy543h2P20oodl/6GoJqICal5r/JyZR2JXJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c434bcdd7d1116433d0b1b372d7fa4c2d99cbf0c6463b30d14d0609246e2fc6","last_reissued_at":"2026-05-18T00:48:37.636631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:37.636631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Simultaneous Multi-target Exploration using a Connected Network of Multiple Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Antonio Franchi, Heinrich H. B\\\"ulthoff, Paolo Robuffo Giordano, Thomas Nestmeyer","submitted_at":"2015-05-20T16:13:03Z","abstract_excerpt":"This paper presents a novel decentralized control strategy for a multi-robot system that enables parallel multi-target exploration while ensuring a time-varying connected topology in cluttered 3D environments. Flexible continuous connectivity is guaranteed by building upon a recent connectivity maintenance method, in which limited range, line-of-sight visibility, and collision avoidance are taken into account at the same time. Completeness of the decentralized multi-target exploration algorithm is guaranteed by dynamically assigning the robots with different motion behaviors during the explora"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05441","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.05441","created_at":"2026-05-18T00:48:37.636734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05441v3","created_at":"2026-05-18T00:48:37.636734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05441","created_at":"2026-05-18T00:48:37.636734+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRBUXTOX2EIW","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRBUXTOX2EIWIM6Q","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRBUXTOX","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JRBUXTOX2EIWIM6QWGZXFV72JQ","json":"https://pith.science/pith/JRBUXTOX2EIWIM6QWGZXFV72JQ.json","graph_json":"https://pith.science/api/pith-number/JRBUXTOX2EIWIM6QWGZXFV72JQ/graph.json","events_json":"https://pith.science/api/pith-number/JRBUXTOX2EIWIM6QWGZXFV72JQ/events.json","paper":"https://pith.science/paper/JRBUXTOX"},"agent_actions":{"view_html":"https://pith.science/pith/JRBUXTOX2EIWIM6QWGZXFV72JQ","download_json":"https://pith.science/pith/JRBUXTOX2EIWIM6QWGZXFV72JQ.json","view_paper":"https://pith.science/paper/JRBUXTOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05441&json=true","fetch_graph":"https://pith.science/api/pith-number/JRBUXTOX2EIWIM6QWGZXFV72JQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JRBUXTOX2EIWIM6QWGZXFV72JQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRBUXTOX2EIWIM6QWGZXFV72JQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRBUXTOX2EIWIM6QWGZXFV72JQ/action/storage_attestation","attest_author":"https://pith.science/pith/JRBUXTOX2EIWIM6QWGZXFV72JQ/action/author_attestation","sign_citation":"https://pith.science/pith/JRBUXTOX2EIWIM6QWGZXFV72JQ/action/citation_signature","submit_replication":"https://pith.science/pith/JRBUXTOX2EIWIM6QWGZXFV72JQ/action/replication_record"}},"created_at":"2026-05-18T00:48:37.636734+00:00","updated_at":"2026-05-18T00:48:37.636734+00:00"}