{"as_of":"2026-08-22T08:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e95e6821578a1691be45f20c5b94fdc21ab5c62d0f989e1afe45721f3c98cfcd","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:27:11.969843Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2411.13507/citation-record","integrity":"/paper/2411.13507/integrity","json":"/paper/2411.13507/citation-record.json","paper":"/paper/2411.13507"},"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-12T16:27:13.031260Z","title":"A Mobile Automaton: An Application of Artificial Intelligence Techniques:,","venue":null,"work_id":"bbd1bad7-3676-43ec-b481-ee989011143d","year":1969},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.764404Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:f0ca714adfad32833a39ddf45ad806b998b6c09c89859653d7df603f6b61ac14","observation_id":"4b9c51e4-a541-4377-aa51-df5b427a1441","resolution":{"observed_at":"2026-08-12T16:27:13.036930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1049/csy2.12020","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:27:12.027922Z","title":"A survey of learning-based robot motion planning,","venue":null,"work_id":"05f507a4-e7c2-494f-8931-5e2eccf92b3d","year":2021},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.769972Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:f68927d762251a4da34a557ad6ac0134b8ea461207e1c82323b56de813dbace7","observation_id":"9beb0fa3-15d0-42db-a423-929d9fd0f1d4","resolution":{"observed_at":"2026-08-12T16:27:12.041938Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.06013","last_updated":"2020-06-27T19:14:00Z","snapshot_observed_at":"2026-08-14T16:06:12.665424Z","submitted_at":"2019-07-13T05:34:01Z","title":"Motion Planning Networks: Bridging the Gap Between Learning-based and Classical Motion Planners","version":3},"cited_work":{"arxiv_id":"1907.06013","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.06013","snapshot_observed_at":"2026-08-12T16:27:12.617386Z","title":"Motion Planning Networks: Bridging the Gap Between Learning-based and Classical Motion Planners","venue":"cs.RO","work_id":"027104cc-5379-4004-87ad-8d989dc3fb80","year":2019},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.775186Z"},"links":{"cited_paper":"/paper/1907.06013","citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:d5fdf2a0d86de5305650bdd56b4b4f3ac79a02ca10739b4431a3fe25b486d9d6","observation_id":"72d69156-9fc8-49b4-b33c-f87dd9ce2023","resolution":{"observed_at":"2026-08-12T16:27:12.624098Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07910","last_updated":"2018-11-06T14:18:38Z","snapshot_observed_at":"2026-08-17T21:35:55.454898Z","submitted_at":"2016-09-26T10:07:37Z","title":"From Perception to Decision: A Data-driven Approach to End-to-end Motion Planning for Autonomous Ground Robots","version":3},"cited_work":{"arxiv_id":"1609.07910","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.07910","snapshot_observed_at":"2026-08-12T16:27:12.591043Z","title":"From Perception to Decision: A Data-driven Approach to End-to-end Motion Planning for Autonomous Ground Robots","venue":"cs.RO","work_id":"8ce57162-813a-4bf8-8d56-7f9bc80f301e","year":2016},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.781320Z"},"links":{"cited_paper":"/paper/1609.07910","citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:309931955adc5a8b6328f71d75512a2491aa07eb82a5ad6e366d9ad1df44a41b","observation_id":"e3916a72-c028-4b83-b04b-37c523d1a9f0","resolution":{"observed_at":"2026-08-12T16:27:12.598125Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.11102","last_updated":"2019-04-25T00:05:24Z","snapshot_observed_at":"2026-08-14T19:55:59.351891Z","submitted_at":"2019-04-25T00:05:24Z","title":"Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.11102","snapshot_observed_at":"2026-08-12T16:27:11.787841Z","title":"Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.787841Z"},"links":{"cited_paper":"/paper/1904.11102","citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:0176e677ad6f2590afc0e60f3c0221139ef32552616687f445d43cd8cc722037","observation_id":"d23db40f-63cb-420e-8faf-e7ccf40ef201","resolution":{"observed_at":"2026-08-12T16:27:11.787841Z","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-12T16:27:13.012366Z","title":"Kinodynamic Planning,","venue":null,"work_id":"ac0ad0ed-20e5-403c-ad19-41a63ae90363","year":2021},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.798277Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:2ad1783aa8f703882b3582df2d41a174d1ce3e825a0b5c32bdacce64a24a2abd","observation_id":"861fa41f-5334-499d-a79c-a2a14c1b6f66","resolution":{"observed_at":"2026-08-12T16:27:13.017679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:11.804018Z","title":"Kinodynamic motion planning,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.804018Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:c495d9e38832285dbcce72cc5ce7bf47abda748daa759e067504555b1531be78","observation_id":"d3133d87-f6b6-48ea-ac96-ae25eb00c4fc","resolution":{"observed_at":"2026-08-12T16:27:11.804018Z","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-12T16:27:12.977983Z","title":"Randomized Kinodynamic Planning,","venue":null,"work_id":"3a78a990-42da-4c67-a26d-ea81201051f3","year":2001},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.809344Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:a6b2ff604a9b9d30ac827d3f12d8b56f708b43ae37627d792096dbcf2949317e","observation_id":"ccf8109f-753b-42c0-a457-61e2222aba3c","resolution":{"observed_at":"2026-08-12T16:27:12.984337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"document/6631299","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:27:12.540223Z","title":"Kinodynamic RRT*: Asymptotically optimal motion planning for robots with linear dynamics,","venue":null,"work_id":"bab5c9bb-d040-419b-8481-091439c5f4a0","year":2013},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.815096Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:cad178ca9fddfd7958b9644ed00dad6cb3f2598e064f5387b4f56e499fdaf429","observation_id":"2c0d6321-73cb-4927-b78c-dc56d2815060","resolution":{"observed_at":"2026-08-12T16:27:12.549291Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.960235Z","title":"Rapidly-exploring random trees : A new tool for path planning,","venue":null,"work_id":"008960dc-b457-4098-ac43-ac35a6642829","year":1998},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.821570Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:425d824d440ee698441a95d56b44496e1bc963f522e4262105903b86a92826b5","observation_id":"0582e0cd-8ede-4e07-9e4b-7e5836e597c4","resolution":{"observed_at":"2026-08-12T16:27:12.966044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.938735Z","title":"Reachability-guided sam- pling for planning under differential constraints,","venue":null,"work_id":"34fd6661-3244-4b9b-898b-71e4f96f3efa","year":2009},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.827771Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:5f002d6a914905652e6a831d52edecb64dd600033d70254670190368638f04a1","observation_id":"d2f45a0f-b418-4954-86cd-3a96d019c606","resolution":{"observed_at":"2026-08-12T16:27:12.946759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"papers/1971998","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:27:12.450382Z","title":"Optimal paths for a car that goes both forwards and backwards","venue":null,"work_id":"12c3b879-5429-4e64-bd6c-804445050366","year":1990},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.833757Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:1a3a6e12a9ed7cc7a8b13ac9d03968319288eda3fa645409d9167eb223714665","observation_id":"f5647e74-354d-4ed6-9468-7309585f46c6","resolution":{"observed_at":"2026-08-12T16:27:12.459733Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.04731","last_updated":"2018-03-06T22:05:06Z","snapshot_observed_at":"2026-08-14T20:24:15.671688Z","submitted_at":"2017-10-12T21:45:24Z","title":"Planning, Fast and Slow: A Framework for Adaptive Real-Time Safe Trajectory Planning","version":2},"cited_work":{"arxiv_id":"1710.04731","doi":null,"metadata_source":"pith","pith_arxiv_id":"1710.04731","snapshot_observed_at":"2026-08-12T16:27:12.374543Z","title":"Planning, Fast and Slow: A Framework for Adaptive Real-Time Safe Trajectory Planning","venue":"cs.SY","work_id":"6d156325-560a-48e1-8127-80240b5cd140","year":2017},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.839028Z"},"links":{"cited_paper":"/paper/1710.04731","citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:69c54040df86110c409c9ada11a6a1edb4f683c445bbad7bbc54d7b38377db23","observation_id":"30998fa6-8f4f-4091-b628-f56ce1a72972","resolution":{"observed_at":"2026-08-12T16:27:12.380699Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.917670Z","title":"Reachability-guided sam- pling for planning under differential constraints,","venue":null,"work_id":"736bdcf0-5d24-4bb4-9f2e-23ce5dcb15e4","year":2009},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.844369Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:5a952612f0545b46e8c0b6ad06c476ad0c8c380011427ce987b8c9c28e4bd62a","observation_id":"5f53428a-fec5-4a9e-914a-f9151c8afcd2","resolution":{"observed_at":"2026-08-12T16:27:12.924098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.895370Z","title":"R3T: Rapidly-exploring Random Reachable Set Tree for Optimal Kinodynamic Planning of Nonlinear Hybrid Systems,","venue":null,"work_id":"678d40ce-d28b-4fab-959c-ebfd16267e4b","year":2020},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.850961Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:23a748fb839f6547bc86c28bde70286c2449a57ac9f3255c7ca22c0591381235","observation_id":"9aebd4b3-45e9-4d68-b15c-c3032ddb3a4b","resolution":{"observed_at":"2026-08-12T16:27:12.904244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:11.856465Z","title":"Mixed- integer programming in motion planning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.856465Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:73dd2842c36c6c83eab132ea67b1bda2f026f6d398f0bc4ab077d6c31af1629e","observation_id":"c24c270d-6761-47af-a03d-d5888c509c72","resolution":{"observed_at":"2026-08-12T16:27:11.856465Z","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":"document/7138978","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:27:12.342400Z","title":"Efficient mixed-integer planning for UA Vs in cluttered environments,","venue":null,"work_id":"6a3bcb4d-54e4-4a37-b5d8-53c33c6094e5","year":2015},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.861378Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:3eac749c85169f5217f9e3830ea27496e952d8443b090850902e48838891f043","observation_id":"f1d55175-b5a2-4d1b-a752-91e7e460e2e8","resolution":{"observed_at":"2026-08-12T16:27:12.354101Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.11565","last_updated":"2023-07-03T19:12:57Z","snapshot_observed_at":"2026-08-16T18:49:34.306656Z","submitted_at":"2021-01-27T17:40:11Z","title":"Shortest Paths in Graphs of Convex Sets","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.11565","snapshot_observed_at":"2026-08-12T16:27:11.868908Z","title":"Shortest paths in graphs of convex sets,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.868908Z"},"links":{"cited_paper":"/paper/2101.11565","citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:cd59868045b72dc2034b780bd28de89f06c427d251ce7621867fc8cfd6b64978","observation_id":"b5c9f148-f5dd-42bb-bba4-21331bd6eb6d","resolution":{"observed_at":"2026-08-12T16:27:11.868908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.04422","last_updated":"2022-05-09T17:03:06Z","snapshot_observed_at":"2026-08-16T17:01:34.302488Z","submitted_at":"2022-05-09T17:03:06Z","title":"Motion Planning around Obstacles with Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.04422","snapshot_observed_at":"2026-08-12T16:27:11.875360Z","title":"Motion Planning around Obstacles with Convex Optimization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.875360Z"},"links":{"cited_paper":"/paper/2205.04422","citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:e4ad489eda4b2d927f4763e8aa7c21bb9243dd017e1dcf64164d2b8a475ab23f","observation_id":"534da2f8-fdca-49c6-8ac9-26bd153aa7ab","resolution":{"observed_at":"2026-08-12T16:27:11.875360Z","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-12T16:27:12.858652Z","title":"An efficient and direct method for trajectory optimization of robots constrained by contact kinematics and forces,","venue":null,"work_id":"e73dd31d-c684-4a3d-af73-5f132324a1d8","year":2021},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.881231Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:42861354cf5adcfe429684485043fb868ba1b1030a44f2f975171fe17687bb2e","observation_id":"b8369ae7-87e6-446c-8b74-c9f4fd4ce11c","resolution":{"observed_at":"2026-08-12T16:27:12.865607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.838726Z","title":"Embedding nonlinear optimization in rrt for optimal kinodynamic planning,","venue":null,"work_id":"465be649-354a-44c0-a235-732fec648217","year":2014},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.886311Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:fa3b16710c68081463b1e314db126194c8451c3096387d27a0939e30d0804cd8","observation_id":"9a13052f-b551-4186-9c63-177ea0dd8e6a","resolution":{"observed_at":"2026-08-12T16:27:12.844472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.822186Z","title":"A kinody- namic steering-method for legged multi-contact locomotion,","venue":null,"work_id":"585d3c76-0bc0-4d21-9059-20e746f3505c","year":2017},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.891331Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:cfa54c1f1a2e6aaf8aa6674d9f8f922b09aec7ea680f04661c745c42cdcda927","observation_id":"fda456b8-0b8f-49c3-9513-d781454a48d4","resolution":{"observed_at":"2026-08-12T16:27:12.827525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:11.896899Z","title":"A quantitative framework for layered multirate control: Toward a theory of control architecture,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.896899Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:9cbaf4a6b4fdbef60fe625c849b854ac5bd2e5d44fdf95d66d79a2962472ae23","observation_id":"be32903e-3383-4972-8670-3617f9066ca5","resolution":{"observed_at":"2026-08-12T16:27:11.896899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.01072","last_updated":"2024-01-02T21:52:11Z","snapshot_observed_at":"2026-08-16T15:36:26.159086Z","submitted_at":"2023-05-01T20:13:23Z","title":"Fast Path Planning Through Large Collections of Safe Boxes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.01072","snapshot_observed_at":"2026-08-12T16:27:11.902226Z","title":"Fast Path Planning Through Large Collections of Safe Boxes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.902226Z"},"links":{"cited_paper":"/paper/2305.01072","citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:97aa027509cdea3498c0816ad77c86d858d88ea4e47b9f081cf3e91c90fd7fc6","observation_id":"bd31a90b-28c8-4204-8a03-be7b071f88e7","resolution":{"observed_at":"2026-08-12T16:27:11.902226Z","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-12T16:27:12.792601Z","title":"Multi-Rate Planning and Control of Uncertain Nonlinear Systems: Model Predictive Control and Control Lyapunov Functions,","venue":null,"work_id":"9da2a209-c14a-40ea-9c50-dd7638aa5cf0","year":2022},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.907383Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:445d688af06f1ad6ffd611c12d75d8b520364231999da7b31a2e31e152e8f3a8","observation_id":"398bc1ed-0039-48ee-ab3d-502c437aa13f","resolution":{"observed_at":"2026-08-12T16:27:12.799710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.775390Z","title":"Creating ARCHER: A 3D Hopping Robot with Flywheels for Attitude Control,","venue":null,"work_id":"98be15da-b391-409e-a502-2127e912fad4","year":2022},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.913555Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:b507ed76776223c270d0104836acebe48e50d8880a9b5bfdea2e957fb07cf29b","observation_id":"15b055eb-98aa-46f9-b890-39748163f7fa","resolution":{"observed_at":"2026-08-12T16:27:12.780690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.750977Z","title":"Fast online trajectory optimization for the bipedal robot cassie","venue":null,"work_id":"65427dbc-eb96-4e02-b92a-6898ca022dec","year":2018},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.918459Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:e27e68916589f9d95e5ab033269f1eae8bcbd89df4bbb65a0deea6d7d5f24c4b","observation_id":"162ce4bb-d96c-4807-8faa-9c347224e37d","resolution":{"observed_at":"2026-08-12T16:27:12.759621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:11.924194Z","title":"On characterizations of the input- to-state stability property,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.924194Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:ad9d0352a135109ba284f716885cae62e60b1db5a06d7aca235222a168b92799","observation_id":"78cf0fe1-719d-4b4d-a91a-ccfebebf3faa","resolution":{"observed_at":"2026-08-12T16:27:11.924194Z","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-12T16:27:11.929535Z","title":"A primer on bézier curves,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.929535Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:0bdd5b315b7f85d17a184d9e4220bb1f665e365f4991dae89e30072539f4d311","observation_id":"5f0e533d-93ac-4a32-b231-b3159dc69753","resolution":{"observed_at":"2026-08-12T16:27:11.929535Z","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-12T16:27:12.714974Z","title":"Reachable bézier polytopes: A primitive for layered motion planning,","venue":null,"work_id":"099f2020-5180-45d2-9f9f-7b96a6bc2828","year":2024},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.934068Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:a97fed138cae0cb69b438cc7d196134beffa4186892f8e3f1f6f658714475d36","observation_id":"77adafb7-d9d5-49a8-adb9-25fad5b3c279","resolution":{"observed_at":"2026-08-12T16:27:12.721044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.695667Z","title":"Rawlings, D","venue":null,"work_id":"be634f05-bbc5-4a74-9027-bf605475564c","year":2017},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.938724Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:831e5de494ff034d46bb0cab4c28a0f959c287991739a3a7eaa55d5ae86cfe73","observation_id":"df7ff4d9-01c2-463d-96ea-f027a51db862","resolution":{"observed_at":"2026-08-12T16:27:12.701503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.678326Z","title":"Supplemental video","venue":null,"work_id":"84bb54ab-e835-4c92-ac99-bad8175911a8","year":null},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.945064Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:d7f2e1491f7946db03214519de701f2aec1532e7410557eea241d209e222cd9c","observation_id":"a2c8a4b3-32fc-4706-82af-5229c3f60d5e","resolution":{"observed_at":"2026-08-12T16:27:12.683946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.658764Z","title":"[Online]","venue":null,"work_id":"26a8aa48-4218-4bf9-b649-c9aecf598f08","year":2024},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.950846Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:b608512296a58951dd699733ce1fd65e809cc5310480c35ee0acf3d206b64abf","observation_id":"0cd8137f-6223-4881-9056-a6c1170f67c0","resolution":{"observed_at":"2026-08-12T16:27:12.665640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:12.637717Z","title":"Nonlinear model predictive control of a 3d hopping robot: Leveraging lie group integrators for dynamically stable behaviors,","venue":null,"work_id":"e7c0a8b9-58be-4c34-aab4-b8d8a4bf5138","year":2023},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.956292Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:3f86db530181a3d4dfc8b35d4833179ad0183915003417b5e4aa23daa4c93157","observation_id":"da713bda-b85b-4055-a2fa-be9c09eb553b","resolution":{"observed_at":"2026-08-12T16:27:12.643481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T16:27:11.962227Z","title":"OSQP: an operator splitting solver for quadratic programs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.962227Z"},"links":{"citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:9abe678cc5e6b9f9a4307924d6680e4b26d42b08aa43663dc2758383ae4b91db","observation_id":"3092963f-c2f8-4eb7-bfa1-4ce332695583","resolution":{"observed_at":"2026-08-12T16:27:11.962227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.02643","last_updated":"2023-04-05T17:59:46Z","snapshot_observed_at":"2026-08-08T05:14:59.435033Z","submitted_at":"2023-04-05T17:59:46Z","title":"Segment Anything","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.02643","snapshot_observed_at":"2026-08-12T16:27:11.969843Z","title":"Segment anything,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.969843Z"},"links":{"cited_paper":"/paper/2304.02643","citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:5a92958f9ac2da20fc0036533763c0159c222562a7440611a625c013e62369e1","observation_id":"9c53a90a-6beb-43b8-be51-021824edd7a0","resolution":{"observed_at":"2026-08-12T16:27:11.969843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-16T05:45:38.026920Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":7,"verified_fuzzy":18},"total_outbound_references":36},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2411.13507."}