{"as_of":"2026-08-06T11:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e52a54333c6569e4582020ff06b7bc1405ce8f823a525f5b25810018ab69242","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T15:34:21.345260Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2508.19771/citation-record","integrity":"/paper/2508.19771/integrity","json":"/paper/2508.19771/citation-record.json","paper":"/paper/2508.19771"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.654519Z","title":"Sampling- based path planning in highly dynamic and crowded pedestrian flow,","venue":null,"work_id":"d169a3de-1112-4fe3-9264-06535e888bb8","year":2023},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:20.848806Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:d3d42973188bc35a57be4123749dee9e09644a1ca3756a4ba3e8c29c7778ab9f","observation_id":"10d9187c-eedb-4fc7-b017-5d0bef19869a","resolution":{"observed_at":"2026-08-05T15:34:21.657767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.645047Z","title":"Penrose, Random geometric graphs","venue":null,"work_id":"edf7bd22-b3fe-48db-9eb9-8b71ff88e00b","year":2003},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:20.951416Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:ca6f38b27311e61b2d0b230e366f9a8771d4ee26249c0e85ade6a3a48953f5c5","observation_id":"cb16229f-888f-4200-8392-f10707384b64","resolution":{"observed_at":"2026-08-05T15:34:21.648084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.634603Z","title":"A formal basis for the heuristic determination of minimum cost paths,","venue":null,"work_id":"27462fa4-abe6-457b-a635-2139b59dd485","year":1968},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.083040Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:262250742893049ef322142a84681e2ca1dfe8e6aa4f1f7b70254c8263ec231b","observation_id":"1e870688-cdec-499d-b962-b9e970d57cf5","resolution":{"observed_at":"2026-08-05T15:34:21.638040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.624802Z","title":"Lifelong planning a*,","venue":null,"work_id":"118c9af9-8c34-42cd-afd3-5cdf67a22ee0","year":2004},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.192828Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:c56518500901c78ebee9430988d8826a74ad91602099704e5c358edb9037c6dc","observation_id":"88c756a4-bc3d-4229-baa3-a6c4e2ebe7f7","resolution":{"observed_at":"2026-08-05T15:34:21.627932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.615145Z","title":"Randomized kinodynamic plan- ning,","venue":null,"work_id":"b04547f3-9c5c-4543-9585-c21f2a222f62","year":2001},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.251553Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:07c612933b11bae508eb326f9e5293c2a0012282ecaab148037946877869b788","observation_id":"9175d245-752d-4f87-8ae7-2512d0302a10","resolution":{"observed_at":"2026-08-05T15:34:21.618233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.604915Z","title":"Rrt-connect: An efficient approach to single-query path planning,","venue":null,"work_id":"10456470-4c0f-4608-9281-ffcae0d79e5c","year":2000},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.258161Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:a659cd962a961bccd5445b7b9cc9151496f82a5b7039220bfd760fea6b03067b","observation_id":"ff343dff-817e-4920-801a-af22e0d8d80e","resolution":{"observed_at":"2026-08-05T15:34:21.608502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.594432Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":"2f5f1222-9cd8-46c5-b45c-6e464386aeb8","year":2011},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.270049Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:c26c8c3ea4304c064c847aa02a876fc36cb048c5876844f9087da1c1db96d9d8","observation_id":"131a3cf7-3c18-4968-89f4-2d190436efec","resolution":{"observed_at":"2026-08-05T15:34:21.597978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.585063Z","title":"Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions,","venue":null,"work_id":"60849076-fb7c-44ee-a702-d7d54d7607ae","year":2015},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.273489Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:f86d3d01b1001c900cc74620e37839f7e616b1c7091dc4e230da789fe49b74bf","observation_id":"3bdfd4cb-d36d-4f2d-a9c9-a76487828a25","resolution":{"observed_at":"2026-08-05T15:34:21.588279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.575569Z","title":"Informed rrt*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,","venue":null,"work_id":"3f6584e7-abd7-48c2-a35a-5c7daabf6694","year":2014},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.276560Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:0f8da220f6622583d29f56e2ae7532d899bcf310934efd207bd9de5b68f0aadf","observation_id":"73c3d1ca-d9c2-4883-8cf1-552c32732ae2","resolution":{"observed_at":"2026-08-05T15:34:21.578748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.565729Z","title":"Informed sampling for asymptotically optimal path planning,","venue":null,"work_id":"172f465c-ad58-4b60-a9de-b654037653dd","year":2018},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.280139Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:5dcf6207fdcaa23e9576cf03c9c264e49ef63ccc3f0a174a3f581d5d34aa7d63","observation_id":"ae6ae0db-0a67-44df-a23b-cda573729c3b","resolution":{"observed_at":"2026-08-05T15:34:21.568903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.556172Z","title":"Batch informed trees (bit*): Informed asymptotically optimal anytime search,","venue":null,"work_id":"9896f181-3851-4abd-ae65-e0afb8350d1a","year":2020},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.283859Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:607228487bd3f4ed7ac00c7ebbb09c56c6e007b82aec8a6b55f86ce54b85f105","observation_id":"53ea0f32-e4d5-4783-b2f2-bcfaffdfe792","resolution":{"observed_at":"2026-08-05T15:34:21.559384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.545873Z","title":"Advanced bit (abit): Sampling- based planning with advanced graph-search techniques,","venue":null,"work_id":"bf3ef406-9e65-4e8c-b15e-296eebe92348","year":2020},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.287822Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:20c0a2c5f264f017364e5d0388e8cb2484040ab0e5b958b9d1e6a0b8b1381ec6","observation_id":"15b9e4cd-df3b-4f1f-9a80-672aed52395e","resolution":{"observed_at":"2026-08-05T15:34:21.549327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.535827Z","title":"Adaptively informed trees (ait*) and effort informed trees (eit*): Asymmetric bidirectional sampling- based path planning,","venue":null,"work_id":"e16bf1ba-003a-4e25-aff9-dd8be1287055","year":2022},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.290872Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:046026cec727cdfecc8bc91e98396d00680b8ca73538cd47af64ac1ee017a32d","observation_id":"65f2a34a-3453-4782-839d-2659e6edde13","resolution":{"observed_at":"2026-08-05T15:34:21.539118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.525664Z","title":"Adaptively informed trees (ait*): Fast asymptotically optimal path planning through adaptive heuristics,","venue":null,"work_id":"cef2254e-de98-4cbd-a65a-6953adbb5a86","year":2020},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.294515Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:dad8b1603d3176ab35d5b798b9ff1281b95c94a3844bb1a7078e915f135f2742","observation_id":"dd3d3228-04b7-4bcf-9708-07b8701a78e0","resolution":{"observed_at":"2026-08-05T15:34:21.529447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.515553Z","title":"Tree- based grafting approach for bidirectional motion planning with local subsets optimization,","venue":null,"work_id":"6a6f9081-ab79-4d06-93a7-16b19749eb96","year":2025},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.297854Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:a55316a8b64176b317ee2a62106e7d6e1d37aa399ee9869f9f3b727a13649b53","observation_id":"f0cabebd-81ec-4ac5-bcfd-c24cb3f77e20","resolution":{"observed_at":"2026-08-05T15:34:21.519060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.505535Z","title":"Collision detection or nearest-neighbor search? on the computational bottleneck in sampling- based motion planning,","venue":null,"work_id":"a1a39b31-b80e-48a2-8bf6-0a37c1d8d625","year":2020},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.300962Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:599bff91a0070fa647fe8d76d7f6ba557d89187038629a8cfaec7ada67417f19","observation_id":"2a8f7d54-6d9c-484b-a30c-cc001568e311","resolution":{"observed_at":"2026-08-05T15:34:21.508986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.494661Z","title":"The number of neighbors needed for con- nectivity of wireless networks,","venue":null,"work_id":"0fd0ca41-726f-42e0-adc8-17010700e3a1","year":2004},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.304304Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:319b7b2f87afaf4ff53ab258ad1372a9420ec26b29543363487a09b6ec05ea88","observation_id":"c80a3ceb-2a7d-47d3-b966-69d5ad55c4c0","resolution":{"observed_at":"2026-08-05T15:34:21.498733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.484774Z","title":"Random plane networks,","venue":null,"work_id":"ea05cd9c-356e-4fd8-8468-4b9e47c13f0d","year":1961},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.307911Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:1786bd4e00eca95e1154be1b8aca9f486e11ffd6784a262782cca9e1f0cfe998","observation_id":"a94ced4d-5423-4f42-aa49-37ab1dac7130","resolution":{"observed_at":"2026-08-05T15:34:21.487760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.474502Z","title":"The critical radius in sampling-based motion planning,","venue":null,"work_id":"c4cc0c9b-e940-4299-9132-7418c5e8798b","year":2020},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.311044Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:7b429c23ae7a433500d9b03c11703ef4a0c3ab3798e952ee6f9d59c46e5f3fc6","observation_id":"bdb8cbb4-35d6-4542-ae82-c400e0c4fc32","resolution":{"observed_at":"2026-08-05T15:34:21.477913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.464244Z","title":"Nearest neighbor search: the old, the new, and the impossible,","venue":null,"work_id":"03083518-bd66-4337-a3e1-971511064287","year":null},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.314224Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:6434bd385108b76570b7a3a36c87332bb17443eb00642f7cd2556fc42c484969","observation_id":"983d2c9e-8d30-42de-a4c3-68a710ca1984","resolution":{"observed_at":"2026-08-05T15:34:21.467752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.453694Z","title":"Exact statistical mechanics of a one-dimensional system with coulomb forces,","venue":null,"work_id":"4eecb349-eef4-4ecd-9884-2c26484f4b98","year":1961},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.317759Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:8ef32212bd9cd02dffbaf7946d8f06003b488a7c0ad4a35be2b83010fce72f12","observation_id":"1a3fa383-6ace-4417-8157-23af42f6bcc2","resolution":{"observed_at":"2026-08-05T15:34:21.457057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.443418Z","title":"The open motion planning library,","venue":null,"work_id":"d1749762-36ba-4f64-a92d-f676c0d9f77c","year":2012},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.322126Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:457f46089a65c7f2b8a70e5a52f806dadf9a0611bb8c5dff0460d000fabe2567","observation_id":"18890b4b-85c7-4200-a42d-18540a087085","resolution":{"observed_at":"2026-08-05T15:34:21.447026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.433273Z","title":"Benchmarking motion planning algorithms: An extensible infrastructure for analysis and visualization,","venue":null,"work_id":"b4d0ef52-407c-4d37-b1d8-05588b41a51d","year":2015},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.325471Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:ea38959de7e8131d7fd7797ec428c872961833e3f624e0913ce9220609834391","observation_id":"adf9c55c-4443-4994-9300-2ca14ee450c4","resolution":{"observed_at":"2026-08-05T15:34:21.436841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.421701Z","title":"Planner developer tools (pdt): Reproducible experiments and statistical analysis for de- veloping and testing motion planners,","venue":null,"work_id":"0e757a39-e9f1-4f31-a967-1816381f98c2","year":null},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.328586Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:2db492122bcf847b704e3ba4d7c90614a09d260a2b835f23a5389e425a25e4cc","observation_id":"6a297002-de74-4a8d-8523-e40b76113bc1","resolution":{"observed_at":"2026-08-05T15:34:21.425511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.409826Z","title":"A predictive prescription using minimum volume k- nearest neighbor enclosing ellipsoid and robust optimization,","venue":null,"work_id":"b46bbf79-0d30-4e96-afb0-e3c1ce26fd6f","year":2021},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.332819Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:822c42e0e22ff09c6ad780eb01ac405815b8a53d064218f4c6c626ce9d1dbdc2","observation_id":"38a68366-8376-48cb-9e50-9fd3f2988def","resolution":{"observed_at":"2026-08-05T15:34:21.413704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.398686Z","title":"Lateral flexion of a compliant spine improves motor performance in a bioinspired mouse robot,","venue":null,"work_id":"69dce489-861f-4782-815c-a31831df1b22","year":2023},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.336733Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:ef6d23dbdbd0debee1ca67f77af144c07cf43a144958015dcd4a8d3f5bb1165e","observation_id":"458922ec-65d7-434e-84c3-8b474460121b","resolution":{"observed_at":"2026-08-05T15:34:21.402104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.386734Z","title":"Human- aware path planning with improved virtual doppler method in highly dynamic environments,","venue":null,"work_id":"2e729daa-497f-4aad-86d0-2175c371130b","year":2022},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.341883Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:d8f62147a937703c49952dc84d9a20eb5096c8d550358c5ad66aa90e35f30ec0","observation_id":"589485d7-56ff-4983-8d23-f2fbb20943f2","resolution":{"observed_at":"2026-08-05T15:34:21.390955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:21.373015Z","title":"Estimated informed anytime search for sampling-based planning via adaptive sampler,","venue":null,"work_id":"5c7788f7-a781-4512-997f-cc024485702b","year":2025},"citing_paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:21.345260Z"},"links":{"citing_paper":"/paper/2508.19771"},"observation_digest":"sha256:488b043e6e3ba16a2e6d82fe038df74bc6d7fdb4c2d3a22c2462c9e9d35015d4","observation_id":"04aefe43-aa98-41f9-8f03-0677c97a9997","resolution":{"observed_at":"2026-08-05T15:34:21.378600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.19771","last_updated":"2025-08-27T10:57:50Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-05T15:34:18.139396Z","submitted_at":"2025-08-27T10:57:50Z","title":"Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":28},"total_outbound_references":28},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"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."}