{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5V4RCDLAWZR4B3FOMJLVT6S3OA","short_pith_number":"pith:5V4RCDLA","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"},"canonical_sha256":"ed79110d60b663c0ecae625759fa5b703ff7bf747ecd69d286940e4cec00a647","source":{"kind":"arxiv","id":"1011.6481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6481","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6481v1","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6481","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"5V4RCDLAWZR4","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5V4RCDLAWZR4B3FO","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5V4RCDLA","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5V4RCDLAWZR4B3FOMJLVT6S3OA","target":"record","payload":{"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"},"canonical_sha256":"ed79110d60b663c0ecae625759fa5b703ff7bf747ecd69d286940e4cec00a647","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"},"source_kind":"arxiv","source_id":"1011.6481","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-18T04:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X41V5ynfKdN/ogNv9pGzl/ykk3wMPokAHBsQsrzLNy5b4yWhQjMtShGS0ETp+IJuNeZvrdU0/EagR+D7FBpMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:28:17.611631Z"},"content_sha256":"b3ac27f0cb3da7edc4d5960ac469dd769b065612923865fd270300991ba0f40c","schema_version":"1.0","event_id":"sha256:b3ac27f0cb3da7edc4d5960ac469dd769b065612923865fd270300991ba0f40c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5V4RCDLAWZR4B3FOMJLVT6S3OA","target":"graph","payload":{"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"},"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-18T04:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ULjiATv7IMyJPnO9fWt1qiHuplSZqFdjh0chCtq8cS/hUS9Q5WHGxarMGpqQIUGFCyW+yRQq2/mMDmiogSOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:28:17.612358Z"},"content_sha256":"891c8cbeeedc241b17289d525db5a9fe29c8de92c2f067f0e21225767a0522af","schema_version":"1.0","event_id":"sha256:891c8cbeeedc241b17289d525db5a9fe29c8de92c2f067f0e21225767a0522af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA/bundle.json","state_url":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA/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-28T18:28:17Z","links":{"resolver":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA","bundle":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA/bundle.json","state":"https://pith.science/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5V4RCDLAWZR4B3FOMJLVT6S3OA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5V4RCDLAWZR4B3FOMJLVT6S3OA","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":"6daa003a8b5ac87975f9915175345920f2e2f8be4f3ecd2cc218165dbe493545","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-30T08:42:45Z","title_canon_sha256":"8d803c71d6ee8418f5d85b1c21d7d0d2df037cc90d681771fc08ee7e1693b4e7"},"schema_version":"1.0","source":{"id":"1011.6481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6481","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6481v1","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6481","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"5V4RCDLAWZR4","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5V4RCDLAWZR4B3FO","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5V4RCDLA","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:891c8cbeeedc241b17289d525db5a9fe29c8de92c2f067f0e21225767a0522af","target":"graph","created_at":"2026-05-18T04:34:26Z","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 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.","authors_text":"Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-30T08:42:45Z","title":"A near optimal algorithm for finding Euclidean shortest path in polygonal domain"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6481","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:b3ac27f0cb3da7edc4d5960ac469dd769b065612923865fd270300991ba0f40c","target":"record","created_at":"2026-05-18T04:34:26Z","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":"6daa003a8b5ac87975f9915175345920f2e2f8be4f3ecd2cc218165dbe493545","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-30T08:42:45Z","title_canon_sha256":"8d803c71d6ee8418f5d85b1c21d7d0d2df037cc90d681771fc08ee7e1693b4e7"},"schema_version":"1.0","source":{"id":"1011.6481","kind":"arxiv","version":1}},"canonical_sha256":"ed79110d60b663c0ecae625759fa5b703ff7bf747ecd69d286940e4cec00a647","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed79110d60b663c0ecae625759fa5b703ff7bf747ecd69d286940e4cec00a647","first_computed_at":"2026-05-18T04:34:26.830511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:26.830511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EM2l/n334hA8e0rZbq34TQfuKbJVO3RghdU4kiK/6NT75lWY1z/eSRuHrZVn8BUsE6CHO7iaJ0pNyAphiaRxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:26.831098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.6481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3ac27f0cb3da7edc4d5960ac469dd769b065612923865fd270300991ba0f40c","sha256:891c8cbeeedc241b17289d525db5a9fe29c8de92c2f067f0e21225767a0522af"],"state_sha256":"697e5e3b9f2ba1bb9e5592bfe99f2894c68d1a8ae95ca253c012e2a31c40b27b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MskLuwvDc0AYVkiZWcf7ojw4X2bCukrDbOjIbGsVenEVvy8CMoa+FUGjjFb0FfUq5ADDMkG0Rn3KKQItIhA4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:28:17.615172Z","bundle_sha256":"c108a7fc1735a460fe2335bb5adacc89c3297c071aa7308199ba63ebba10484b"}}