{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:FICYNOPSVAOZ4V3O6BIBTQM6RE","short_pith_number":"pith:FICYNOPS","schema_version":"1.0","canonical_sha256":"2a0586b9f2a81d9e576ef05019c19e890af0b730a2885fb569a75e58c1761f19","source":{"kind":"arxiv","id":"1001.0639","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1001.0639","created_at":"2026-05-18T02:10:05.090958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.0639v1","created_at":"2026-05-18T02:10:05.090958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0639","created_at":"2026-05-18T02:10:05.090958+00:00"},{"alias_kind":"pith_short_12","alias_value":"FICYNOPSVAOZ","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"FICYNOPSVAOZ4V3O","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"FICYNOPS","created_at":"2026-05-18T12:26:07.630475+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/FICYNOPSVAOZ4V3O6BIBTQM6RE","json":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE.json","graph_json":"https://pith.science/api/pith-number/FICYNOPSVAOZ4V3O6BIBTQM6RE/graph.json","events_json":"https://pith.science/api/pith-number/FICYNOPSVAOZ4V3O6BIBTQM6RE/events.json","paper":"https://pith.science/paper/FICYNOPS"},"agent_actions":{"view_html":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE","download_json":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE.json","view_paper":"https://pith.science/paper/FICYNOPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.0639&json=true","fetch_graph":"https://pith.science/api/pith-number/FICYNOPSVAOZ4V3O6BIBTQM6RE/graph.json","fetch_events":"https://pith.science/api/pith-number/FICYNOPSVAOZ4V3O6BIBTQM6RE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE/action/storage_attestation","attest_author":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE/action/author_attestation","sign_citation":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE/action/citation_signature","submit_replication":"https://pith.science/pith/FICYNOPSVAOZ4V3O6BIBTQM6RE/action/replication_record"}},"created_at":"2026-05-18T02:10:05.090958+00:00","updated_at":"2026-05-18T02:10:05.090958+00:00"}