{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XPZACJCCTOIUY2HESHN4HPWW2X","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":"670ad36650cf5cc0e8a927904896dfb8186d125c56f75140ea93747b355e261c","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T08:04:43Z","title_canon_sha256":"ab7e76c710b9fbc24665a38efdc01b63ff6f76d8227e8307f8ee5e1241612e5e"},"schema_version":"1.0","source":{"id":"1606.02055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02055","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02055v1","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02055","created_at":"2026-05-18T01:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"XPZACJCCTOIU","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XPZACJCCTOIUY2HE","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XPZACJCC","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:e0c319ac753acdb91695c24aa3f701e1af1be4200f2a2fd4f9408585ff52beb3","target":"graph","created_at":"2026-05-18T01:12:44Z","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":"This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be followed around a given set of obstacles. Our solution consists in an original refinement algorithm for constrained Delaunay triangulations, aimed at generating a roadmap graph suited for planning paths with arbitrary clearance. In other words, a minimum distance to the obstacles can be specified, and the graph does not have to be recomputed if this distance","authors_text":"Bernard Boigelot, St\\'ephane Lens","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T08:04:43Z","title":"From Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02055","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:2b65af2f13865586910b1aae622eb8842024f56164f8dca4a8f31dcb9524e81a","target":"record","created_at":"2026-05-18T01:12:44Z","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":"670ad36650cf5cc0e8a927904896dfb8186d125c56f75140ea93747b355e261c","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T08:04:43Z","title_canon_sha256":"ab7e76c710b9fbc24665a38efdc01b63ff6f76d8227e8307f8ee5e1241612e5e"},"schema_version":"1.0","source":{"id":"1606.02055","kind":"arxiv","version":1}},"canonical_sha256":"bbf20124429b914c68e491dbc3bed6d5d40d3dfdeb29376ae4a481a83e77f4fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbf20124429b914c68e491dbc3bed6d5d40d3dfdeb29376ae4a481a83e77f4fb","first_computed_at":"2026-05-18T01:12:44.708827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:44.708827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yxhgL7U+t3Scaoqe+QL5j4U/3JNoU6SaCPhaMdI7FR8q01Iy4bjWpQITdrz09iGSuxvKl+up+rNSZUWJZH/NDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:44.709199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b65af2f13865586910b1aae622eb8842024f56164f8dca4a8f31dcb9524e81a","sha256:e0c319ac753acdb91695c24aa3f701e1af1be4200f2a2fd4f9408585ff52beb3"],"state_sha256":"d2a4ca2f4c0aec68c2045461f22df7a1959b9a2d5ea8d53b88e576647481c033"}