{"as_of":"2026-08-08T11:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6f4a00aa3ce4f1fadfac258b661ef11a936e70cad8bdeaccae9af63a82c093f2","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T16:26:33.846149Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2607.03987/citation-record","integrity":"/paper/2607.03987/integrity","json":"/paper/2607.03987/citation-record.json","paper":"/paper/2607.03987"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T16:26:33.846149Z","title":"LaValle, Planning Algorithms","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:01cfff2132a93728993d7a16da4fe06979a5f8f2d713ec519737a0d96d1e3e83","observation_id":"6333f6d2-4c64-4913-951d-c9ea5013743f","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Motion p lanning,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:4b2c82e18916c15771fd55c6122568cc0bacf13c3bc0a9458321bd370ff1568e","observation_id":"894ce8dd-73b6-4cb9-a940-fff99303a0de","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Rapidly-exploring random trees: A new tool for path planning,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:faffb6dda8e62624740823d64b2efe66fe601c932b303f1d3a7809fc67492238","observation_id":"33b02a7d-1eb7-49b0-978e-5fd560781436","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Asymptotically optimal sampling-based kinodynamic planning,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:027a268d852fee7542f486f103c46e6f1ad3c6c20deabc30092346012650e67b","observation_id":"a7af794b-037f-4650-9753-f8d6fa884730","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Sampling-based motion planning: A comparative review,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:fbed0b3353984491e443c1fac1c650ab9f1270b4caa603dad664d1165b57c7d4","observation_id":"7bf90fdb-69b4-4f97-8c3d-ab9d69423586","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Motions in microseconds via vectorized samp ling-based p lanning,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:3e53c0e9ad17bb58bf2f53ef43e52ddf8e6fb65a68b5930b095b89cdf7fcbf16","observation_id":"54631021-9c13-4c59-9aa9-ba008f55a332","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.14545","last_updated":"2023-09-28T19:26:34Z","snapshot_observed_at":"2026-08-03T04:30:34.125084Z","submitted_at":"2023-09-25T21:42:35Z","title":"Motions in Microseconds via Vectorized Sampling-Based Planning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.14545","snapshot_observed_at":"2026-07-14T16:26:33.846149Z","title":"Available: http://arxiv.org/abs/2309.14545","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"cited_paper":"/paper/2309.14545","citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:47038af009b45484aa62a71b83b647cef9583e4075aec48192b46f39e8365b6d","observation_id":"123da4db-3669-4ede-a83a-603b8eb7bf14","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Massively parallelizing the RRT and the RRT*,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:b764f5d439f834f07e048ab3753ed020c5866297cacabe4d7b0993114e17058a","observation_id":"1b3af53f-3681-474a-95b2-1bcef20bdc9d","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"pRRTC: GPU-parallel RRT-Connect for fast, consistent, and low-cost motion planning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:afbe23803540bd82a30f886b8f381af9fb18a86dbab4c8c2f5e2bb4d5bac2e02","observation_id":"9751cfb9-4bcf-4d6d-ad67-38fd803ca105","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Kino-PAX: Highly parallel kinodynamic sampling-based planner,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:c783314fa2fd9b05edd0c102f5ff405480bd6e308a8f657d4e9206e4d2037419","observation_id":"d3c46a24-1b97-4374-961d-3d05d41d729c","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Randomized motion planning on pa rallel and distributed architectures,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:cf834c2b6ba5543283e75cb008e2c565b17a4988863668e13053ad5a3d4b68cb","observation_id":"8e59be0d-3336-428a-8c49-0bc49856e598","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"C-FOREST: Parallel shortest path planning with supe rlinear speedup,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:16d31df88e0896b4de18ed443406ee65c9e68005d045dd8f52b227ca4715a07a","observation_id":"af583a7e-81f7-4974-b9ed-812744b727ea","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Revisiting the asymptotic optimality of RRT,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:f0314b5716598135c6dd7f2afe6b8376a0e244f48cce77d24917e5db1eab68ac","observation_id":"8ebf80f0-72a8-488d-a505-ff3cd43b8740","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Kinodynamic RRT*: Asymptotically optimal motion p lanning for r obots w ith linear dynamics,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:c5fd6b3f2c97bcbabc4a90ec1ad03a1d4664f9cb83dcb274fabc1757083cfc82","observation_id":"c2aac225-d5ee-411e-8bf6-34e5bbb04add","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Asymptotically optimal planning by feasible kinodynamic p lanning in a s tate–cost space,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:9b7ab898d75f1d8315536057483406b235489aa6fa4ba58654aadcdc14e1cf90","observation_id":"d7bedc64-16ce-4309-93c4-887d5d2bc42e","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"J AX: composable transformations o f Python+NumPy programs,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:d45b503ad200b4ee22361afcfd697194fbdeec889000e969db30ebcbbfb42150","observation_id":"a62152df-2e74-4ec9-8cb9-d3f91c0b6a85","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"MuJoCo: A physics eng ine for model-based con trol,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:b9eda1374a60c17927c5fb1613a8dfdb0ca9a8d15cedda91d27ce98fb40cd90d","observation_id":"d8f92051-4a05-4480-adde-4408888983f4","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:263850ad7f19553b6ec517696862077cb85e1cfe9c4d73873108204141546010","observation_id":"461e9c06-b11f-446a-899c-ea4f52b2fd20","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"RRT-Connect: An e fficient approach to single-query path p lanning,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:ac98e5227f1b8b3a83ba5874c349f9b5ae53890fd8f0395189c82706d2e545b2","observation_id":"bb88bf7f-697b-4124-b3c2-0d9a03122e31","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Path planning in expansive configuration spaces,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:9818294ff4e14666e59dedfd01b190ea1e8f80966bc261838c68247e5667105c","observation_id":"55eab18a-ee45-4821-b55c-0e75b1bda2bf","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Bidirectional sampling-based motion plan- ning without two-point boundary value solution,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:4dd50ccd0ab73880f921e871fb51f9e3e62d0c112b60368275596d61fa47ce2d","observation_id":"2817bc28-25ff-4d52-b908-8d4ffe3b6d60","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Parallel simulation o f contact and ac tuation for soft growing robots,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:3d398e9049848385f3e194d3c1cb2d389a3961544f96604b901e28406e9c57be","observation_id":"23a68210-a78b-4246-8fa1-0c4faa7da390","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Parallelized control-aware motion planning with learned controller proxies,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:d8c335044b76fcdb0b1ca0631701e62f535cb19ed7f562e109ea0013a30b4f70","observation_id":"a552521d-eb5f-49c3-b8a4-4a476a16d040","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Asymptotically optimal sampling- based motion planning methods,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:450b2267dcf7f842fbb47d86bb0f24efaecb5a56b65c24a16e0f78ddcb7ff9c3","observation_id":"676b7ef6-bfc2-4a5a-a5d8-243bda664fd9","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Motion planning for autonomous d riving w ith a con formal spatiotemporal lattice,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:ed6dbabfed245f8b54f4da3cdc2766233a590d99a2012d5b7dcfe4c18e05e49e","observation_id":"8eac1fa9-9d9e-4645-bf5a-247ef08a62cc","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Kinodynamic mo tion planning,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:6932ce387965768814af1d3bc714ff931b69639ad1113fa719f138785ec616fb","observation_id":"5b86de56-cc19-4fad-979b-afb783fc3371","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Provably good approximation algorithms for optimal kinodynamic planning: Robots with decoupled dynamics bounds,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:e2347de50b09d46793ef8d3506d7c1168926fc2632ffea44b0b8e54b0a2f9e43","observation_id":"6763fe10-764c-4d22-bb85-2de0b17ec3ed","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Kino-PAX+: Near-optimal massively parallel kinodynamic sampling-based motion planner,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:9f015ca352cccbfee33bb653f14f0931efeb5c7d2b7f4fbb78f07c7f72c206a8","observation_id":"390cb8c2-54d3-47d0-9c3d-4b79c5abd50f","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Kleinbort, O","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:b056c1c70c7fe7c863ebf616183537fa31d6c020ff4f1bad730ad64a30d2790a","observation_id":"aa841633-c80d-4a98-9e29-89dd862d7e40","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"Corrections to “probabilistic completeness of RRT for geometric and kinodynamic p lanning w ith forward p ropagation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:43bd00c1c158c264a137d27c785235dd2eebe6682635f0219c6dae905f768858","observation_id":"38b1a5ee-6f52-4556-a10f-1f1cf7e21ab9","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"iDb- A*: Iterative search and optimization for optimal kinodynamic motion planning,","venue":null,"work_id":null,"year":2031},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:4c1f18716f0d4ec66de8b805dedba28d2d6ad7085efa483a52e2a7df265d2a3f","observation_id":"3a681931-aee9-42c8-93ab-2df39289ce8a","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","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-07-14T16:26:33.846149Z","title":"The Open Motion Planning Library,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T16:26:33.846149Z"},"links":{"citing_paper":"/paper/2607.03987"},"observation_digest":"sha256:b9f67ea284a53cb35304edbcbc19e225a397e6b2eca3acfe9c4f752771b30ed2","observation_id":"5807d589-4870-4ecb-bd1f-86b8b1c823e4","resolution":{"observed_at":"2026-07-14T16:26:33.846149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.03987","last_updated":"2026-07-12T20:18:28Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-06T06:15:40.635426Z","submitted_at":"2026-07-04T19:07:03Z","title":"Fast Asymptotically Optimal Kinodynamic Planning via Vectorization"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":32},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2607.03987."}