{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5V4RCDLAWZR4B3FOMJLVT6S3OA","short_pith_number":"pith:5V4RCDLA","schema_version":"1.0","canonical_sha256":"ed79110d60b663c0ecae625759fa5b703ff7bf747ecd69d286940e4cec00a647","source":{"kind":"arxiv","id":"1011.6481","version":1},"attestation_state":"computed","paper":{"title":"A near optimal algorithm for finding Euclidean shortest path in polygonal domain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari","submitted_at":"2010-11-30T08:42:45Z","abstract_excerpt":"We present an algorithm to find an {\\it Euclidean Shortest Path} from a source vertex $s$ to a sink vertex $t$ in the presence of obstacles in $\\Re^2$. Our algorithm takes $O(T+m(\\lg{m})(\\lg{n}))$ time and $O(n)$ space. Here, $O(T)$ is the time to triangulate the polygonal region, $m$ is the number of obstacles, and $n$ is the number of vertices. This bound is close to the known lower bound of $O(n+m\\lg{m})$ time and $O(n)$ space. Our approach involve progressing shortest path wavefront as in continuous Dijkstra-type method, and confining its expansion to regions of interest."},"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":"1011.6481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-30T08:42:45Z","cross_cats_sorted":[],"title_canon_sha256":"8d803c71d6ee8418f5d85b1c21d7d0d2df037cc90d681771fc08ee7e1693b4e7","abstract_canon_sha256":"6daa003a8b5ac87975f9915175345920f2e2f8be4f3ecd2cc218165dbe493545"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:26.831098Z","signature_b64":"EM2l/n334hA8e0rZbq34TQfuKbJVO3RghdU4kiK/6NT75lWY1z/eSRuHrZVn8BUsE6CHO7iaJ0pNyAphiaRxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed79110d60b663c0ecae625759fa5b703ff7bf747ecd69d286940e4cec00a647","last_reissued_at":"2026-05-18T04:34:26.830511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:26.830511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A near optimal algorithm for finding Euclidean shortest path in polygonal domain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari","submitted_at":"2010-11-30T08:42:45Z","abstract_excerpt":"We present an algorithm to find an {\\it Euclidean Shortest Path} from a source vertex $s$ to a sink vertex $t$ in the presence of obstacles in $\\Re^2$. Our algorithm takes $O(T+m(\\lg{m})(\\lg{n}))$ time and $O(n)$ space. Here, $O(T)$ is the time to triangulate the polygonal region, $m$ is the number of obstacles, and $n$ is the number of vertices. This bound is close to the known lower bound of $O(n+m\\lg{m})$ time and $O(n)$ space. Our approach involve progressing shortest path wavefront as in continuous Dijkstra-type method, and confining its expansion to regions of interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6481","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":"1011.6481","created_at":"2026-05-18T04:34:26.830595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.6481v1","created_at":"2026-05-18T04:34:26.830595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6481","created_at":"2026-05-18T04:34:26.830595+00:00"},{"alias_kind":"pith_short_12","alias_value":"5V4RCDLAWZR4","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5V4RCDLAWZR4B3FO","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5V4RCDLA","created_at":"2026-05-18T12:26:04.259169+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/5V4RCDLAWZR4B3FOMJLVT6S3OA","json":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA.json","graph_json":"https://pith.science/api/pith-number/5V4RCDLAWZR4B3FOMJLVT6S3OA/graph.json","events_json":"https://pith.science/api/pith-number/5V4RCDLAWZR4B3FOMJLVT6S3OA/events.json","paper":"https://pith.science/paper/5V4RCDLA"},"agent_actions":{"view_html":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA","download_json":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA.json","view_paper":"https://pith.science/paper/5V4RCDLA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.6481&json=true","fetch_graph":"https://pith.science/api/pith-number/5V4RCDLAWZR4B3FOMJLVT6S3OA/graph.json","fetch_events":"https://pith.science/api/pith-number/5V4RCDLAWZR4B3FOMJLVT6S3OA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA/action/storage_attestation","attest_author":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA/action/author_attestation","sign_citation":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA/action/citation_signature","submit_replication":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA/action/replication_record"}},"created_at":"2026-05-18T04:34:26.830595+00:00","updated_at":"2026-05-18T04:34:26.830595+00:00"}