{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VF6FLSBQBU7KQRBYGK4WDGHC6U","short_pith_number":"pith:VF6FLSBQ","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"},"canonical_sha256":"a97c55c8300d3ea8443832b96198e2f51cc5fa5bfaaa00a340013011da2c4813","source":{"kind":"arxiv","id":"1012.5253","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5253","created_at":"2026-05-18T04:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5253v1","created_at":"2026-05-18T04:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5253","created_at":"2026-05-18T04:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"VF6FLSBQBU7K","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VF6FLSBQBU7KQRBY","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VF6FLSBQ","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VF6FLSBQBU7KQRBYGK4WDGHC6U","target":"record","payload":{"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"},"canonical_sha256":"a97c55c8300d3ea8443832b96198e2f51cc5fa5bfaaa00a340013011da2c4813","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"},"source_kind":"arxiv","source_id":"1012.5253","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:32:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3A640tz8jAGy2jTCRKEKKahIINcQqdbtMf9uuFqWGB3KzTAByIoBMP0EnrnJz29N+9Hr5YNYdmnHQxVRGR8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:18:25.187133Z"},"content_sha256":"5b0dc6797544fbc400b1f0466519f2ada7649294e3b4c30cf7bb968033916d48","schema_version":"1.0","event_id":"sha256:5b0dc6797544fbc400b1f0466519f2ada7649294e3b4c30cf7bb968033916d48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VF6FLSBQBU7KQRBYGK4WDGHC6U","target":"graph","payload":{"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"},"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:32:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xKdAiJHJ/MwKXPhuxW3tIAw3rWSYVNVnrBJ1+x2V1preyAwFhSiZjP7NpJA/2773DPWAzPCEA2jEo1LOWD+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:18:25.187495Z"},"content_sha256":"bf45233384ab910a3015b1906b9db54dd1d34fc458bf4d8ab1648ae0ffb22444","schema_version":"1.0","event_id":"sha256:bf45233384ab910a3015b1906b9db54dd1d34fc458bf4d8ab1648ae0ffb22444"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U/bundle.json","state_url":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U/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-06-04T13:18:25Z","links":{"resolver":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U","bundle":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U/bundle.json","state":"https://pith.science/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VF6FLSBQBU7KQRBYGK4WDGHC6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VF6FLSBQBU7KQRBYGK4WDGHC6U","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":"bf17d95f16be6a3c35b05c978db5d6aa742d42878e77fc078d167853f490120e","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-23T17:17:25Z","title_canon_sha256":"429517d4bb675097de0a7e45e8393dbcbda64d440bed7a48a44a4bd212c540b4"},"schema_version":"1.0","source":{"id":"1012.5253","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5253","created_at":"2026-05-18T04:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5253v1","created_at":"2026-05-18T04:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5253","created_at":"2026-05-18T04:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"VF6FLSBQBU7K","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VF6FLSBQBU7KQRBY","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VF6FLSBQ","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:bf45233384ab910a3015b1906b9db54dd1d34fc458bf4d8ab1648ae0ffb22444","target":"graph","created_at":"2026-05-18T04:32:35Z","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":"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","authors_text":"Daniel Herrmann, Elmar Langetepe, Tom Kamphans","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-23T17:17:25Z","title":"Exploring Simple Triangular and Hexagonal Grid Polygons Online"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5253","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:5b0dc6797544fbc400b1f0466519f2ada7649294e3b4c30cf7bb968033916d48","target":"record","created_at":"2026-05-18T04:32:35Z","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":"bf17d95f16be6a3c35b05c978db5d6aa742d42878e77fc078d167853f490120e","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-23T17:17:25Z","title_canon_sha256":"429517d4bb675097de0a7e45e8393dbcbda64d440bed7a48a44a4bd212c540b4"},"schema_version":"1.0","source":{"id":"1012.5253","kind":"arxiv","version":1}},"canonical_sha256":"a97c55c8300d3ea8443832b96198e2f51cc5fa5bfaaa00a340013011da2c4813","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a97c55c8300d3ea8443832b96198e2f51cc5fa5bfaaa00a340013011da2c4813","first_computed_at":"2026-05-18T04:32:35.525124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:35.525124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L3CzLHxUIwUv1XsKYRlEx84ga2oJ8ZC/BVdGa+ES/WdW6Jk/eLLF7fE+9DWfuZ11UPcHxzZLJdxYW6xIyuVDBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:35.525602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.5253","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b0dc6797544fbc400b1f0466519f2ada7649294e3b4c30cf7bb968033916d48","sha256:bf45233384ab910a3015b1906b9db54dd1d34fc458bf4d8ab1648ae0ffb22444"],"state_sha256":"da912c651808cb1ff0c4f61e30f192c07bd3bc2b3e35f1be0f0cdd65d027c6dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0gR7Xx8ayP4CM8Y0HnT9sqaF9AeFeutNJzz+VYm6WeX/RJanGHD5NhQa3b5Qu51nBivcAERz87XL3jCf9RsDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:18:25.189511Z","bundle_sha256":"db52125a59ddaa383e83488129ef551dcbcd0866f0b843d848759786815b1d81"}}