{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VF6FLSBQBU7KQRBYGK4WDGHC6U","short_pith_number":"pith:VF6FLSBQ","schema_version":"1.0","canonical_sha256":"a97c55c8300d3ea8443832b96198e2f51cc5fa5bfaaa00a340013011da2c4813","source":{"kind":"arxiv","id":"1012.5253","version":1},"attestation_state":"computed","paper":{"title":"Exploring Simple Triangular and Hexagonal Grid Polygons Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Daniel Herrmann, Elmar Langetepe, Tom Kamphans","submitted_at":"2010-12-23T17:17:25Z","abstract_excerpt":"We investigate the online exploration problem (aka covering) of a short-sighted mobile robot moving in an unknown cellular environment with hexagons and triangles as types of cells. To explore a cell, the robot must enter it. Once inside, the robot knows which of the 3 or 6 adjacent cells exist and which are boundary edges. The robot's task is to visit every cell in the given environment and to return to the start. Our interest is in a short exploration tour; that is, in keeping the number of multiple cell visits small. For arbitrary environments containing no obstacles we provide a strategy p"},"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.5253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-23T17:17:25Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"429517d4bb675097de0a7e45e8393dbcbda64d440bed7a48a44a4bd212c540b4","abstract_canon_sha256":"bf17d95f16be6a3c35b05c978db5d6aa742d42878e77fc078d167853f490120e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:35.525602Z","signature_b64":"L3CzLHxUIwUv1XsKYRlEx84ga2oJ8ZC/BVdGa+ES/WdW6Jk/eLLF7fE+9DWfuZ11UPcHxzZLJdxYW6xIyuVDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a97c55c8300d3ea8443832b96198e2f51cc5fa5bfaaa00a340013011da2c4813","last_reissued_at":"2026-05-18T04:32:35.525124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:35.525124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Simple Triangular and Hexagonal Grid Polygons Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Daniel Herrmann, Elmar Langetepe, Tom Kamphans","submitted_at":"2010-12-23T17:17:25Z","abstract_excerpt":"We investigate the online exploration problem (aka covering) of a short-sighted mobile robot moving in an unknown cellular environment with hexagons and triangles as types of cells. To explore a cell, the robot must enter it. Once inside, the robot knows which of the 3 or 6 adjacent cells exist and which are boundary edges. The robot's task is to visit every cell in the given environment and to return to the start. Our interest is in a short exploration tour; that is, in keeping the number of multiple cell visits small. For arbitrary environments containing no obstacles we provide a strategy p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5253","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.5253","created_at":"2026-05-18T04:32:35.525197+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5253v1","created_at":"2026-05-18T04:32:35.525197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5253","created_at":"2026-05-18T04:32:35.525197+00:00"},{"alias_kind":"pith_short_12","alias_value":"VF6FLSBQBU7K","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VF6FLSBQBU7KQRBY","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VF6FLSBQ","created_at":"2026-05-18T12:26:15.391820+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/VF6FLSBQBU7KQRBYGK4WDGHC6U","json":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U.json","graph_json":"https://pith.science/api/pith-number/VF6FLSBQBU7KQRBYGK4WDGHC6U/graph.json","events_json":"https://pith.science/api/pith-number/VF6FLSBQBU7KQRBYGK4WDGHC6U/events.json","paper":"https://pith.science/paper/VF6FLSBQ"},"agent_actions":{"view_html":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U","download_json":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U.json","view_paper":"https://pith.science/paper/VF6FLSBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5253&json=true","fetch_graph":"https://pith.science/api/pith-number/VF6FLSBQBU7KQRBYGK4WDGHC6U/graph.json","fetch_events":"https://pith.science/api/pith-number/VF6FLSBQBU7KQRBYGK4WDGHC6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U/action/storage_attestation","attest_author":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U/action/author_attestation","sign_citation":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U/action/citation_signature","submit_replication":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U/action/replication_record"}},"created_at":"2026-05-18T04:32:35.525197+00:00","updated_at":"2026-05-18T04:32:35.525197+00:00"}