{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BYDJYTOFRWO6O35U4L6FZFDV2X","short_pith_number":"pith:BYDJYTOF","schema_version":"1.0","canonical_sha256":"0e069c4dc58d9de76fb4e2fc5c9475d5e34ada4d196b939d8308a45e0652f407","source":{"kind":"arxiv","id":"1905.09271","version":4},"attestation_state":"computed","paper":{"title":"Infinite Grid Exploration by Disoriented Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.DC","authors_text":"Pascal Lafourcade, Quentin Bramas, Stephane Devismes","submitted_at":"2019-05-22T17:57:34Z","abstract_excerpt":"We deal with a set of autonomous robots moving on an infinite grid. Those robots are opaque, have limited visibility capabilities, and run using synchronous Look-Compute-Move cycles. They all agree on a common chirality, but have no global compass. Finally, they may use lights of different colors, but except from that, robots have neither persistent memories, nor communication mean. We consider the infinite grid exploration (IGE) problem. For this problem we give two impossibility results and three algorithms, including one which is optimal in terms of number of robots. In more detail, we firs"},"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":"1905.09271","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-22T17:57:34Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"6fd78ddea4461839d545fcdd9359fdf72dfccbc8a8e682a57058218111aa3e2f","abstract_canon_sha256":"1cf51ba6630ebd15c424301d3a313ea55b03cf5b14956d66beb2a89827a992ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:42.036823Z","signature_b64":"KpjnTF15Bl5WWkU9HDgcC+tl0vTv7LZgsExnTt6JOrrvmdHAJtX9hASgRTpn6OXOssPtllLeIYDoJzjV8y+2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e069c4dc58d9de76fb4e2fc5c9475d5e34ada4d196b939d8308a45e0652f407","last_reissued_at":"2026-05-17T23:41:42.036282Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:42.036282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite Grid Exploration by Disoriented Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.DC","authors_text":"Pascal Lafourcade, Quentin Bramas, Stephane Devismes","submitted_at":"2019-05-22T17:57:34Z","abstract_excerpt":"We deal with a set of autonomous robots moving on an infinite grid. Those robots are opaque, have limited visibility capabilities, and run using synchronous Look-Compute-Move cycles. They all agree on a common chirality, but have no global compass. Finally, they may use lights of different colors, but except from that, robots have neither persistent memories, nor communication mean. We consider the infinite grid exploration (IGE) problem. For this problem we give two impossibility results and three algorithms, including one which is optimal in terms of number of robots. In more detail, we firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09271","kind":"arxiv","version":4},"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":"1905.09271","created_at":"2026-05-17T23:41:42.036386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.09271v4","created_at":"2026-05-17T23:41:42.036386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09271","created_at":"2026-05-17T23:41:42.036386+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYDJYTOFRWO6","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYDJYTOFRWO6O35U","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYDJYTOF","created_at":"2026-05-18T12:33:12.712433+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/BYDJYTOFRWO6O35U4L6FZFDV2X","json":"https://pith.science/pith/BYDJYTOFRWO6O35U4L6FZFDV2X.json","graph_json":"https://pith.science/api/pith-number/BYDJYTOFRWO6O35U4L6FZFDV2X/graph.json","events_json":"https://pith.science/api/pith-number/BYDJYTOFRWO6O35U4L6FZFDV2X/events.json","paper":"https://pith.science/paper/BYDJYTOF"},"agent_actions":{"view_html":"https://pith.science/pith/BYDJYTOFRWO6O35U4L6FZFDV2X","download_json":"https://pith.science/pith/BYDJYTOFRWO6O35U4L6FZFDV2X.json","view_paper":"https://pith.science/paper/BYDJYTOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.09271&json=true","fetch_graph":"https://pith.science/api/pith-number/BYDJYTOFRWO6O35U4L6FZFDV2X/graph.json","fetch_events":"https://pith.science/api/pith-number/BYDJYTOFRWO6O35U4L6FZFDV2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYDJYTOFRWO6O35U4L6FZFDV2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYDJYTOFRWO6O35U4L6FZFDV2X/action/storage_attestation","attest_author":"https://pith.science/pith/BYDJYTOFRWO6O35U4L6FZFDV2X/action/author_attestation","sign_citation":"https://pith.science/pith/BYDJYTOFRWO6O35U4L6FZFDV2X/action/citation_signature","submit_replication":"https://pith.science/pith/BYDJYTOFRWO6O35U4L6FZFDV2X/action/replication_record"}},"created_at":"2026-05-17T23:41:42.036386+00:00","updated_at":"2026-05-17T23:41:42.036386+00:00"}