{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XPZACJCCTOIUY2HESHN4HPWW2X","short_pith_number":"pith:XPZACJCC","canonical_record":{"source":{"id":"1606.02055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T08:04:43Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"ab7e76c710b9fbc24665a38efdc01b63ff6f76d8227e8307f8ee5e1241612e5e","abstract_canon_sha256":"670ad36650cf5cc0e8a927904896dfb8186d125c56f75140ea93747b355e261c"},"schema_version":"1.0"},"canonical_sha256":"bbf20124429b914c68e491dbc3bed6d5d40d3dfdeb29376ae4a481a83e77f4fb","source":{"kind":"arxiv","id":"1606.02055","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XPZACJCCTOIUY2HESHN4HPWW2X","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T08:04:43Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"ab7e76c710b9fbc24665a38efdc01b63ff6f76d8227e8307f8ee5e1241612e5e","abstract_canon_sha256":"670ad36650cf5cc0e8a927904896dfb8186d125c56f75140ea93747b355e261c"},"schema_version":"1.0"},"canonical_sha256":"bbf20124429b914c68e491dbc3bed6d5d40d3dfdeb29376ae4a481a83e77f4fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:44.709199Z","signature_b64":"yxhgL7U+t3Scaoqe+QL5j4U/3JNoU6SaCPhaMdI7FR8q01Iy4bjWpQITdrz09iGSuxvKl+up+rNSZUWJZH/NDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbf20124429b914c68e491dbc3bed6d5d40d3dfdeb29376ae4a481a83e77f4fb","last_reissued_at":"2026-05-18T01:12:44.708827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:44.708827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02055","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-18T01:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xRxBNDAEo+0ZrLO/P5QyF84YOwL5oQTrGWXMS5E0z2B+KN5tMLo7A6+xw+rquHVIcc9LYJj2mkxpbWBa1TMsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:53:29.419534Z"},"content_sha256":"2b65af2f13865586910b1aae622eb8842024f56164f8dca4a8f31dcb9524e81a","schema_version":"1.0","event_id":"sha256:2b65af2f13865586910b1aae622eb8842024f56164f8dca4a8f31dcb9524e81a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XPZACJCCTOIUY2HESHN4HPWW2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Bernard Boigelot, St\\'ephane Lens","submitted_at":"2016-06-07T08:04:43Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02055","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-18T01:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3zn2+n/+ldD1nSByKcC4/ngXAINUl3Q7SnLmotLz6SggEdZ8zGXRlLFi4S3I/KxSEyi9B3mYCXqWKaqeSQHBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:53:29.419868Z"},"content_sha256":"e0c319ac753acdb91695c24aa3f701e1af1be4200f2a2fd4f9408585ff52beb3","schema_version":"1.0","event_id":"sha256:e0c319ac753acdb91695c24aa3f701e1af1be4200f2a2fd4f9408585ff52beb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X/bundle.json","state_url":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPZACJCCTOIUY2HESHN4HPWW2X/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-07-02T07:53:29Z","links":{"resolver":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X","bundle":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X/bundle.json","state":"https://pith.science/pith/XPZACJCCTOIUY2HESHN4HPWW2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPZACJCCTOIUY2HESHN4HPWW2X/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vGkruFdZiuE/XbB9l8/uMQlgeI8Ewkb9ScLoeIKQ4uZGZO+Erw6NZqpvCFzaZ6eiAqWhvIjkf/pH1SsuI9yoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T07:53:29.421815Z","bundle_sha256":"a83375b058f27baf47b957cd7bd6ac84da6a956a6d9c9d6227d37b168de328e3"}}