{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:EBXEPWXUFMDX27L52IVL3P3JND","short_pith_number":"pith:EBXEPWXU","schema_version":"1.0","canonical_sha256":"206e47daf42b077d7d7dd22abdbf6968d512ec4df9755021dc4ed50158402652","source":{"kind":"arxiv","id":"1012.5240","version":1},"attestation_state":"computed","paper":{"title":"Exploring Grid Polygons Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Christian Icking, Elmar Langetepe, Rolf Klein, Tom Kamphans","submitted_at":"2010-12-23T16:05:05Z","abstract_excerpt":"We investigate the exploration problem of a short-sighted mobile robot moving in an unknown cellular room. To explore a cell, the robot must enter it. Once inside, the robot knows which of the 4 adjacent cells exist and which are boundary edges. The robot starts from a specified cell adjacent to the room's outer wall; it visits each cell, and returns to the start. Our interest is in a short exploration tour; that is, in keeping the number of multiple cell visits small. For abitrary environments containing no obstacles we provide a strategy producing tours of length S <= C + 1/2 E - 3, and for "},"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":"1012.5240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-23T16:05:05Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"17b566136221b51dc6ab9654f0eae72ac39643e6f443ba0018cdcc3b9644c8f1","abstract_canon_sha256":"effc2fa0fa3e0c30ac91b27bf36b0422a8709a2ada5f9fb848a619d802f85557"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:35.545785Z","signature_b64":"7bs8pzQB7WvK55eWMZzgvt2QKBoeW3WkxnEpDiOV8m6nlJDn2rSGdmX0kfqK07MXcF2krbNmFEFn4p+ufKdGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"206e47daf42b077d7d7dd22abdbf6968d512ec4df9755021dc4ed50158402652","last_reissued_at":"2026-05-18T04:32:35.545254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:35.545254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Grid Polygons Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Christian Icking, Elmar Langetepe, Rolf Klein, Tom Kamphans","submitted_at":"2010-12-23T16:05:05Z","abstract_excerpt":"We investigate the exploration problem of a short-sighted mobile robot moving in an unknown cellular room. To explore a cell, the robot must enter it. Once inside, the robot knows which of the 4 adjacent cells exist and which are boundary edges. The robot starts from a specified cell adjacent to the room's outer wall; it visits each cell, and returns to the start. Our interest is in a short exploration tour; that is, in keeping the number of multiple cell visits small. For abitrary environments containing no obstacles we provide a strategy producing tours of length S <= C + 1/2 E - 3, and for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5240","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":"1012.5240","created_at":"2026-05-18T04:32:35.545339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5240v1","created_at":"2026-05-18T04:32:35.545339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5240","created_at":"2026-05-18T04:32:35.545339+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBXEPWXUFMDX","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBXEPWXUFMDX27L5","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBXEPWXU","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/EBXEPWXUFMDX27L52IVL3P3JND","json":"https://pith.science/pith/EBXEPWXUFMDX27L52IVL3P3JND.json","graph_json":"https://pith.science/api/pith-number/EBXEPWXUFMDX27L52IVL3P3JND/graph.json","events_json":"https://pith.science/api/pith-number/EBXEPWXUFMDX27L52IVL3P3JND/events.json","paper":"https://pith.science/paper/EBXEPWXU"},"agent_actions":{"view_html":"https://pith.science/pith/EBXEPWXUFMDX27L52IVL3P3JND","download_json":"https://pith.science/pith/EBXEPWXUFMDX27L52IVL3P3JND.json","view_paper":"https://pith.science/paper/EBXEPWXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5240&json=true","fetch_graph":"https://pith.science/api/pith-number/EBXEPWXUFMDX27L52IVL3P3JND/graph.json","fetch_events":"https://pith.science/api/pith-number/EBXEPWXUFMDX27L52IVL3P3JND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBXEPWXUFMDX27L52IVL3P3JND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBXEPWXUFMDX27L52IVL3P3JND/action/storage_attestation","attest_author":"https://pith.science/pith/EBXEPWXUFMDX27L52IVL3P3JND/action/author_attestation","sign_citation":"https://pith.science/pith/EBXEPWXUFMDX27L52IVL3P3JND/action/citation_signature","submit_replication":"https://pith.science/pith/EBXEPWXUFMDX27L52IVL3P3JND/action/replication_record"}},"created_at":"2026-05-18T04:32:35.545339+00:00","updated_at":"2026-05-18T04:32:35.545339+00:00"}