{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KMCGZRRZROIAZYAPNMMKZKMKJK","short_pith_number":"pith:KMCGZRRZ","schema_version":"1.0","canonical_sha256":"53046cc6398b900ce00f6b18aca98a4a9c9d5b4df756dd44d4458c2b81c5493e","source":{"kind":"arxiv","id":"1706.02939","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.RO"],"primary_cat":"cs.CG","authors_text":"Kyle Fox, Oren Salzman, Pankaj K. Agarwal","submitted_at":"2017-06-09T13:11:37Z","abstract_excerpt":"We study a path-planning problem amid a set $\\mathcal{O}$ of obstacles in $\\mathbb{R}^2$, in which we wish to compute a short path between two points while also maintaining a high clearance from $\\mathcal{O}$; the clearance of a point is its distance from a nearest obstacle in $\\mathcal{O}$. Specifically, the problem asks for a path minimizing the reciprocal of the clearance integrated over the length of the path. We present the first polynomial-time approximation scheme for this problem. Let $n$ be the total number of obstacle vertices and let $\\varepsilon \\in (0,1]$. Our algorithm computes i"},"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":"1706.02939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-09T13:11:37Z","cross_cats_sorted":["cs.DS","cs.RO"],"title_canon_sha256":"6df47781f886def02a1864413a57c0dcd6c0b8c779d0e61a530c357ebdb4d90e","abstract_canon_sha256":"baee7fc259a93efde6e285e9eb45ad15214c5f0f7dbe2bab25ba4bafe061f70a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:40.520343Z","signature_b64":"t9Cwu5hoyUHw8uTLe+iZkLUGYdj0QzxsLJcRWUeWKLw8lzuU4+1fQd76kyNfFY9Y3lA0yF7URz10XQYKa2E5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53046cc6398b900ce00f6b18aca98a4a9c9d5b4df756dd44d4458c2b81c5493e","last_reissued_at":"2026-05-18T00:42:40.519666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:40.519666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.RO"],"primary_cat":"cs.CG","authors_text":"Kyle Fox, Oren Salzman, Pankaj K. Agarwal","submitted_at":"2017-06-09T13:11:37Z","abstract_excerpt":"We study a path-planning problem amid a set $\\mathcal{O}$ of obstacles in $\\mathbb{R}^2$, in which we wish to compute a short path between two points while also maintaining a high clearance from $\\mathcal{O}$; the clearance of a point is its distance from a nearest obstacle in $\\mathcal{O}$. Specifically, the problem asks for a path minimizing the reciprocal of the clearance integrated over the length of the path. We present the first polynomial-time approximation scheme for this problem. Let $n$ be the total number of obstacle vertices and let $\\varepsilon \\in (0,1]$. Our algorithm computes i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02939","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":"1706.02939","created_at":"2026-05-18T00:42:40.519757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02939v1","created_at":"2026-05-18T00:42:40.519757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02939","created_at":"2026-05-18T00:42:40.519757+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMCGZRRZROIA","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMCGZRRZROIAZYAP","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMCGZRRZ","created_at":"2026-05-18T12:31:24.725408+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/KMCGZRRZROIAZYAPNMMKZKMKJK","json":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK.json","graph_json":"https://pith.science/api/pith-number/KMCGZRRZROIAZYAPNMMKZKMKJK/graph.json","events_json":"https://pith.science/api/pith-number/KMCGZRRZROIAZYAPNMMKZKMKJK/events.json","paper":"https://pith.science/paper/KMCGZRRZ"},"agent_actions":{"view_html":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK","download_json":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK.json","view_paper":"https://pith.science/paper/KMCGZRRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02939&json=true","fetch_graph":"https://pith.science/api/pith-number/KMCGZRRZROIAZYAPNMMKZKMKJK/graph.json","fetch_events":"https://pith.science/api/pith-number/KMCGZRRZROIAZYAPNMMKZKMKJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK/action/storage_attestation","attest_author":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK/action/author_attestation","sign_citation":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK/action/citation_signature","submit_replication":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK/action/replication_record"}},"created_at":"2026-05-18T00:42:40.519757+00:00","updated_at":"2026-05-18T00:42:40.519757+00:00"}