{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZII3FMICHAEYMRFBAHNF3NSP3C","short_pith_number":"pith:ZII3FMIC","canonical_record":{"source":{"id":"1807.09392","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-07-24T23:41:58Z","cross_cats_sorted":[],"title_canon_sha256":"4fee312e083a457dfb824e851123fb459c758fd597ef8e7fe3a7afc5efc87f91","abstract_canon_sha256":"3cc9d2f8bbfcb37215a446f8206e5ff809eabdb7b4a8486fe5245a9a72458374"},"schema_version":"1.0"},"canonical_sha256":"ca11b2b10238098644a101da5db64fd8805883bdd0a3b433f2d553ea14943d7f","source":{"kind":"arxiv","id":"1807.09392","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09392","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09392v1","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09392","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"ZII3FMICHAEY","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZII3FMICHAEYMRFB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZII3FMIC","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZII3FMICHAEYMRFBAHNF3NSP3C","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09392","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-07-24T23:41:58Z","cross_cats_sorted":[],"title_canon_sha256":"4fee312e083a457dfb824e851123fb459c758fd597ef8e7fe3a7afc5efc87f91","abstract_canon_sha256":"3cc9d2f8bbfcb37215a446f8206e5ff809eabdb7b4a8486fe5245a9a72458374"},"schema_version":"1.0"},"canonical_sha256":"ca11b2b10238098644a101da5db64fd8805883bdd0a3b433f2d553ea14943d7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:51.439098Z","signature_b64":"JleAhfNb4W7+Ig6EK6Dpy814zxui8KdyMGrtYxwWghinNaiYqSoFQuoTd9TstEaYu49kZKQm+gEqtGQUL9JIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca11b2b10238098644a101da5db64fd8805883bdd0a3b433f2d553ea14943d7f","last_reissued_at":"2026-05-18T00:09:51.438437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:51.438437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09392","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-18T00:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4SoJHte6kNw6RQ29qVuWDx9lc/xZcBY5irfKUXkmJ7fzIHlcnpsIts5TumphX3gZENKS39t/SatuGVY8dbEODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:46:18.453400Z"},"content_sha256":"4601ab54da7374efd841e3ca18d07a41b49cda4f34ac5dc62771ecfaaa6c6aa7","schema_version":"1.0","event_id":"sha256:4601ab54da7374efd841e3ca18d07a41b49cda4f34ac5dc62771ecfaaa6c6aa7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZII3FMICHAEYMRFBAHNF3NSP3C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Does a robot path have clearance c?","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hemant Malik, Ovidiu Daescu","submitted_at":"2018-07-24T23:41:58Z","abstract_excerpt":"Most path planning problems among polygonal obstacles ask to find a path that avoids the obstacles and is optimal with respect to some measure or a combination of measures, for example an $u$-to-$v$ shortest path of clearance at least $c$, where $u$ and $v$ are points in the free space and $c$ is a positive constant. In practical applications, such as emergency interventions/evacuations and medical treatment planning, a number of $u$-to-$v$ paths are suggested by experts and the question is whether such paths satisfy specific requirements, such as a given clearance from the obstacles. We addre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09392","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-18T00:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAwnzDK5/Hy2z1SkaY2oXjyPcMO/h5/6CJv5r2Y2xQnomVJ2EdaONKiC9tQ0cNI9tOTaQ8EkF1P1lAXAqlKNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:46:18.453746Z"},"content_sha256":"f1cfe63703aa4e6a78f4c1e0ae9b5d9a7a20fc592aead71413818e54e246f83b","schema_version":"1.0","event_id":"sha256:f1cfe63703aa4e6a78f4c1e0ae9b5d9a7a20fc592aead71413818e54e246f83b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZII3FMICHAEYMRFBAHNF3NSP3C/bundle.json","state_url":"https://pith.science/pith/ZII3FMICHAEYMRFBAHNF3NSP3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZII3FMICHAEYMRFBAHNF3NSP3C/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-03T17:46:18Z","links":{"resolver":"https://pith.science/pith/ZII3FMICHAEYMRFBAHNF3NSP3C","bundle":"https://pith.science/pith/ZII3FMICHAEYMRFBAHNF3NSP3C/bundle.json","state":"https://pith.science/pith/ZII3FMICHAEYMRFBAHNF3NSP3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZII3FMICHAEYMRFBAHNF3NSP3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZII3FMICHAEYMRFBAHNF3NSP3C","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":"3cc9d2f8bbfcb37215a446f8206e5ff809eabdb7b4a8486fe5245a9a72458374","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-07-24T23:41:58Z","title_canon_sha256":"4fee312e083a457dfb824e851123fb459c758fd597ef8e7fe3a7afc5efc87f91"},"schema_version":"1.0","source":{"id":"1807.09392","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09392","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09392v1","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09392","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"ZII3FMICHAEY","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZII3FMICHAEYMRFB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZII3FMIC","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:f1cfe63703aa4e6a78f4c1e0ae9b5d9a7a20fc592aead71413818e54e246f83b","target":"graph","created_at":"2026-05-18T00:09:51Z","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":"Most path planning problems among polygonal obstacles ask to find a path that avoids the obstacles and is optimal with respect to some measure or a combination of measures, for example an $u$-to-$v$ shortest path of clearance at least $c$, where $u$ and $v$ are points in the free space and $c$ is a positive constant. In practical applications, such as emergency interventions/evacuations and medical treatment planning, a number of $u$-to-$v$ paths are suggested by experts and the question is whether such paths satisfy specific requirements, such as a given clearance from the obstacles. We addre","authors_text":"Hemant Malik, Ovidiu Daescu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-07-24T23:41:58Z","title":"Does a robot path have clearance c?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09392","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:4601ab54da7374efd841e3ca18d07a41b49cda4f34ac5dc62771ecfaaa6c6aa7","target":"record","created_at":"2026-05-18T00:09:51Z","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":"3cc9d2f8bbfcb37215a446f8206e5ff809eabdb7b4a8486fe5245a9a72458374","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-07-24T23:41:58Z","title_canon_sha256":"4fee312e083a457dfb824e851123fb459c758fd597ef8e7fe3a7afc5efc87f91"},"schema_version":"1.0","source":{"id":"1807.09392","kind":"arxiv","version":1}},"canonical_sha256":"ca11b2b10238098644a101da5db64fd8805883bdd0a3b433f2d553ea14943d7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca11b2b10238098644a101da5db64fd8805883bdd0a3b433f2d553ea14943d7f","first_computed_at":"2026-05-18T00:09:51.438437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:51.438437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JleAhfNb4W7+Ig6EK6Dpy814zxui8KdyMGrtYxwWghinNaiYqSoFQuoTd9TstEaYu49kZKQm+gEqtGQUL9JIDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:51.439098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09392","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4601ab54da7374efd841e3ca18d07a41b49cda4f34ac5dc62771ecfaaa6c6aa7","sha256:f1cfe63703aa4e6a78f4c1e0ae9b5d9a7a20fc592aead71413818e54e246f83b"],"state_sha256":"cae74300fc675a18b58cac2108883e2b23d933e4b65b4b8ca018f355c482b99d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7qSLsPoxv+jHEsOGWdXuLtz6m+Mncog40a7NAOudA9eYL8NS4nfTr1lkgJm4NHMg64mMOnHU3n+SSzf1lnsAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:46:18.455705Z","bundle_sha256":"2ca9c67c2b86d0b40e8982ebd299b0f08c5fedcb3b4310e572cc088b8b82662c"}}