{"as_of":"2026-08-13T14:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:958d8ef84a4a8199284cbbf76b416312c0f810ccc3e08a21746789959c125d05","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-13T06:32:02.005865+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-09T16:23:30.857921Z","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:83b80acbcd51a29febbe1fe5d59bf5c4642e42a0f8dfadd5d3d7d3e136a2a0aa","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:78e287e18ff1688ba7297db46da6eb35f9cc61266105f56169e97debfc29beac","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-09T16:23:30.857921Z","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:0aab35e55fa39aba64bc89d51865806dac7fa0477b2b0365d801f1b6d3402b42","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-09T16:23:30.857921Z","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:aa8fc1915671c2748060c666b3a097f72afdf84c0e30c70bde59afbaff519b79","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:22a4a256a996f7bfa35ebbf27d783cae6e17dab56dd9a0e6a17935e69f3c5dee","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:57de4d5f9495c1fd8ff638a927b46007f669d7e2c9a912131d0e2851d7bbe494","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-09T16:23:30.857921Z","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:25420eae93dec59b1bc2822b00f191ee6ea934b7cdd7806b6f2766ddb7b4629a","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:3dbf9973e5de2a195da676a7bb5099ffd35392fd5657372a5199b195de249dd1","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:4a96e0ba742a72987b27c400f8b2bf087a508410c84800e4d3ef3db14348cb13","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:7fed86a08dc098fc9f7d94a532794f8e71bd3688c8ca872c589a0906e16e2e6a","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:713bbb8b331966ec70d84408a76404e64079575028e48ee87a11b6ee4b154920","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-09T16:23:30.857921Z","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:bb4d63aba17e33bb36409f3185542ea2dcd45e082a675de76c5305656a5d7865","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-09T16:23:30.857921Z","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:cd1d2af32dfc0fef7b0b15884c1bde0cef30cb381e07944f807ad6db4ffb3142","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:e70983939b1c6b93e54f95ada148b47793b78a65953cc9aa38c6abf9839c6fc7","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:ab24ad587c6385197851928d7297d9825ddb86ea04db0211d6765a080bb108da","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:5d31ef8b705e6dc120f87fa4867577192c2f14625b16e97b0338f6fa7555dc19","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:332029379555919bcc454535610ceadd51646cd53eedae727f0453972c79a5a7","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-09T16:23:30.857921Z","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:8fe682635f0285534c541fed6348b3b7e15808f43bc2f1dc8d18aeb5e8f55a33","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-09T16:23:30.857921Z","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:338a00a8de7ebe147abad5f8c60666d8ecbe42be77728bb9d404d78ab615d025","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:b62569c4ffc3554f863d68a53ea65b21a5eebe7ecbf0c15467416ca5c8d2b408","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:bb610749b2e4d3e7fb20cd227f371c739ef6d2910bd4d7f389ca038e632aaccb","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:9605503d0e6d7e2a5f58c16743fbba6a0a3ab208da2c898bac8c44681c5bf7c5","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:e42c2c132a87d0c9b22293652fe43fabff554706719fcaf3385b89302a23fbf6","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-09T16:23:30.857921Z","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:5f27e088a4f823cf90b6f8e4b5fdf39bf9fe2910a06fc510494882b04038c5ae","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:4a839fafe524438cd048978ee9f3c9deafac0bb47330a44692c56622aae4f3b9","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:205d358c7fd61a31c0906b66e5fb09fef8ff98f8506e000cbf95e429890d01ad","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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:13abad5e631026269596acd5899e618c33a5dd51b297869095ec55ec3e09fbfc","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T23:53:55.764215Z","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-09T16:23:30.857921Z","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:fd9a82678feb5efc76f7fbb037bc9672939598d99a32c9588e4ada8a1a3f8014","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-09T16:23:30.857921Z","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:4c73ef8ec58c0c8f7076af3f10b75264ca05385cb9991c3192db047712a6d792","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-07-06T07:36:16.247146Z","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-09T16:23:30.857921Z","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:d0abffd5eb73157e530c68e07501fa82a7ade8bd19686abd8d71697159354df1","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:23:30.857921Z","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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2508.20884."}