{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FC6YKIM65XUAKB2OC6BEYP7R3M","short_pith_number":"pith:FC6YKIM6","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"},"canonical_sha256":"28bd85219eede805074e17824c3ff1db23796df86196b6c6b702877c048ab677","source":{"kind":"arxiv","id":"1011.5914","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5914","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5914v1","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5914","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"FC6YKIM65XUA","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"FC6YKIM65XUAKB2O","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"FC6YKIM6","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FC6YKIM65XUAKB2OC6BEYP7R3M","target":"record","payload":{"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"},"canonical_sha256":"28bd85219eede805074e17824c3ff1db23796df86196b6c6b702877c048ab677","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"},"source_kind":"arxiv","source_id":"1011.5914","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-18T04:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NoEmUu4DS5bI9orJOtoiqp8YV9qwYeHnkC7OycHuHtdMV1UCSlJKtnEmd9/mJB8Bxht36+V16DEvvRNbJ4zEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T08:06:00.678415Z"},"content_sha256":"295332f1f8c6d13d26443667cb434113b14f15dd1fb2f386602ce678735a7ed2","schema_version":"1.0","event_id":"sha256:295332f1f8c6d13d26443667cb434113b14f15dd1fb2f386602ce678735a7ed2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FC6YKIM65XUAKB2OC6BEYP7R3M","target":"graph","payload":{"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"},"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-18T04:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AEOyk7PvUSKtYlESLiQ7XH7Iywhk5dOmSyZBM85Jx7LkSapa0c3L1v/mmMw8cEsAMa5PTRvibT0pPo++VlJ5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T08:06:00.678759Z"},"content_sha256":"3ee95557c5281e8946af2a8d990df05145e673c9884a967f54856b15ebec0508","schema_version":"1.0","event_id":"sha256:3ee95557c5281e8946af2a8d990df05145e673c9884a967f54856b15ebec0508"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M/bundle.json","state_url":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FC6YKIM65XUAKB2OC6BEYP7R3M/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-07-24T08:06:00Z","links":{"resolver":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M","bundle":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M/bundle.json","state":"https://pith.science/pith/FC6YKIM65XUAKB2OC6BEYP7R3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FC6YKIM65XUAKB2OC6BEYP7R3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FC6YKIM65XUAKB2OC6BEYP7R3M","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":"47289f4757afc2ce28ab698b4b1075fc8ba86a24fa3ce6bf1a3378fd8d9d21b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2010-11-26T21:17:31Z","title_canon_sha256":"4cd4aa4de6092734d45a205131cb41806cfb5b86332518b2db5d8c8a1dee56d9"},"schema_version":"1.0","source":{"id":"1011.5914","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5914","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5914v1","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5914","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"FC6YKIM65XUA","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"FC6YKIM65XUAKB2O","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"FC6YKIM6","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:3ee95557c5281e8946af2a8d990df05145e673c9884a967f54856b15ebec0508","target":"graph","created_at":"2026-05-18T04:34:37Z","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 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","authors_text":"Alfred Bruckstein, Yaniv Altshuler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2010-11-26T21:17:31Z","title":"Static and Expanding Grid Coverage with Ant Robots : Complexity Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5914","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:295332f1f8c6d13d26443667cb434113b14f15dd1fb2f386602ce678735a7ed2","target":"record","created_at":"2026-05-18T04:34:37Z","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":"47289f4757afc2ce28ab698b4b1075fc8ba86a24fa3ce6bf1a3378fd8d9d21b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2010-11-26T21:17:31Z","title_canon_sha256":"4cd4aa4de6092734d45a205131cb41806cfb5b86332518b2db5d8c8a1dee56d9"},"schema_version":"1.0","source":{"id":"1011.5914","kind":"arxiv","version":1}},"canonical_sha256":"28bd85219eede805074e17824c3ff1db23796df86196b6c6b702877c048ab677","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28bd85219eede805074e17824c3ff1db23796df86196b6c6b702877c048ab677","first_computed_at":"2026-05-18T04:34:37.918447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:37.918447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"grWsnlpAgI4ZcQ/C0IkxOXAKV5R4T/yf/YL/MUHLgIo39K4rUswJWvFglhNEeho9GMzMXRnlDALDznwEaZ/eBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:37.919144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5914","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:295332f1f8c6d13d26443667cb434113b14f15dd1fb2f386602ce678735a7ed2","sha256:3ee95557c5281e8946af2a8d990df05145e673c9884a967f54856b15ebec0508"],"state_sha256":"ad5ede5bbd8e5c705bf9d4bd3390f1697ac66b0aa8ee54bfcd59848327f5d93a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QoD1Gtf4cA/LDRqu+PV+z1LRPX2vsDdMyeO27rKvXNfCMtkoOm2z/yE5AYRdjwNODh6EsZbowhRsxKxeXmBQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-24T08:06:00.680912Z","bundle_sha256":"2b862c552edb6cddd879d84a69d019afcc00af6a070f5c6035a2fff3030e0e5c"}}