{"as_of":"2026-08-06T01:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd0b7559868927d710dccbd88dbea9f9bc48ec55c1289a140b4e79e3310fb933","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T15:34:58.824039Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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.19790/citation-record","integrity":"/paper/2508.19790/integrity","json":"/paper/2508.19790/citation-record.json","paper":"/paper/2508.19790"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:34:58.703377Z","title":"Asymptotically optimal sampling-based motion planning methods,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.703377Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:59fbef63dbe35f2585d2faa1eedc2ea9c129c9acaf7e72b1b67df5477715546d","observation_id":"0009f7e8-cf87-4a55-ba38-052d8fc9fa30","resolution":{"observed_at":"2026-08-05T15:34:58.703377Z","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-05T15:34:59.111263Z","title":"Sampling-based motion planning: A comparative review,","venue":null,"work_id":"525103ec-9256-4822-95a8-17624781bc1c","year":2024},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.708700Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:428e5580aebbd942a7ee338050e8de9b6c29034cc796efe9e3579647d589127f","observation_id":"daac0301-b1db-4aa3-b093-3a82c7c1a5bd","resolution":{"observed_at":"2026-08-05T15:34:59.115577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:34:58.713247Z","title":"Motion planning for robotics: A review for sampling- based planners,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.713247Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:2b4157c1bf5f125fdad4efd3f332f8d1eaa0a8d597a93500a7c7eef01e4a4dae","observation_id":"250d0617-012c-41da-b11b-2d553facff2e","resolution":{"observed_at":"2026-08-05T15:34:58.713247Z","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-05T15:34:58.717902Z","title":"Penrose, Random geometric graphs","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.717902Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:d3a34ec5390b5f199cb17b08789c78b9e26fa98ed137a1b35d41fc1f4b15cb9b","observation_id":"c4f903af-c2aa-439c-b312-81feadcf36ce","resolution":{"observed_at":"2026-08-05T15:34:58.717902Z","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-05T15:34:58.723103Z","title":"Estimated informed anytime search for sampling-based planning via adaptive sampler,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.723103Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:93ed2ce374f350e722fe6a7dad0837e51e4740b0f12eee82f89fbe97861d19ad","observation_id":"49ff1d4c-f971-476b-ba0e-08a9624bb357","resolution":{"observed_at":"2026-08-05T15:34:58.723103Z","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-05T15:34:58.728149Z","title":"A note on two problems in connexion with graphs,","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.728149Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:91d1c33e7bf9e41a56deb2311e24b80c659c20ff5aa09e616b06113788f1395e","observation_id":"d6033285-161f-4771-b9ca-969ea35f264c","resolution":{"observed_at":"2026-08-05T15:34:58.728149Z","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-05T15:34:58.733978Z","title":"A formal basis for the heuristic determination of minimum cost paths,","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.733978Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:fd7a3b7b3c987d0d8d7e860a66da87d2bdbf4b002133ab4900b479fabff3af3c","observation_id":"1862f9f3-a72a-4a57-8253-b5ab95ba0541","resolution":{"observed_at":"2026-08-05T15:34:58.733978Z","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-05T15:34:58.739156Z","title":"Rapidly-exploring random trees: A new tool for path planning,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.739156Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:fac21ba4f981703754ad35fef43dc866fd79ba878b65a0df6057c94ceca8637b","observation_id":"7a03823a-9d82-475d-aa4c-a6a1e20d6f12","resolution":{"observed_at":"2026-08-05T15:34:58.739156Z","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-05T15:34:58.743573Z","title":"Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.743573Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:473d4fc4cf2e89f300d3ad28de1634735142a6014419844d92a7dcd44b0ca0d0","observation_id":"a4e4dace-d7c5-44c6-8b74-fdc28ceed466","resolution":{"observed_at":"2026-08-05T15:34:58.743573Z","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-05T15:34:59.027987Z","title":"RRT-connect: An efficient approach to single-query path planning,","venue":null,"work_id":"3256e046-46d9-4228-9c4b-fd7c0e0bfa0b","year":2000},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.748998Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:96f9a974e15a4afe2036bd9739c852d34a3e3d7edebfa184aa642e592dbad320","observation_id":"c8c7a746-735b-4b39-a1b1-796530a59d4a","resolution":{"observed_at":"2026-08-05T15:34:59.033210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:34:58.753306Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.753306Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:ba8b2ca49b5dec8b95d48697d6dbe67a9fe9a0d7bc6788d491f21a914518ba5a","observation_id":"7ef2307c-b6bf-44c0-b9cd-d0d6849630a8","resolution":{"observed_at":"2026-08-05T15:34:58.753306Z","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-05T15:34:58.758107Z","title":"Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.758107Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:38ed321870f60c0df733bb2571d5d0adec8de39777c5fb5cfba84a6134d3c5b6","observation_id":"8a5fae4b-0fed-4025-b2ff-557846c7dd91","resolution":{"observed_at":"2026-08-05T15:34:58.758107Z","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-05T15:34:58.762374Z","title":"Elliptical k-nearest neighbors: Path optimization via coulomb’s law and invalid vertices in c-space obstacles,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.762374Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:bb206ae5e1377a8c2cda50ef030de0438a47fb151a942fb60a94da7569d3a22b","observation_id":"cfcdbb3b-c4cd-4e53-8cfa-019a4367af2f","resolution":{"observed_at":"2026-08-05T15:34:58.762374Z","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-05T15:34:58.767327Z","title":"Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.767327Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:fd48a4403c1ac6ab5ac2850afa1b8d00a065f0eecfbcde11e51d3881475b5969","observation_id":"3cc4562f-86cb-41ec-be4b-dbbc55f7f6bf","resolution":{"observed_at":"2026-08-05T15:34:58.767327Z","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-05T15:34:58.771670Z","title":"Informed sam- pling for asymptotically optimal path planning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.771670Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:952ac9748eb3c8c8a4b6b4313e3e58bab08604ebf023fb94989aebb70f20eb73","observation_id":"2178663c-33e3-4588-8bee-1ce34fe0d6a2","resolution":{"observed_at":"2026-08-05T15:34:58.771670Z","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-05T15:34:58.775802Z","title":"Batch informed trees (BIT*): Informed asymptotically optimal anytime search,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.775802Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:4413a05132c10dd611da45b0b104a644a501525734b40b06ac3e07d41f4cfaf4","observation_id":"e709e917-0bf9-4e92-8cb0-e51d7229a327","resolution":{"observed_at":"2026-08-05T15:34:58.775802Z","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-05T15:34:58.780198Z","title":"Adaptively informed trees (AIT*) and effort informed trees (EIT*): Asymmetric bidirectional sampling-based path planning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.780198Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:c5616dd6bf899cb97c74a9c8a98a46c8e98395154a3ccb1c6ce4e4e87daa0e53","observation_id":"f4a304fe-9a2e-40c2-851b-e1545a9909a1","resolution":{"observed_at":"2026-08-05T15:34:58.780198Z","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-05T15:34:58.784659Z","title":"Flexible informed trees (FIT*): Adaptive batch-size approach in informed sampling-based path planning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.784659Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:fb1b91e4e7f9fdeea2a792415672481bb77b9032c6f5a1ee3e37897e676e8a31","observation_id":"707687cf-a638-4395-9bfa-e16f505e3556","resolution":{"observed_at":"2026-08-05T15:34:58.784659Z","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-05T15:34:58.789130Z","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.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.789130Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:9d21fd81573915541487ca78313b88d6d50c81d22cec4d1b54be1ce8a7d30e9b","observation_id":"23b34af8-dc44-4f07-9992-1bc2707e66da","resolution":{"observed_at":"2026-08-05T15:34:58.789130Z","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-05T15:34:58.927358Z","title":"The critical radius in sampling-based motion planning,","venue":null,"work_id":"974e9ed7-187b-4664-9f81-8e1408046145","year":2020},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.793663Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:db11bcfdcfa79e1598001bc03c177b5d987f5c6f1d56a0bdde979246cd90dd53","observation_id":"b4f851ac-7bf4-4186-91c3-3cdbbaa29e3a","resolution":{"observed_at":"2026-08-05T15:34:58.932108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:34:58.802743Z","title":"Benchmarking motion planning algorithms: An extensible infrastructure for analysis and vi- sualization,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.802743Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:016b5997fba894087f50bbe544dd8ccce88463231411fd2818cf3101060d3c98","observation_id":"9a14156b-0e43-4ad8-9f83-521bdf11520c","resolution":{"observed_at":"2026-08-05T15:34:58.802743Z","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-05T15:34:58.807796Z","title":"Planner developer tools (PDT): Reproducible experiments and statistical analysis for de- veloping and testing motion planners,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.807796Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:2c99cc5973b15429f35ee6b76392950e0ed92d1cdd3d83479d28834f725765df","observation_id":"1f565dc1-8e6e-472e-83ba-2ef8b7296baf","resolution":{"observed_at":"2026-08-05T15:34:58.807796Z","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-05T15:34:58.811928Z","title":"Moveit! task construc- tor for task-level motion planning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.811928Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:f065a0ca6b7ba791ecefbf2f5c86ddddc1312920a5959b74112e49c56c5f4428","observation_id":"ab7b4b52-fc09-4124-b96f-1b24e9f5c66f","resolution":{"observed_at":"2026-08-05T15:34:58.811928Z","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-05T15:34:58.881048Z","title":"OpenRA VE: A planning architecture for autonomous robotics,","venue":null,"work_id":"f1ea6f58-d0bc-40a2-8ae1-5315df377afd","year":2008},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.815850Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:522915ec1f3f1ff10cd405e0836cf58b85aa759b3e27a924d03db476b6e5dc6e","observation_id":"94326a3c-4681-45ad-8881-ce8ccbefaa53","resolution":{"observed_at":"2026-08-05T15:34:58.886726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:34:58.819850Z","title":"The open motion planning library,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.819850Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:30fb38fc365126cfc2a383a30a0dc2b392482781f6c4f9c5f1e4af658dc4b476","observation_id":"3fa140f8-b254-4a97-8e6e-82d52a64c11b","resolution":{"observed_at":"2026-08-05T15:34:58.819850Z","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-05T15:34:58.853240Z","title":"Nearest-neighbourless asymptotically optimal motion plan- ning with Fully Connected Informed Trees (FCIT*),","venue":null,"work_id":"054803b3-b14f-49f0-8a31-5ecec0dbd130","year":2025},"citing_paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T15:34:58.824039Z"},"links":{"citing_paper":"/paper/2508.19790"},"observation_digest":"sha256:8388ce6b2573c83952b25a69a8ac831a5efecdb526f449ccc34f310a56a3081b","observation_id":"7d2a00ae-68cf-4660-bff0-79d65ddeca71","resolution":{"observed_at":"2026-08-05T15:34:58.860049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.19790","last_updated":"2025-08-27T11:16:36Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-05T15:34:54.474930Z","submitted_at":"2025-08-27T11:16:36Z","title":"APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":26},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2508.19790."}