{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PAPP7TGZGJR5LM6QSGTBC4PZA5","short_pith_number":"pith:PAPP7TGZ","schema_version":"1.0","canonical_sha256":"781effccd93263d5b3d091a61171f9077e2b1b56d5564699a0fedb2bde716a40","source":{"kind":"arxiv","id":"1903.03259","version":1},"attestation_state":"computed","paper":{"title":"Minimizing Travel in the Uniform Dispersal Problem for Robotic Sensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Alfred M. Bruckstein, Michael Amir","submitted_at":"2019-03-08T03:01:25Z","abstract_excerpt":"The limited energy capacity of individual robotic agents in a swarm often limits the possible cooperative tasks they can perform. In this work, we investigate the problem of covering an unknown connected grid environment (e.g. a maze or connected corridors) with a robotic swarm so as to minimize the maximal number of steps that each member of the swarm makes and their activity time before their work is finished, thereby minimizing the energy requirements. The robots are autonomous, anonymous and identical, with local sensors and finite memory, and possess no communication capabilities. They ar"},"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":"1903.03259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-03-08T03:01:25Z","cross_cats_sorted":[],"title_canon_sha256":"95d9ac4dd9a51d2b461428f68c3c5aac6d6ac54d12c27e461475fb3b8b018fbe","abstract_canon_sha256":"6a74e5923e8bafa65b60b6dcdaf411200fc81acf6ccdbfed9a904acd32902a14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:46.061657Z","signature_b64":"aLaHcRuwMi9zMF4OHk5MYEI+/8SgDvjMOdbeOr/Kr5mUhmTuGf4i7eX3Mu/kEuA6N4ExqytmWs6Lt3v1QsbwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"781effccd93263d5b3d091a61171f9077e2b1b56d5564699a0fedb2bde716a40","last_reissued_at":"2026-05-17T23:51:46.060947Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:46.060947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing Travel in the Uniform Dispersal Problem for Robotic Sensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Alfred M. Bruckstein, Michael Amir","submitted_at":"2019-03-08T03:01:25Z","abstract_excerpt":"The limited energy capacity of individual robotic agents in a swarm often limits the possible cooperative tasks they can perform. In this work, we investigate the problem of covering an unknown connected grid environment (e.g. a maze or connected corridors) with a robotic swarm so as to minimize the maximal number of steps that each member of the swarm makes and their activity time before their work is finished, thereby minimizing the energy requirements. The robots are autonomous, anonymous and identical, with local sensors and finite memory, and possess no communication capabilities. They ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03259","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.03259","created_at":"2026-05-17T23:51:46.061052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03259v1","created_at":"2026-05-17T23:51:46.061052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03259","created_at":"2026-05-17T23:51:46.061052+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAPP7TGZGJR5","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAPP7TGZGJR5LM6Q","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAPP7TGZ","created_at":"2026-05-18T12:33:24.271573+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/PAPP7TGZGJR5LM6QSGTBC4PZA5","json":"https://pith.science/pith/PAPP7TGZGJR5LM6QSGTBC4PZA5.json","graph_json":"https://pith.science/api/pith-number/PAPP7TGZGJR5LM6QSGTBC4PZA5/graph.json","events_json":"https://pith.science/api/pith-number/PAPP7TGZGJR5LM6QSGTBC4PZA5/events.json","paper":"https://pith.science/paper/PAPP7TGZ"},"agent_actions":{"view_html":"https://pith.science/pith/PAPP7TGZGJR5LM6QSGTBC4PZA5","download_json":"https://pith.science/pith/PAPP7TGZGJR5LM6QSGTBC4PZA5.json","view_paper":"https://pith.science/paper/PAPP7TGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03259&json=true","fetch_graph":"https://pith.science/api/pith-number/PAPP7TGZGJR5LM6QSGTBC4PZA5/graph.json","fetch_events":"https://pith.science/api/pith-number/PAPP7TGZGJR5LM6QSGTBC4PZA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAPP7TGZGJR5LM6QSGTBC4PZA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAPP7TGZGJR5LM6QSGTBC4PZA5/action/storage_attestation","attest_author":"https://pith.science/pith/PAPP7TGZGJR5LM6QSGTBC4PZA5/action/author_attestation","sign_citation":"https://pith.science/pith/PAPP7TGZGJR5LM6QSGTBC4PZA5/action/citation_signature","submit_replication":"https://pith.science/pith/PAPP7TGZGJR5LM6QSGTBC4PZA5/action/replication_record"}},"created_at":"2026-05-17T23:51:46.061052+00:00","updated_at":"2026-05-17T23:51:46.061052+00:00"}