{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KMCGZRRZROIAZYAPNMMKZKMKJK","short_pith_number":"pith:KMCGZRRZ","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"},"canonical_sha256":"53046cc6398b900ce00f6b18aca98a4a9c9d5b4df756dd44d4458c2b81c5493e","source":{"kind":"arxiv","id":"1706.02939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02939","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02939v1","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02939","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"KMCGZRRZROIA","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KMCGZRRZROIAZYAP","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KMCGZRRZ","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KMCGZRRZROIAZYAPNMMKZKMKJK","target":"record","payload":{"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"},"canonical_sha256":"53046cc6398b900ce00f6b18aca98a4a9c9d5b4df756dd44d4458c2b81c5493e","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"},"source_kind":"arxiv","source_id":"1706.02939","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:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/gys/OO6QBDw38NPNOPBaqFpoiyC6kYzEE6tAzXVr2615ta+30+P777T85fRK1qqurVw3FfpHdzq/5IwiXXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:55:15.890409Z"},"content_sha256":"d5dbfe262110ab625e5c4d1098cd0ad9fb2dc87eb32abfb1711d70b15f56008e","schema_version":"1.0","event_id":"sha256:d5dbfe262110ab625e5c4d1098cd0ad9fb2dc87eb32abfb1711d70b15f56008e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KMCGZRRZROIAZYAPNMMKZKMKJK","target":"graph","payload":{"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"},"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:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJjrwCJkrG1k0rudyDcz1e6hXf/qj6MVg+QyTGQpVdHVxtyNSIjL4+DsufMHS4QeWqu1BVjvlOcp88pJlfrWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:55:15.890943Z"},"content_sha256":"34970a5898ff8c098d88422c7f42098a8dceba7b1e8c57f8f0d9e273e19538d5","schema_version":"1.0","event_id":"sha256:34970a5898ff8c098d88422c7f42098a8dceba7b1e8c57f8f0d9e273e19538d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK/bundle.json","state_url":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMCGZRRZROIAZYAPNMMKZKMKJK/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-05-27T21:55:15Z","links":{"resolver":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK","bundle":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK/bundle.json","state":"https://pith.science/pith/KMCGZRRZROIAZYAPNMMKZKMKJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMCGZRRZROIAZYAPNMMKZKMKJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KMCGZRRZROIAZYAPNMMKZKMKJK","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":"baee7fc259a93efde6e285e9eb45ad15214c5f0f7dbe2bab25ba4bafe061f70a","cross_cats_sorted":["cs.DS","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-09T13:11:37Z","title_canon_sha256":"6df47781f886def02a1864413a57c0dcd6c0b8c779d0e61a530c357ebdb4d90e"},"schema_version":"1.0","source":{"id":"1706.02939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02939","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02939v1","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02939","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"KMCGZRRZROIA","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KMCGZRRZROIAZYAP","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KMCGZRRZ","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:34970a5898ff8c098d88422c7f42098a8dceba7b1e8c57f8f0d9e273e19538d5","target":"graph","created_at":"2026-05-18T00:42:40Z","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":"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","authors_text":"Kyle Fox, Oren Salzman, Pankaj K. Agarwal","cross_cats":["cs.DS","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-09T13:11:37Z","title":"An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02939","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:d5dbfe262110ab625e5c4d1098cd0ad9fb2dc87eb32abfb1711d70b15f56008e","target":"record","created_at":"2026-05-18T00:42:40Z","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":"baee7fc259a93efde6e285e9eb45ad15214c5f0f7dbe2bab25ba4bafe061f70a","cross_cats_sorted":["cs.DS","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-09T13:11:37Z","title_canon_sha256":"6df47781f886def02a1864413a57c0dcd6c0b8c779d0e61a530c357ebdb4d90e"},"schema_version":"1.0","source":{"id":"1706.02939","kind":"arxiv","version":1}},"canonical_sha256":"53046cc6398b900ce00f6b18aca98a4a9c9d5b4df756dd44d4458c2b81c5493e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53046cc6398b900ce00f6b18aca98a4a9c9d5b4df756dd44d4458c2b81c5493e","first_computed_at":"2026-05-18T00:42:40.519666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:40.519666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t9Cwu5hoyUHw8uTLe+iZkLUGYdj0QzxsLJcRWUeWKLw8lzuU4+1fQd76kyNfFY9Y3lA0yF7URz10XQYKa2E5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:40.520343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5dbfe262110ab625e5c4d1098cd0ad9fb2dc87eb32abfb1711d70b15f56008e","sha256:34970a5898ff8c098d88422c7f42098a8dceba7b1e8c57f8f0d9e273e19538d5"],"state_sha256":"56c1ce8d6b65d6243efaf3474b8fa2faa7d3c6ffef3a8900d324390cb3fe782a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SqfD0Jml84u7dMdchydt9/UTxKkJEO57TihEm4HD5aIsdZTgxWK1XOAl3SaKY8DfeufNPXb3EjYvOUIeKcIJAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:55:15.893681Z","bundle_sha256":"d5dc9d07213512bb00457aa5c788268412fc18fe715d6b2f5a45ceebdb70512e"}}