{"as_of":"2026-08-18T21:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb54c1ac8b83f8372e3be37a425dfd182d481620bc1281cdf042a759c108576a","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:49:19.553534Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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.20884/citation-record","integrity":"/paper/2508.20884/integrity","json":"/paper/2508.20884/citation-record.json","paper":"/paper/2508.20884"},"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-05T14:49:20.007734Z","title":"Motion planning for robotics: A review for sampling-based planners,","venue":null,"work_id":"18df737f-17c4-489f-86ca-9df3f5bd1d28","year":null},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.410133Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:cab5ecad481e959221c45f5b7ea7c0ddcb761b58ac94d0ba68a9a06f16c96376","observation_id":"9c60fa8e-d4eb-4703-a618-7038465ac8da","resolution":{"observed_at":"2026-08-05T14:49:20.013704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.415460Z","title":"A note on two problems in connexion with graphs,","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.415460Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:a3450b88911cc591fa7ee2f4ec01dc63537fb2d45452c1231d7d4b1c5e6a4054","observation_id":"e4040017-312b-4f86-b541-cdde94630737","resolution":{"observed_at":"2026-08-05T14:49:19.415460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.420733Z","title":"A formal basis for the heuristic determination of minimum cost paths,","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.420733Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:fb4975061fb88ca9c17e352bd209619da2159918db5f87ceaa3c2960da61fe1b","observation_id":"14070d59-079a-4078-a50a-8dff0a3b99fc","resolution":{"observed_at":"2026-08-05T14:49:19.420733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.972132Z","title":"Rapidly-exploring random trees: A new tool for path planning,","venue":null,"work_id":"cffef6cd-b211-4d7d-93c4-6c0fddeb0cba","year":1998},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.428897Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:59676fc5cd2dfa526c3ad30be1550a66173df4c04f11329ed4518d19afecbd7b","observation_id":"fe2ebb7c-5e4c-4af1-9e6e-6e3a4bfe99e8","resolution":{"observed_at":"2026-08-05T14:49:19.977859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.957171Z","title":"Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":"c5235eb7-fcaf-41a8-8a34-ec61b93d1818","year":1996},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.433932Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:d05b306a800e1b9384eccd5a6526a9898a6147cada68a9276eeeaecbc23c99bd","observation_id":"f7dfb63d-bc5b-4efd-bb7e-46994db79d2b","resolution":{"observed_at":"2026-08-05T14:49:19.962085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.439035Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.439035Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:7ca7b3e6c3f6bee41f33b6d3fc851b61db4b0a289e61909057e7b0e5cac130f4","observation_id":"96d55e56-6554-4ac9-8c8a-6f7a75dc9c6e","resolution":{"observed_at":"2026-08-05T14:49:19.439035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.932293Z","title":"Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,","venue":null,"work_id":"0d0cb87d-bd1d-49da-9e67-7289d67839d6","year":2014},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.443871Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:eb136790c7e28b730338cec3b2da5498e4ee22403bc680bde39642e5c57a0e2f","observation_id":"4d77729f-e8b2-4fa0-90c2-c6ddf613f952","resolution":{"observed_at":"2026-08-05T14:49:19.937203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.915680Z","title":"Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions,","venue":null,"work_id":"21a11644-2fb1-4a1b-a676-2e625378456f","year":2015},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.448919Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:28f54b8e294383ed5de4653282418c1007ce35d9ccc2179bfa27ef6647053f38","observation_id":"2521bc97-04d2-4f46-87d9-db6132e7b6b6","resolution":{"observed_at":"2026-08-05T14:49:19.921195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.898886Z","title":"Batch informed trees (BIT*): Informed asymptotically optimal anytime search,","venue":null,"work_id":"66c3b533-169d-4bca-bef0-420c0be4df01","year":2020},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.453518Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:0fdd482395c658757dea5167ae91adfdb0a3aa4f8c2e98cfddb85b9ad2b9c7de","observation_id":"f3fe30fb-901b-470f-92ec-a2fc24cdd560","resolution":{"observed_at":"2026-08-05T14:49:19.904739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.883484Z","title":"Adaptively informed trees (AIT*) and effort informed trees (EIT*): Asymmetric bidirectional sampling- based path planning,","venue":null,"work_id":"10dc0099-3581-4588-80cf-fc636dfbf3f9","year":2022},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.458729Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:19c9a88712a431a6fe5e44c7682e1356f6bf5c54136c9deeaaa94c0b552d5f8a","observation_id":"5f7a050f-0d1e-4421-8ec2-87f96b09d4e2","resolution":{"observed_at":"2026-08-05T14:49:19.888437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.462951Z","title":"Tree- based grafting approach for bidirectional motion planning with local subsets optimization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.462951Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:669500dbe8a1434a8a9e15dd35bb4e5c12f42f799aca1ae9f923f6683d0c4a73","observation_id":"c8edde43-449a-41d4-8e9a-248270c43f7f","resolution":{"observed_at":"2026-08-05T14:49:19.462951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.467311Z","title":"Genetic informed trees (GIT*): Path planning via reinforced genetic programming heuristics,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.467311Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:e782225247d7d7728ed386a53e486fbd76f09f5f021821d350b4be417c58ca99","observation_id":"b6300163-2a93-4d8d-9cc4-adfae17bdc6a","resolution":{"observed_at":"2026-08-05T14:49:19.467311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.848063Z","title":"Motion planning networks: Bridging the gap between learning-based and classical motion planners,","venue":null,"work_id":"276119b9-e853-4df2-b15f-65294a9bcbfc","year":2021},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.471982Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:79146844ecd49660ccb022d74f60e9cf208c193c8f18dc37cdcf6aff4e1d2ea6","observation_id":"023da82a-6333-43b8-a568-c5d3ec88bb0c","resolution":{"observed_at":"2026-08-05T14:49:19.853312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.833421Z","title":"Learning to plan in high dimensions via neural exploration-exploitation trees,","venue":null,"work_id":"cbd62acb-7859-43d7-81ba-f015bfa2f99d","year":null},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.476367Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:cab6c9105a34196d7b16404d49e172dc693c9dfaf78ff4dfd419c7b02ef69cdb","observation_id":"e06b2895-558f-42f7-ad69-a6aa55cb55d5","resolution":{"observed_at":"2026-08-05T14:49:19.838140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.817241Z","title":"Neural informed RRT*: Learning-based path planning with point cloud state representations under admissible ellipsoidal constraints,","venue":null,"work_id":"05d0f139-a9bd-45e5-b73c-900b54b2900d","year":2024},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.486131Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:3d7f140619d4af291f7d45be4c03477edbc22ebcedf54ab7bc63a834f6794125","observation_id":"19f1caf2-3ccf-4b9d-888f-8f0c53d246c5","resolution":{"observed_at":"2026-08-05T14:49:19.822866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.799754Z","title":"Continuous motion planning for mobile robots using fuzzy deep reinforcement learning,","venue":null,"work_id":"08d4b7b3-9dd0-4934-8911-8ec4fd15c342","year":2024},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.490630Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:91b1efaad4c941a1fa5b2afd831f7f72f3b63c898682a1f3b7fd4c67329da70e","observation_id":"093bbecd-b11a-41bf-a4de-d0937291f102","resolution":{"observed_at":"2026-08-05T14:49:19.806030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.495021Z","title":"Estimated informed anytime search for sampling-based planning via adaptive sampler,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.495021Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:7b0a32023d92a698921cd0613ff2fde89a29ff6cb65431b891bd789fd137a437","observation_id":"f202549e-0714-4b1f-bc0c-dc95d1980e09","resolution":{"observed_at":"2026-08-05T14:49:19.495021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.500008Z","title":"APT*: Asymptotically optimal motion planning via adaptively prolated elliptical r-nearest neighbors,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.500008Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:49e2317ed4581f6c5b877c7700e65b8e28c6c4fd1a97c7250bd47e52574f2a82","observation_id":"fdddab34-7c6c-4a58-8c01-7dc387092833","resolution":{"observed_at":"2026-08-05T14:49:19.500008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.764266Z","title":"Flexible informed trees (FIT*): Adaptive batch-size approach in informed sampling- based path planning,","venue":null,"work_id":"11af4831-4350-4538-90e7-0aeeb4b13daf","year":2024},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.504380Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:e812bee9f9d3a4dcd696f27ca11f4314e131daa2d4f53ad260df54159c581071","observation_id":"ebae29a7-1af4-4e9a-a05c-6506ae4d75c7","resolution":{"observed_at":"2026-08-05T14:49:19.769464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.746797Z","title":"Elliptical k-nearest neighbors: Path optimization via coulomb’s law and invalid vertices in c-space obstacles,","venue":null,"work_id":"7e34eb5f-6063-472f-bfd2-a493ec42a535","year":2024},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.509889Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:35bdceb2c090c23cc99d0e4cbc090f0e591d1738ac32af7ca0e93f9e4619e563","observation_id":"9236ba43-a249-4964-a0da-f661020ed34c","resolution":{"observed_at":"2026-08-05T14:49:19.752160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.730987Z","title":"Nearest neighbor search: the old, the new, and the impossible,","venue":null,"work_id":"4c241780-6bbc-42d3-b7dd-c6f183694897","year":2009},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.514373Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:b6ad36eaf4e2f8d0b58974f04182dfc94aa31935a628e5d096b54a720fc484bc","observation_id":"362f1e81-aec9-48a4-bc23-d0da1b37ac96","resolution":{"observed_at":"2026-08-05T14:49:19.736280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.713260Z","title":"Fuzzy machine learning: A comprehen- sive framework and systematic review,","venue":null,"work_id":"3bf55792-c0e8-4449-ba7f-19a6ee8ef772","year":2024},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.519706Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:b3faf038d22397aa0a60baf03a63f3f426c29c965fb9ef0a1b0a2c9dbaf04fe3","observation_id":"30a00827-9d27-4307-922d-dd21a04e1ce1","resolution":{"observed_at":"2026-08-05T14:49:19.719838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.524611Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.524611Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:238c027c970247a3528a7a9f4356c8c6a0be73ca9b79b4814f564de8a5561bee","observation_id":"4c305d13-06d1-4910-9aa6-cf0877fb15b8","resolution":{"observed_at":"2026-08-05T14:49:19.524611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.686505Z","title":"Planner developer tools (pdt): Reproducible experiments and statistical analysis for developing and testing motion planners,","venue":null,"work_id":"3830699c-89de-4334-8b81-02b6bb0f1e42","year":2022},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.529794Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:47ae7866fd911a921ff59d5f76d19afe027a219989ce6c98c842192142f95f02","observation_id":"91380740-eb62-4f4f-92ea-91851184a6f4","resolution":{"observed_at":"2026-08-05T14:49:19.691768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.669768Z","title":"Openrave: A planning architecture for autonomous robotics,","venue":null,"work_id":"6adb81f3-30b1-47f6-97e7-72a61e3953a5","year":2008},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.534212Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:a8721ef8e05ed51fea60764f45c8d6dcde9e34971e0d7f8d3255eb098189b36b","observation_id":"5b91eec4-f286-4798-ac3d-6bf25986d63f","resolution":{"observed_at":"2026-08-05T14:49:19.675121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.653778Z","title":"Curse of dimensionality for tsk fuzzy neural networks: Explanation and solutions,","venue":null,"work_id":"7a99f75c-6f36-47e2-868c-17b1fc206cef","year":2021},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.538927Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:148aa5c8c34c83fc515b7222aff42e8e2ccf65ee60b6f520f77729b063a36d5c","observation_id":"ee79844b-3a81-45d4-94fa-50faafe43a2b","resolution":{"observed_at":"2026-08-05T14:49:19.658974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T14:49:19.637990Z","title":"Deep fuzzy rule-based classification system with improved wang–mendel method,","venue":null,"work_id":"bc4a919c-b09f-4099-b8ef-dcf84914a567","year":2022},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.543633Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:bb7d201cb0f1e16495a6c2ea587b9826cb7342c325bd03c3dc49b8090c572fe0","observation_id":"85e66121-94a5-448e-ace5-7665870ad659","resolution":{"observed_at":"2026-08-05T14:49:19.643002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.05952","last_updated":"2016-02-25T17:55:31Z","snapshot_observed_at":"2026-08-15T17:33:32.559096Z","submitted_at":"2015-11-18T20:54:44Z","title":"Prioritized Experience Replay","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.05952","snapshot_observed_at":"2026-08-05T14:49:19.548298Z","title":"Prioritized experience replay,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.548298Z"},"links":{"cited_paper":"/paper/1511.05952","citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:fce0e4f2d360449fa40235e7e7b284730939889f2bea03964bcf8fa6b0e92aaf","observation_id":"e9ada4d7-51c3-4fd0-b7bd-3a74f9d790db","resolution":{"observed_at":"2026-08-05T14:49:19.548298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:49:19.553534Z","title":"The open motion planning library,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.553534Z"},"links":{"citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:7be195041bc9b05f93a85b9c63bdd15bb99cc12a0651b19beb3ad67a8e7c3070","observation_id":"490aac24-3fd9-4025-bb83-0aab8a55b58e","resolution":{"observed_at":"2026-08-05T14:49:19.553534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.00070","last_updated":"2020-02-23T08:49:42Z","snapshot_observed_at":"2026-08-15T21:43:03.693630Z","submitted_at":"2019-02-28T20:53:13Z","title":"Learning to Plan in High Dimensions via Neural Exploration-Exploitation Trees","version":4},"cited_work":{"arxiv_id":"1903.00070","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.00070","snapshot_observed_at":"2026-08-05T14:49:19.607588Z","title":"Learning to Plan in High Dimensions via Neural Exploration-Exploitation Trees","venue":"cs.LG","work_id":"42ab3f80-22a6-4d0e-b65f-4f8241a88b39","year":2019},"citing_paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T14:49:19.481374Z"},"links":{"cited_paper":"/paper/1903.00070","citing_paper":"/paper/2508.20884"},"observation_digest":"sha256:b8c7c4ec54f12102b237673c8998e2500a3df512e4174e446f6721969ae47a4f","observation_id":"d21ee56e-ef37-4494-91e1-b19b5241644c","resolution":{"observed_at":"2026-08-05T14:49:19.614752Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.20884","last_updated":"2025-08-28T15:14:15Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-18T13:55:51.919967Z","submitted_at":"2025-08-28T15:14:15Z","title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":30},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2508.20884."}