{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FICYNOPSVAOZ4V3O6BIBTQM6RE","short_pith_number":"pith:FICYNOPS","canonical_record":{"source":{"id":"1001.0639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-05T07:29:11Z","cross_cats_sorted":[],"title_canon_sha256":"6500954366cd60fd4344706cc12cc722970d95ad013713c7b82f49239a420da2","abstract_canon_sha256":"fd6db917faf714b05e61d66a2a2a6b02363a80b475897bb43e6f3018dc2302b2"},"schema_version":"1.0"},"canonical_sha256":"2a0586b9f2a81d9e576ef05019c19e890af0b730a2885fb569a75e58c1761f19","source":{"kind":"arxiv","id":"1001.0639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.0639","created_at":"2026-05-18T02:10:05Z"},{"alias_kind":"arxiv_version","alias_value":"1001.0639v1","created_at":"2026-05-18T02:10:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0639","created_at":"2026-05-18T02:10:05Z"},{"alias_kind":"pith_short_12","alias_value":"FICYNOPSVAOZ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FICYNOPSVAOZ4V3O","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FICYNOPS","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FICYNOPSVAOZ4V3O6BIBTQM6RE","target":"record","payload":{"canonical_record":{"source":{"id":"1001.0639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-05T07:29:11Z","cross_cats_sorted":[],"title_canon_sha256":"6500954366cd60fd4344706cc12cc722970d95ad013713c7b82f49239a420da2","abstract_canon_sha256":"fd6db917faf714b05e61d66a2a2a6b02363a80b475897bb43e6f3018dc2302b2"},"schema_version":"1.0"},"canonical_sha256":"2a0586b9f2a81d9e576ef05019c19e890af0b730a2885fb569a75e58c1761f19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:10:05.091574Z","signature_b64":"VUFodAw6XSCmGhqdIzWrKyZgbdfYCZ3fOTvGs+4ck1r+Vm8+bvGtNKUAkH1xvJQX24FAPPqdF72fIpak1vR+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a0586b9f2a81d9e576ef05019c19e890af0b730a2885fb569a75e58c1761f19","last_reissued_at":"2026-05-18T02:10:05.090859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:10:05.090859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.0639","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-18T02:10:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tb5uGLRypWtHQSjGjjCCO/xIKPtuvfruZPiFBDPYIPYF93bU1LP0+WKvf/A0YKzDMmp2T+KU9280PXbV6txRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:23:39.213747Z"},"content_sha256":"002e2ee461d4904ae7f049158d4f61149526abcb19feef68bb8f88d7a5384f9d","schema_version":"1.0","event_id":"sha256:002e2ee461d4904ae7f049158d4f61149526abcb19feef68bb8f88d7a5384f9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FICYNOPSVAOZ4V3O6BIBTQM6RE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Exploration of Terrains with Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrzej Pelc, Arnaud Labourel (LaBRI), David Ilcinkas (LaBRI, INRIA Bordeaux - Sud-Ouest), Jurek Czyzowicz","submitted_at":"2010-01-05T07:29:11Z","abstract_excerpt":"A mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. We consider two scenarios: the unlimited vision, when the robot situated at a point p of the terrain explores (sees) all points q of the terrain for which the segment pq belongs to the terrain, and the limited vision, when we require additionally that the distance between p and q be at most 1. All points of the terrain (except obstacles) have to be explored and the performance of an exploration algorithm is measured by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0639","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-18T02:10:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q33xzsQuqklnvO0uBUX+4gHLGWGegynyeLRbiueD+L0WiuLqwg3Q+A6LG7xPvJM8doA7Eg6kFNXQcAFWH9bvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:23:39.214085Z"},"content_sha256":"de2a616a78f7f0f1b3ca07fe2dca00ec7f38d9711e994ab6feaa3c1cec8bd5d7","schema_version":"1.0","event_id":"sha256:de2a616a78f7f0f1b3ca07fe2dca00ec7f38d9711e994ab6feaa3c1cec8bd5d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE/bundle.json","state_url":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE/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-22T11:23:39Z","links":{"resolver":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE","bundle":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE/bundle.json","state":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FICYNOPSVAOZ4V3O6BIBTQM6RE","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":"fd6db917faf714b05e61d66a2a2a6b02363a80b475897bb43e6f3018dc2302b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-05T07:29:11Z","title_canon_sha256":"6500954366cd60fd4344706cc12cc722970d95ad013713c7b82f49239a420da2"},"schema_version":"1.0","source":{"id":"1001.0639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.0639","created_at":"2026-05-18T02:10:05Z"},{"alias_kind":"arxiv_version","alias_value":"1001.0639v1","created_at":"2026-05-18T02:10:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0639","created_at":"2026-05-18T02:10:05Z"},{"alias_kind":"pith_short_12","alias_value":"FICYNOPSVAOZ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FICYNOPSVAOZ4V3O","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FICYNOPS","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:de2a616a78f7f0f1b3ca07fe2dca00ec7f38d9711e994ab6feaa3c1cec8bd5d7","target":"graph","created_at":"2026-05-18T02:10:05Z","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":"A mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. We consider two scenarios: the unlimited vision, when the robot situated at a point p of the terrain explores (sees) all points q of the terrain for which the segment pq belongs to the terrain, and the limited vision, when we require additionally that the distance between p and q be at most 1. All points of the terrain (except obstacles) have to be explored and the performance of an exploration algorithm is measured by","authors_text":"Andrzej Pelc, Arnaud Labourel (LaBRI), David Ilcinkas (LaBRI, INRIA Bordeaux - Sud-Ouest), Jurek Czyzowicz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-05T07:29:11Z","title":"Optimal Exploration of Terrains with Obstacles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0639","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:002e2ee461d4904ae7f049158d4f61149526abcb19feef68bb8f88d7a5384f9d","target":"record","created_at":"2026-05-18T02:10:05Z","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":"fd6db917faf714b05e61d66a2a2a6b02363a80b475897bb43e6f3018dc2302b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-05T07:29:11Z","title_canon_sha256":"6500954366cd60fd4344706cc12cc722970d95ad013713c7b82f49239a420da2"},"schema_version":"1.0","source":{"id":"1001.0639","kind":"arxiv","version":1}},"canonical_sha256":"2a0586b9f2a81d9e576ef05019c19e890af0b730a2885fb569a75e58c1761f19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a0586b9f2a81d9e576ef05019c19e890af0b730a2885fb569a75e58c1761f19","first_computed_at":"2026-05-18T02:10:05.090859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:10:05.090859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VUFodAw6XSCmGhqdIzWrKyZgbdfYCZ3fOTvGs+4ck1r+Vm8+bvGtNKUAkH1xvJQX24FAPPqdF72fIpak1vR+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:10:05.091574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.0639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:002e2ee461d4904ae7f049158d4f61149526abcb19feef68bb8f88d7a5384f9d","sha256:de2a616a78f7f0f1b3ca07fe2dca00ec7f38d9711e994ab6feaa3c1cec8bd5d7"],"state_sha256":"9e783c8d4f5dcf3b0a9aa2f7aff99ac7e8ff125160c5b91c2b330c8bb5c84497"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mupxGEaic6ysVkUD80iBK56kCfh61OazeJYrKxlG5RwAyHeJsKmH1juWJvzdNbmOi2oz12zjaFXfkUm6OTyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:23:39.215995Z","bundle_sha256":"05c6557a5f8b7e70f8e05d81a0551444286e3db0d0b7515309b1c67606442eac"}}