{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:FC6YKIM65XUAKB2OC6BEYP7R3M","short_pith_number":"pith:FC6YKIM6","schema_version":"1.0","canonical_sha256":"28bd85219eede805074e17824c3ff1db23796df86196b6c6b702877c048ab677","source":{"kind":"arxiv","id":"1011.5914","version":1},"attestation_state":"computed","paper":{"title":"Static and Expanding Grid Coverage with Ant Robots : Complexity Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Alfred Bruckstein, Yaniv Altshuler","submitted_at":"2010-11-26T21:17:31Z","abstract_excerpt":"In this paper we study the strengths and limitations of collaborative teams of simple agents. In particular, we discuss the efficient use of \"ant robots\" for covering a connected region on the Z^{2} grid, whose area is unknown in advance, and which expands at a given rate, where $n$ is the initial size of the connected region.\n  We show that regardless of the algorithm used, and the robots' hardware and software specifications, the minimal number of robots required in order for such coverage to be possible is \\Omega({\\sqrt{n}}).\n  In addition, we show that when the region expands at a sufficie"},"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":"1011.5914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2010-11-26T21:17:31Z","cross_cats_sorted":[],"title_canon_sha256":"4cd4aa4de6092734d45a205131cb41806cfb5b86332518b2db5d8c8a1dee56d9","abstract_canon_sha256":"47289f4757afc2ce28ab698b4b1075fc8ba86a24fa3ce6bf1a3378fd8d9d21b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:37.919144Z","signature_b64":"grWsnlpAgI4ZcQ/C0IkxOXAKV5R4T/yf/YL/MUHLgIo39K4rUswJWvFglhNEeho9GMzMXRnlDALDznwEaZ/eBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28bd85219eede805074e17824c3ff1db23796df86196b6c6b702877c048ab677","last_reissued_at":"2026-05-18T04:34:37.918447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:37.918447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Static and Expanding Grid Coverage with Ant Robots : Complexity Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Alfred Bruckstein, Yaniv Altshuler","submitted_at":"2010-11-26T21:17:31Z","abstract_excerpt":"In this paper we study the strengths and limitations of collaborative teams of simple agents. In particular, we discuss the efficient use of \"ant robots\" for covering a connected region on the Z^{2} grid, whose area is unknown in advance, and which expands at a given rate, where $n$ is the initial size of the connected region.\n  We show that regardless of the algorithm used, and the robots' hardware and software specifications, the minimal number of robots required in order for such coverage to be possible is \\Omega({\\sqrt{n}}).\n  In addition, we show that when the region expands at a sufficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5914","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":"1011.5914","created_at":"2026-05-18T04:34:37.918558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5914v1","created_at":"2026-05-18T04:34:37.918558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5914","created_at":"2026-05-18T04:34:37.918558+00:00"},{"alias_kind":"pith_short_12","alias_value":"FC6YKIM65XUA","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"FC6YKIM65XUAKB2O","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"FC6YKIM6","created_at":"2026-05-18T12:26:06.534383+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/FC6YKIM65XUAKB2OC6BEYP7R3M","json":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M.json","graph_json":"https://pith.science/api/pith-number/FC6YKIM65XUAKB2OC6BEYP7R3M/graph.json","events_json":"https://pith.science/api/pith-number/FC6YKIM65XUAKB2OC6BEYP7R3M/events.json","paper":"https://pith.science/paper/FC6YKIM6"},"agent_actions":{"view_html":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M","download_json":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M.json","view_paper":"https://pith.science/paper/FC6YKIM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5914&json=true","fetch_graph":"https://pith.science/api/pith-number/FC6YKIM65XUAKB2OC6BEYP7R3M/graph.json","fetch_events":"https://pith.science/api/pith-number/FC6YKIM65XUAKB2OC6BEYP7R3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M/action/storage_attestation","attest_author":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M/action/author_attestation","sign_citation":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M/action/citation_signature","submit_replication":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M/action/replication_record"}},"created_at":"2026-05-18T04:34:37.918558+00:00","updated_at":"2026-05-18T04:34:37.918558+00:00"}