Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-05T15:34:21.345260Z
Paper Citation Record · LEDGER
As of 6 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2508.19771.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-05T15:34:21.345260Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-06T06:34:29.942622+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
28 of 28 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 10d9187c-eedb-4fc7-b017-5d0bef19869a · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Sampling- based path planning in highly dynamic and crowded pedestrian flow,
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation cb16229f-888f-4200-8392-f10707384b64 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Penrose, Random geometric graphs
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 1e870688-cdec-499d-b962-b9e970d57cf5 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles A formal basis for the heuristic determination of minimum cost paths,
Reference 3
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 88c756a4-bc3d-4229-baa3-a6c4e2ebe7f7 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Lifelong planning a*,
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 9175d245-752d-4f87-8ae7-2512d0302a10 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Randomized kinodynamic plan- ning,
Reference 5
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation ff343dff-817e-4920-801a-af22e0d8d80e · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Rrt-connect: An efficient approach to single-query path planning,
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 131a3cf7-3c18-4968-89f4-2d190436efec · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Sampling-based algorithms for optimal motion planning,
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 3bdfd4cb-d36d-4f2d-a9c9-a76487828a25 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions,
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 73c3d1ca-d9c2-4883-8cf1-552c32732ae2 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Informed rrt*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation ae6ae0db-0a67-44df-a23b-cda573729c3b · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Informed sampling for asymptotically optimal path planning,
Reference 10
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 53ea0f32-e4d5-4783-b2f2-bcfaffdfe792 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Batch informed trees (bit*): Informed asymptotically optimal anytime search,
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 15b9e4cd-df3b-4f1f-9a80-672aed52395e · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Advanced bit (abit): Sampling- based planning with advanced graph-search techniques,
Reference 12
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 65f2a34a-3453-4782-839d-2659e6edde13 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Adaptively informed trees (ait*) and effort informed trees (eit*): Asymmetric bidirectional sampling- based path planning,
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation dd3d3228-04b7-4bcf-9708-07b8701a78e0 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Adaptively informed trees (ait*): Fast asymptotically optimal path planning through adaptive heuristics,
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation f0cabebd-81ec-4ac5-bcfd-c24cb3f77e20 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Tree- based grafting approach for bidirectional motion planning with local subsets optimization,
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 2a8f7d54-6d9c-484b-a30c-cc001568e311 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Collision detection or nearest-neighbor search? on the computational bottleneck in sampling- based motion planning,
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation c80a3ceb-2a7d-47d3-b966-69d5ad55c4c0 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles The number of neighbors needed for con- nectivity of wireless networks,
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation a94ced4d-5423-4f42-aa49-37ab1dac7130 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Random plane networks,
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation bdb8cbb4-35d6-4542-ae82-c400e0c4fc32 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles The critical radius in sampling-based motion planning,
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 983d2c9e-8d30-42de-a4c3-68a710ca1984 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Nearest neighbor search: the old, the new, and the impossible,
Reference 20
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 1a3fa383-6ace-4417-8157-23af42f6bcc2 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Exact statistical mechanics of a one-dimensional system with coulomb forces,
Reference 21
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 18890b4b-85c7-4200-a42d-18540a087085 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles The open motion planning library,
Reference 22
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation adf9c55c-4443-4994-9300-2ca14ee450c4 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Benchmarking motion planning algorithms: An extensible infrastructure for analysis and visualization,
Reference 23
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 6a297002-de74-4a8d-8523-e40b76113bc1 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Planner developer tools (pdt): Reproducible experiments and statistical analysis for de- veloping and testing motion planners,
Reference 24
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 38a68366-8376-48cb-9e50-9fd3f2988def · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles A predictive prescription using minimum volume k- nearest neighbor enclosing ellipsoid and robust optimization,
Reference 25
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 458922ec-65d7-434e-84c3-8b474460121b · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Lateral flexion of a compliant spine improves motor performance in a bioinspired mouse robot,
Reference 26
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 589485d7-56ff-4983-8d23-f2fbb20943f2 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Human- aware path planning with improved virtual doppler method in highly dynamic environments,
Reference 27
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
Observation 04aefe43-aa98-41f9-8f03-0677c97a9997 · outbound
Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles Estimated informed anytime search for sampling-based planning via adaptive sampler,
Reference 28
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.
No inbound Pith citation observations are available.