{"as_of":"2026-08-15T22:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:731467caa1e92587a875b413d2deb7e0fddbf4ee7fa12eb122fdb323d6817729","coverage":[{"denominator":120,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:14:10.113183Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2412.11270/citation-record","integrity":"/paper/2412.11270/integrity","json":"/paper/2412.11270/citation-record.json","paper":"/paper/2412.11270"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:14:09.392276Z","title":"Bellman, Dynamic programming","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.392276Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:9193c679fdcca2bca3467ee6d0c317f1f834e5863141537a54b18badc2151679","observation_id":"12beeb41-5165-488a-bf34-0a25ed83928f","resolution":{"observed_at":"2026-08-11T15:14:09.392276Z","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-11T15:14:09.398143Z","title":"Rapidly-exploring random trees: A new tool for path planning,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.398143Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:2c4509e59b97dd182d0949b0a5d0806251aebf71385c20261c00a629566c4dd2","observation_id":"aaa92a57-e2fe-4698-a09a-83e29d15f9dd","resolution":{"observed_at":"2026-08-11T15:14:09.398143Z","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-11T15:14:09.404813Z","title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.404813Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:93d5978d4f6084d2373a8cfddfde9b9fe486d5a9017a605f04544dc26afcc035","observation_id":"1a6d9695-1611-46b0-bc5c-ab3ca4716c20","resolution":{"observed_at":"2026-08-11T15:14:09.404813Z","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-11T15:14:09.415012Z","title":"Sampling-based motion planning: A comparative review,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.415012Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:08791c7df541bc6d41be0bceffb12b156eb89f8776101ec2915fa6c1299766ee","observation_id":"e075e465-91b0-4460-92e8-6d793e88b6c9","resolution":{"observed_at":"2026-08-11T15:14:09.415012Z","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-11T15:14:09.423299Z","title":"Model predictive control of swarms of spacecraft using sequential convex programming,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.423299Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:35d836a8924c6483a8af25fbae10d84c7fe448ced3b1566fdfa28ca9ab3d0641","observation_id":"2fd751a7-cb69-4c69-b800-c1f042d26331","resolution":{"observed_at":"2026-08-11T15:14:09.423299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09125","last_updated":"2021-06-16T20:55:18Z","snapshot_observed_at":"2026-08-13T19:02:31.650137Z","submitted_at":"2021-06-16T20:55:18Z","title":"Convex Optimization for Trajectory Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09125","snapshot_observed_at":"2026-08-11T15:14:09.431710Z","title":"Convex optimization for trajectory generation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.431710Z"},"links":{"cited_paper":"/paper/2106.09125","citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:ed36f3182d99cb9c916c8ae3900d87da179fb6e05086ef9ce26727060ecdafb0","observation_id":"f2da54e1-b40d-461f-b969-0511252ab33c","resolution":{"observed_at":"2026-08-11T15:14:09.431710Z","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-11T15:14:09.438776Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.438776Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:6c8e00f7be3c677ba77e3ed320691705d1a0ae29383edfe984088cd8a40f6f6a","observation_id":"c83ecc0b-5c4f-48ee-a410-3d2b429d42b3","resolution":{"observed_at":"2026-08-11T15:14:09.438776Z","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-11T15:14:09.444461Z","title":"Information-based guidance and control architecture for multi-spacecraft on-orbit inspection,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.444461Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:5fee2f9c0b5ddadb2743758853a7ed380ff2becec17c45cf04b1e287aa1ce465","observation_id":"71852545-a5b6-41dc-a79b-16a9e24c8e02","resolution":{"observed_at":"2026-08-11T15:14:09.444461Z","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-11T15:14:09.450152Z","title":"Hierarchical task and motion planning in the now,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.450152Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:97c615bcd50b74581af36e35a432a1af0bfb71b13f76339c3738ff55825d6d70","observation_id":"eb8933e6-3035-4c8a-8bd2-949fd65efe86","resolution":{"observed_at":"2026-08-11T15:14:09.450152Z","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-11T15:14:09.455773Z","title":"Integrated task and motion planning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.455773Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:ff909ea63252e0ad97ada49107e88fb93b07d714e1413c7ac305df05a8b43bc6","observation_id":"083fa497-7130-445c-a7ef-980770e9eb7f","resolution":{"observed_at":"2026-08-11T15:14:09.455773Z","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-11T15:14:09.462670Z","title":"A survey of motion planning and control techniques for self-driving urban vehicles,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.462670Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:6ad6bd9b561936d58abfff9cf3c4a244bc99dc615b06eb4f2eada5adffdbebf2","observation_id":"76c3dc60-ced9-413f-bf0b-ae95618bf776","resolution":{"observed_at":"2026-08-11T15:14:09.462670Z","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-11T15:14:09.468780Z","title":"Planning and decision-making for autonomous vehicles,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.468780Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:cfa8c601c463d60baf73e0af06af5ac74b41249a7ca6f0f8a3b83a88f8039047","observation_id":"559bc211-4bf4-4892-b6a7-7ca4ede0cfc8","resolution":{"observed_at":"2026-08-11T15:14:09.468780Z","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-11T15:14:09.475371Z","title":"Reaching the limit in autonomous racing: Optimal control versus reinforcement learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.475371Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:c3cd474b0082bb6105a62eb1a7d447130573aa3fb91c4dbfc0114c485d7fbeea","observation_id":"214644f6-d1fe-4838-a100-32ab4ec73bd3","resolution":{"observed_at":"2026-08-11T15:14:09.475371Z","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-11T15:14:09.481358Z","title":"An application of reinforcement learning to aerobatic helicopter flight,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.481358Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:f8b47f16cb705ac990f40a360b15a7a2d56206d34214a958145b90e041e0ce30","observation_id":"9810f815-2d6d-47e6-98ec-6fdece09edaf","resolution":{"observed_at":"2026-08-11T15:14:09.481358Z","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-11T15:14:09.486804Z","title":"Deep learning for detecting robotic grasps,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.486804Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:6b3ddb69e151008bb56f530eb62ece7cb867e6d17b71e3d8223ea0f2a023689d","observation_id":"ec167364-bd4e-47d6-b7bb-b74f620f293e","resolution":{"observed_at":"2026-08-11T15:14:09.486804Z","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-11T15:14:09.497603Z","title":"Robust feedback motion policy design using reinforcement learning on a 3d digit bipedal robot,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.497603Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:bc404e1707c17974abe8259a74e9cd78b5f1e1b787552702f303278379989e30","observation_id":"7676ffd0-cd94-419a-8624-80947c189ca8","resolution":{"observed_at":"2026-08-11T15:14:09.497603Z","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-11T15:14:09.504808Z","title":"A sparse sampling algorithm for near-optimal planning in large markov decision processes,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.504808Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:af8b511d1f65d5c3c7cc2535f7f34b0b9db0c9074243f8933dff4f0e5006c87f","observation_id":"9335d5db-86c6-4b85-85a3-5fc3f9064eb4","resolution":{"observed_at":"2026-08-11T15:14:09.504808Z","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-11T15:14:09.516037Z","title":"Bandit based monte-carlo planning,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.516037Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:a58b01422611c7784f0b78bebfeba3a7e8bdec1a2cbf08865a0588b661a650ff","observation_id":"9bf2a5a5-dacc-4038-8171-c3190eea2bae","resolution":{"observed_at":"2026-08-11T15:14:09.516037Z","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-11T15:14:09.525588Z","title":"From bandits to monte-carlo tree search: The optimistic principle applied to optimization and planning,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.525588Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:f0aff49d4216d27f7d9e6dc6b37250666a3e84f53ce6ccc8a0e5b662bda7189c","observation_id":"d1d47ce9-3235-4ab8-b5ae-24d22344ad00","resolution":{"observed_at":"2026-08-11T15:14:09.525588Z","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-11T15:14:09.537740Z","title":"A survey of monte carlo tree search methods,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.537740Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:03b2144d0792aaeec03cbc1e256b1621a27b6326e30953f63591044cc430348e","observation_id":"8a16153c-03bf-4bd5-97e3-c47907360ba9","resolution":{"observed_at":"2026-08-11T15:14:09.537740Z","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-11T15:14:09.544789Z","title":"The traveling-salesman problem,","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.544789Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:39a70fda489827a4c16f4b7625795124220dba05cfc87e34b9835e43f29fb619","observation_id":"7f6e1d6f-4f8a-4cdc-b86f-b371e332eb42","resolution":{"observed_at":"2026-08-11T15:14:09.544789Z","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-11T15:14:09.551219Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.551219Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:242a3e1b51c2fcf6c613e44f10e6d85029ec8053ead5c1c650a0a47bfb1c810b","observation_id":"e8d53dae-9cfc-493c-acec-ccaa02fee8e7","resolution":{"observed_at":"2026-08-11T15:14:09.551219Z","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-11T15:14:09.556633Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.556633Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:5f34346219d83687ba879bbb76ff681ad7e73373279dfce80d132efa9a8a0a1d","observation_id":"e63d6cd7-c463-49d4-9c2e-43d4231c5134","resolution":{"observed_at":"2026-08-11T15:14:09.556633Z","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-11T15:14:09.562695Z","title":"Asteroid redirect mission reference concept","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.562695Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:db69431933796b1e628a22518c87a950b55451cbd5f4f5370f6800f1d8171cd2","observation_id":"2c020631-323a-493a-99ab-5a647325a44c","resolution":{"observed_at":"2026-08-11T15:14:09.562695Z","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-11T15:14:09.568587Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.568587Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:da1ee53531847892d87db8bd542b2fd7a6e0bde59adae3889602f447dad9dcbf","observation_id":"2e3159a0-eaac-44c6-9ef4-6c720eb68221","resolution":{"observed_at":"2026-08-11T15:14:09.568587Z","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-11T15:14:09.575808Z","title":"Continuous upper confidence trees,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.575808Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:c675fbe3183a15b5f0aa006959dca39aa18aeed5dc4474e7f289802d01332126","observation_id":"d6c02ee0-07c2-425d-a437-d460563ba732","resolution":{"observed_at":"2026-08-11T15:14:09.575808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.00541","last_updated":"2022-12-24T00:50:53Z","snapshot_observed_at":"2026-08-15T17:49:58.274224Z","submitted_at":"2022-12-01T14:47:47Z","title":"Predictive Sampling: Real-time Behaviour Synthesis with MuJoCo","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.00541","snapshot_observed_at":"2026-08-11T15:14:09.588148Z","title":"Predictive sampling: Real-time behaviour synthesis with mujoco,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.588148Z"},"links":{"cited_paper":"/paper/2212.00541","citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:06881259b856c87ddef327164796c5ebe070b7c35ee011699ab3dd7f2efcbd3f","observation_id":"a2042198-91ba-471a-a74d-f197c329fec1","resolution":{"observed_at":"2026-08-11T15:14:09.588148Z","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-11T15:14:09.595739Z","title":"ApS, MOSEK Fusion for C++ 10.1.21 , 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.595739Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:d7a8148498167e4ef4fa5bddd152fc7a8d1e46f42faab409f132d7f5512cadf5","observation_id":"ce267535-efaf-4924-bbff-95bb62f79e91","resolution":{"observed_at":"2026-08-11T15:14:09.595739Z","resolver_source":null,"status":"malformed_identifier"},"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-11T15:14:09.604147Z","title":"Time-optimal planning for quadrotor waypoint flight,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.604147Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:a01d347bc3930b8155c0790194728f02cb79f0e1d2a71cae62b0f8d94df4254d","observation_id":"0c5ccd75-fd0a-42e6-ab17-046a6ace878b","resolution":{"observed_at":"2026-08-11T15:14:09.604147Z","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-11T15:14:09.612267Z","title":"Autonomous in-orbit satellite assembly from a modular heterogeneous swarm,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.612267Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:d86370eba09b350036575b523b29353613ad9cfce2fd881926db8fe9a0a5966b","observation_id":"8cf424aa-03ac-4798-b357-d1e848ea7efc","resolution":{"observed_at":"2026-08-11T15:14:09.612267Z","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-11T15:14:09.628650Z","title":"3d dynamic walking with underactuated humanoid robots: A direct collocation framework for optimizing hybrid zero dynamics,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.628650Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:dde357baad6ae494f94a5b7ad9f93d9bbd2261df0d0e5eac0e22e5f5e03a67e4","observation_id":"480fb432-56c0-448d-bd4b-1b00ab8e6fd9","resolution":{"observed_at":"2026-08-11T15:14:09.628650Z","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-11T15:14:09.634220Z","title":"Swarm assignment and trajectory op- timization using variable-swarm, distributed auction assignment and sequential convex programming,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.634220Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:e45e5006df8e3d910eacb42e9fd3d8250b4a54be4229d240c0b18b2381f09c3a","observation_id":"465401e6-39e9-498f-89d3-dcbbddb362d8","resolution":{"observed_at":"2026-08-11T15:14:09.634220Z","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-11T15:14:09.640371Z","title":"Unifying geometric, probabilistic, and potential field approaches to multi-robot deployment,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.640371Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:fec332470f71285945cb7ba2d52ecafc38db40272af851a057e10749779aa203","observation_id":"1515effa-c4ab-4459-8657-ec07391afac8","resolution":{"observed_at":"2026-08-11T15:14:09.640371Z","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-11T15:14:09.646514Z","title":"A second-order gradient method for determining optimal trajectories of non-linear discrete-time systems,","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.646514Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:4056c8fdaf6c75e3ba0ce053acd9f9b0f81a287ec3b3ecac51148655df707707","observation_id":"f7d4a788-9245-471c-8e52-f20740c64dca","resolution":{"observed_at":"2026-08-11T15:14:09.646514Z","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-11T15:14:09.652940Z","title":"A direct multiple shooting method for real-time optimiza- tion of nonlinear dae processes,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.652940Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:a76e16eeb79835488262455fdf4763fce9aa31fc50de34307cbbc67b7fc08c6d","observation_id":"0a8e81c4-028b-4b13-9eaa-cbe82f23239e","resolution":{"observed_at":"2026-08-11T15:14:09.652940Z","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-11T15:14:09.658938Z","title":"Iterative linear quadratic regulator design for nonlinear biological movement systems,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.658938Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:1daf1973d4fc88375863ae3bd33c56b6f346215a070238a4055dd9f026b9f335","observation_id":"5761afbe-6bf6-49c3-83e7-7a48bfa9155e","resolution":{"observed_at":"2026-08-11T15:14:09.658938Z","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-11T15:14:09.664226Z","title":"Local convergence of sequential convex programming for nonconvex optimization,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.664226Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:5502abdb128d40d9b8c3c9e383d8194fac7608a292a69e59ceb01035a5403fca","observation_id":"9ea0b4f3-3d4d-43af-95e8-c796c1246696","resolution":{"observed_at":"2026-08-11T15:14:09.664226Z","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-11T15:14:09.670984Z","title":"Gusto: Guaranteed sequential trajectory optimization via sequential convex programming,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.670984Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:b975c76ef29b40e993aa1b12bb41aac1c57d6d452d056f17f3af7ea42c78a742","observation_id":"b9067a2d-815a-4a11-a0ba-347c20441059","resolution":{"observed_at":"2026-08-11T15:14:09.670984Z","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-11T15:14:09.676571Z","title":"The Open Motion Planning Library,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.676571Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:1400626b5db10335e357dca635f6b03942ed3a8f76fc0a98dadab34eb93ecb76","observation_id":"3d21152f-1534-444e-8f33-3a749fb7ab71","resolution":{"observed_at":"2026-08-11T15:14:09.676571Z","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-11T15:14:09.682213Z","title":"Motion planning around obstacles with convex optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.682213Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:3f6d5f14805fb80d5a7e42614042230450c2ec7eba4db929f36defd74d1354e1","observation_id":"26dfea5c-b173-4ed8-93e3-b1d4a229fd39","resolution":{"observed_at":"2026-08-11T15:14:09.682213Z","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-11T15:14:09.688512Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.688512Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:cdaa1ed0afc21df5dcd2726455fc5187d127fae8ab22c04d4a0dc1872b902a6e","observation_id":"441c56da-94fa-4dba-9a18-15bcbcfbd4ec","resolution":{"observed_at":"2026-08-11T15:14:09.688512Z","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-11T15:14:12.648351Z","title":"Asymptotically optimal sampling-based kinodynamic planning,","venue":null,"work_id":"8b50fbf2-86f6-42c7-a9d7-39d584cbdacb","year":2016},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.694178Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:d925f35160d96598886978a102b53cc3afb7d9c64616e1a08a3a0ad5bfd62dcf","observation_id":"dac793c7-bb6e-4691-a738-d7764bb97d3b","resolution":{"observed_at":"2026-08-11T15:14:12.654901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.621116Z","title":"Poccia, Deterministic sampling-based algorithms for motion planning under differential constraints","venue":null,"work_id":"6c2d9940-8d00-45ea-aa58-aea56dad340d","year":2017},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.702621Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:ac506d0e1c30c379672db8ce3ee2376801e5df0a8c0136cd6343f039fa3b6c55","observation_id":"902c66b0-01b9-4bbd-96cd-13a3f6eb4c6c","resolution":{"observed_at":"2026-08-11T15:14:12.630671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.589268Z","title":"db-a*: Discontinuity-bounded search for kinodynamic mobile robot motion planning,","venue":null,"work_id":"b74a3d55-8fb2-481e-a406-4b9df0ab63d8","year":2022},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.709600Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:23f4031f6c6a43ba84bcf8f0a8782a6980e5b33315f91e51398223feb72e1e14","observation_id":"993de114-713f-4e00-afc4-96bf4b6b5f42","resolution":{"observed_at":"2026-08-11T15:14:12.597957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.568028Z","title":"Real-time motion planning for agile autonomous vehicles,","venue":null,"work_id":"8692efe2-93bc-4f49-807a-75c4111c720f","year":2002},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.717182Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:12a2621e5bf5f183e42dd5d291204ba85d344affe268fa4dd443fb484ac1c2aa","observation_id":"06eab270-6799-4d01-aa9e-d6e3a2a69cf6","resolution":{"observed_at":"2026-08-11T15:14:12.574139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.543407Z","title":"Maneuver-based motion planning for nonlinear systems with sym- metries,","venue":null,"work_id":"268f254c-09f8-4bda-a669-9d19d04ee7ca","year":2005},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.722762Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:6b91243e240be58dd865f0e1d7e6a126ebd3e69995d07e524289e5cf9b1c3d72","observation_id":"d3b74645-961b-405d-912f-c752a2ee7175","resolution":{"observed_at":"2026-08-11T15:14:12.552795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.522300Z","title":"Dynamic movement primitives in robotics: A tutorial survey,","venue":null,"work_id":"f28fa0a4-a783-49ea-be24-f0dea5dcb0b3","year":2021},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.728649Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:a97de8c3fb8cbbe76e18f5d009a71f3d840b452c0dc860c7a532a45f984861ef","observation_id":"40b77c70-914e-4bc8-a305-0d270a4b7e0d","resolution":{"observed_at":"2026-08-11T15:14:12.528297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.500694Z","title":"Optimal sampling-based motion planning under differential con- straints: the drift case with linear affine dynamics,","venue":null,"work_id":"3bce52f7-a629-4fa8-b6c4-d7d47340ee66","year":2015},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.736487Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:cd28e72cfab0d8ff2f29fa53a3b08cbe908696959e58d80857f2ca7429e0178c","observation_id":"227da17c-1282-44e9-8678-4ee9daf989d7","resolution":{"observed_at":"2026-08-11T15:14:12.508049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.472677Z","title":"Lqr-trees: Feedback motion planning on sparse randomized trees,","venue":null,"work_id":"fcb2cfeb-8669-4865-8233-705fcad65234","year":2009},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.742301Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:1afb1eac47e862a7aa3ea0c679e58c65d1b1a2d53f7f265fc68d002b0ce90fbd","observation_id":"ed32464f-16aa-46fa-babb-526e0f274d2a","resolution":{"observed_at":"2026-08-11T15:14:12.480387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.416512Z","title":"Funnel libraries for real-time robust feedback motion planning,","venue":null,"work_id":"649487c4-772b-48d3-aa4e-9f128149b24e","year":2017},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.749223Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:ef61b04437866d10ee93bef2d6e51993676dfd550e92974b5a4bd8dfad435bc6","observation_id":"032864e7-2911-4aa2-b30b-d8ae59e0d86c","resolution":{"observed_at":"2026-08-11T15:14:12.444913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.381485Z","title":"Optimal kinodynamic motion planning using incremental sampling-based meth- ods,","venue":null,"work_id":"7acaa1f5-7261-4f23-a7fe-337f61fdb7b5","year":2010},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.758579Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:c5cd4ac03220c949ec6263accb97ccc62032f77cfa8b636b35ee20cc5b2895e3","observation_id":"22a13945-b514-48f7-8d77-a493af4ede60","resolution":{"observed_at":"2026-08-11T15:14:12.395537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.352751Z","title":"Model-based reinforcement learning: A survey,","venue":null,"work_id":"2ea37e63-5ffe-42d0-928b-ed0430bbe08e","year":2023},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.763854Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:895355f42cddc163a266d6ba585d6efe75c11e16fcf26e0a860ce2500d6b2773","observation_id":"623d79b0-6697-4ccb-b68e-b34bdc5e459c","resolution":{"observed_at":"2026-08-11T15:14:12.364319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.324529Z","title":"Continuous upper confidence trees with polynomial exploration– consistency,","venue":null,"work_id":"12d53788-90f6-4d16-abc9-e16cb689a3f8","year":2013},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.769176Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:b0034aa738a519ada5a3c882ff893c75757ac4704b1b2f73a584796c1832e2f1","observation_id":"e51df170-193c-4a1e-b852-4e634fbbd82c","resolution":{"observed_at":"2026-08-11T15:14:12.331634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.292942Z","title":"Monte-carlo planning in large pomdps,","venue":null,"work_id":"b5731474-73d1-49d9-832f-673a7f844587","year":2010},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.774896Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:29bf74a33ba120b46e318500f9a32b05ff2f42499a670c262b63ec2a15537511","observation_id":"656afd06-ce13-4fd5-aad1-bd4b06888247","resolution":{"observed_at":"2026-08-11T15:14:12.303360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.272183Z","title":"Online algorithms for pomdps with continuous state, action, and observation spaces,","venue":null,"work_id":"65b156aa-0f7b-4086-8354-c3515c49af28","year":2018},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.780921Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:a5845692b4e24f8411907e5c4223d5447c9c742144dc615a3fce7e0076573668","observation_id":"506b392c-908f-432e-9934-c1ca4604a7ea","resolution":{"observed_at":"2026-08-11T15:14:12.277882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.246064Z","title":"Bayesian active sensing for fault estimation with belief space tree search,","venue":null,"work_id":"3be91750-4885-4dab-a6ed-61484c07880e","year":2023},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.788409Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:e8c05de9f285af2a94c7d77d552dc21df6018b270454f418a2681683aedc6c1a","observation_id":"1f7a5037-0c52-4b19-b0cf-057e3a34c86b","resolution":{"observed_at":"2026-08-11T15:14:12.252323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.210591Z","title":"Convergence of monte carlo tree search in simultaneous move games,","venue":null,"work_id":"ebb0a07e-41da-4754-bb90-c03d7c4d861e","year":2013},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.794952Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:4b51115ad04112dd2607061b634d08912f855061c5aeff9c51ba8bcb05f9d1bc","observation_id":"ed1ada66-032a-4561-8183-12b07452aa5e","resolution":{"observed_at":"2026-08-11T15:14:12.221000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.171583Z","title":"Cross-entropy motion planning,","venue":null,"work_id":"7db32c08-92d4-4f29-a541-3abed3dd5d28","year":2012},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.801038Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:0b7cb765d679b5bd0d2d2325e02fc12367d3ceaf0654aae5079369fbe50a87c5","observation_id":"8be28840-cadd-4eb6-bbbc-785f671fe3f6","resolution":{"observed_at":"2026-08-11T15:14:12.178979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.139013Z","title":"Aggressive driving with model predictive path integral control,","venue":null,"work_id":"cddffe2d-69e8-4000-81ab-78d2de491379","year":2016},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.806722Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:6cee6db53e7d44468c3ea4956960bb9f1693d5b86a7735b0fea336c101854b97","observation_id":"fe83d59d-4a82-4c03-9799-d844b427969e","resolution":{"observed_at":"2026-08-11T15:14:12.151748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.114827Z","title":"Storm: An integrated framework for fast joint-space model-predictive control for reactive manipulation,","venue":null,"work_id":"01094f36-e8c2-400b-ae7d-dbebc06e38af","year":2022},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.814676Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:516a67ac848a669b9b1d603913f0b47ca9b199819c557353893dea7a56a0b60c","observation_id":"9173e5db-cbd1-45af-98fe-f413240aa6e6","resolution":{"observed_at":"2026-08-11T15:14:12.123716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09105","last_updated":"2025-01-21T09:41:04Z","snapshot_observed_at":"2026-08-13T10:53:34.534953Z","submitted_at":"2023-07-18T09:54:01Z","title":"Sampling-based Model Predictive Control Leveraging Parallelizable Physics Simulations","version":3},"cited_work":{"arxiv_id":"2307.09105","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.09105","snapshot_observed_at":"2026-08-11T15:14:10.412440Z","title":"Sampling-based Model Predictive Control Leveraging Parallelizable Physics Simulations","venue":"cs.RO","work_id":"b0295f64-ff44-4765-bc62-3b4a20b1106a","year":2023},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.823302Z"},"links":{"cited_paper":"/paper/2307.09105","citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:7321654382e57793b8c56c0103764f12c3d4da5b71b8704c8e4730884d27c848","observation_id":"b6829216-9b50-44e4-bf21-4c62f5053dfb","resolution":{"observed_at":"2026-08-11T15:14:10.422859Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.081629Z","title":"Despot-alpha: Online pomdp planning with large state and observation spaces.,","venue":null,"work_id":"44905223-3bf4-4740-bed6-43ed6ba9583f","year":2019},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.829662Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:1858a7577ed45283b3c4aac52217676e7520019d707ccd03f4eb5233d8659670","observation_id":"0ad562d0-be56-4380-acae-5725e353e3cb","resolution":{"observed_at":"2026-08-11T15:14:12.093397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.058848Z","title":"Trajectory optimization of chance-constrained nonlinear stochastic systems for motion planning under uncertainty,","venue":null,"work_id":"3d7025fe-d708-4aee-8c9c-fad178a2455c","year":2022},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.835322Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:e9b87c837cd4d14a00a9a55fa10a13f40aff14c68d0293b1852b750e791f3936","observation_id":"156f76d8-7726-48bf-ad88-d8908b0214c2","resolution":{"observed_at":"2026-08-11T15:14:12.065973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:12.028799Z","title":"Planning by incremental dynamic programming,","venue":null,"work_id":"b4f01ac1-500a-4c48-9a86-949f79317750","year":1991},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.841070Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:f0bb3ff1d51263636680a2b2d3952276b747b94fc16ceb1cd158e3cab5ca0e55","observation_id":"981ca985-0127-434c-9011-e36dda9d2203","resolution":{"observed_at":"2026-08-11T15:14:12.038507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.992775Z","title":"An optimal one-way multigrid algorithm for discrete-time stochastic control,","venue":null,"work_id":"5d26226d-d67b-4478-bb0a-99c6e373f101","year":1991},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.848113Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:69d16c8509b5afbfc94e0d4eab5b68f7bf53efa9a0a3ee2466168ffc5612da61","observation_id":"1583bf61-5590-4bf7-a222-c8cbe8a88eb8","resolution":{"observed_at":"2026-08-11T15:14:12.001258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.967566Z","title":"Variable resolution discretization in optimal control,","venue":null,"work_id":"9a3010ba-47ef-4511-ac5a-9b22914b4c75","year":2002},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.854907Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:866a1492c23391e28e1c66fd6b5a7bec20fac2fb24a9128939ed23b0636b2f2e","observation_id":"0550e732-be30-4e12-8d7b-8b57021336c7","resolution":{"observed_at":"2026-08-11T15:14:11.975617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.934235Z","title":"High-dimensional stochastic optimal control using continuous tensor decompositions,","venue":null,"work_id":"e6378e26-bf65-414a-8d18-8b785e34074c","year":2018},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.860494Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:882d2f7407e39f6ebb8d487c0a22451b57dc6461af0f163413d4cdb05bf141a1","observation_id":"b334dd2e-7e54-4e51-a7df-71ace0fa2408","resolution":{"observed_at":"2026-08-11T15:14:11.947771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:09.866131Z","title":"Survey of model-based reinforcement learning: Applications on robotics,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.866131Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:8885cc1a1890ee53e877c68b965e67cbe1243384b1c5d949e32d59d2749fb23f","observation_id":"e258420a-d66f-4fda-a139-0462bf38d879","resolution":{"observed_at":"2026-08-11T15:14:09.866131Z","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-11T15:14:11.882075Z","title":"Deep reinforcement learning: A brief survey,","venue":null,"work_id":"c3599b3e-cb31-4185-bcbd-ecc9300f456e","year":2017},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.873053Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:b6755c797369b4fde650d3ebc80d4264a21d4d4faad8552ab14c072e2a730fd0","observation_id":"4c7218c4-9029-480d-97dd-8cf418c4d13a","resolution":{"observed_at":"2026-08-11T15:14:11.889115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-15T20:26:32.102285Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-11T15:14:09.879080Z","title":"Proximal policy optimization algorithms,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.879080Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:fdb63b6bc608bc7d545cbf99fa2e4391edb418bcb1ff60e8f66e82ea9b2170f5","observation_id":"cbdbe555-3098-4354-9eb3-589bae2d53f2","resolution":{"observed_at":"2026-08-11T15:14:09.879080Z","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-11T15:14:11.851350Z","title":"Global convergence of policy gradient methods for the linear quadratic regulator,","venue":null,"work_id":"1cd6bebd-62c9-454f-abde-0c82e4677665","year":2018},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.885043Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:20884cad36e48699ca1c14a088bfb9489a694ccdf6badc6ccc2e71b474028470","observation_id":"c81f583e-df5b-4b4a-ae06-97d019416dca","resolution":{"observed_at":"2026-08-11T15:14:11.865638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.807322Z","title":"Global convergence of policy gradient methods to (almost) locally optimal policies,","venue":null,"work_id":"eba6ee56-77bc-42ef-8875-fec53d9bafd0","year":2020},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.890595Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:df6913601fadfaf4a3666b4e65f7e89c115b7db98ec65eac68b898a62c731059","observation_id":"bf0d40f9-3c73-400a-9bc2-26187158da78","resolution":{"observed_at":"2026-08-11T15:14:11.819736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.778823Z","title":"Global optimality guarantees for policy gradient methods,","venue":null,"work_id":"721d5d95-c107-4f43-b30d-1d5820412b25","year":2024},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.898906Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:366200f8bdc3a5a9ad6f4480da132896b215b1e3268feff306dea35a19b57cd8","observation_id":"1cccf5d4-34d0-45a8-a578-91a1a2fe31a5","resolution":{"observed_at":"2026-08-11T15:14:11.785092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.756670Z","title":"Multimodal probabilistic model-based planning for human-robot interaction,","venue":null,"work_id":"d3082668-0458-4227-86db-4eed2461a7a8","year":2018},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.907022Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:dd37591d4644a2cfac9cf9118685de170e6bfdf13af0cd648b605f4bee090e99","observation_id":"6ce73b15-6aef-460b-ad82-db2720e8ddaa","resolution":{"observed_at":"2026-08-11T15:14:11.762645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.729586Z","title":"Monte carlo tree search in continuous spaces using voronoi optimistic optimization with regret bounds,","venue":null,"work_id":"b7f494e3-bb4b-425b-a65c-4472d7cf9f8f","year":2020},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.914537Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:b37d00d50a3eae73924add453a034230d32286ec2e655be5c65a435a83385661","observation_id":"1198ca1a-40a8-4df5-975a-4e9148126dc1","resolution":{"observed_at":"2026-08-11T15:14:11.738417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:09.923519Z","title":"Model predictive path integral control: From theory to parallel computation,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.923519Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:caea066c995dc62bbc0d63b21f1b954454abb9dc4a98769955dc3b8e6ce29ad9","observation_id":"783f88e9-fc45-490e-ae7e-f6c3680c02f4","resolution":{"observed_at":"2026-08-11T15:14:09.923519Z","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-11T15:14:11.681121Z","title":"Between mdps and semi-mdps: A framework for temporal abstraction in reinforcement learning,","venue":null,"work_id":"eccccbd3-010f-4c18-9a83-beb267901248","year":1999},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.929753Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:1ea830f7ca6fa4c293cc7c82edf272cd5d41f24d8a9c51717a6ce3e488710af9","observation_id":"d341149c-01a3-4e3a-94bd-715e73d88f91","resolution":{"observed_at":"2026-08-11T15:14:11.690526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.650304Z","title":"Magic: Learning macro-actions for online POMDP planning ,","venue":null,"work_id":"e685b637-549a-42d6-876f-805e148540fa","year":2021},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.937332Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:8054085058df6ca66d4166007aae9aa15ebfc48a6ebe43dfd219a625ad8a3c4e","observation_id":"872a9374-22e7-49a6-a3f7-51e2c9a6311c","resolution":{"observed_at":"2026-08-11T15:14:11.657777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.610812Z","title":"Markovian state and action abstractions for mdps via hierarchical MCTS,","venue":null,"work_id":"d6ea8d9d-5755-470d-914b-ee5ca2d3b04a","year":2016},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.943731Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:ae3c3e60858f18cf896eb3d92a7334619063835fefff70ac11cfb1f25d99a154","observation_id":"7beff911-dbbd-4269-b016-8e6d1fc33915","resolution":{"observed_at":"2026-08-11T15:14:11.618737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.582461Z","title":"Monte carlo tree search with options for general video game playing,","venue":null,"work_id":"d5011251-ed96-4d7a-b477-b97976df8f00","year":2016},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.951533Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:85dbfd112760ce29dd957b5a10cdf562d7f586f95f711adce2955d08050e8f1f","observation_id":"50667380-8510-49cb-a5a0-065e4e13a244","resolution":{"observed_at":"2026-08-11T15:14:11.590580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.20054","last_updated":"2024-02-26T05:17:25Z","snapshot_observed_at":"2026-08-13T05:37:05.548875Z","submitted_at":"2023-10-30T22:16:53Z","title":"Constrained Hierarchical Monte Carlo Belief-State Planning","version":2},"cited_work":{"arxiv_id":"2310.20054","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.20054","snapshot_observed_at":"2026-08-11T15:14:10.346677Z","title":"Constrained Hierarchical Monte Carlo Belief-State Planning","venue":"cs.AI","work_id":"c5c817c9-a207-47be-bee8-fb83f279f2ee","year":2023},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.958049Z"},"links":{"cited_paper":"/paper/2310.20054","citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:9123bc1770efd87c0c9c9125bbf770f33cb930b8af78abb24d084108704505bb","observation_id":"ebe08284-3b15-4d4d-a945-b0ce46afc685","resolution":{"observed_at":"2026-08-11T15:14:10.356241Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.556206Z","title":"Policy gradient methods for reinforcement learning with function approximation,","venue":null,"work_id":"8f528ed8-ebdb-4172-9f66-d1a5a8c0f2ca","year":1999},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.963850Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:12549bcba315192af962d906f9be0819979c5bc50638975e36a5f77fa5c33dc7","observation_id":"2f7681a8-1d0d-4476-b654-fe6021ba414a","resolution":{"observed_at":"2026-08-11T15:14:11.564555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.525442Z","title":"Pilco: A model-based and data-efficient approach to policy search,","venue":null,"work_id":"91455207-0c36-4791-9179-2b20e3eb30d2","year":2011},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.978413Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:fe40daf053dc98491aa2cdb6a92b63f59f12e23e2c0fbaebbd6d128ce790a1ae","observation_id":"9d5245d8-4b65-4972-951f-8a7f05b1ee0e","resolution":{"observed_at":"2026-08-11T15:14:11.537251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.478650Z","title":"Guided policy search,","venue":null,"work_id":"bd4cc873-060d-42ca-a8ee-4fc22fdee71f","year":2013},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.989393Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:7dc595755885476e6aa181ff986f0bb548ae659a983373d68845fba9dd4c9524","observation_id":"2677a7ca-c63a-4ec7-985a-a9f5e9e14226","resolution":{"observed_at":"2026-08-11T15:14:11.484139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.454275Z","title":"Glas: Global-to-local safe autonomy synthesis for multi-robot motion planning with end-to-end learning,","venue":null,"work_id":"43c7198d-0eae-4d32-90d6-aac226ca545f","year":2020},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.995865Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:f9e1962d1365c962f14f3f76a3ce2efd7c69b1c7bf3c54c06043302258895009","observation_id":"8daa83e2-e7cc-4469-9fa5-b1e17e4dd6b1","resolution":{"observed_at":"2026-08-11T15:14:11.460656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.420685Z","title":null,"venue":null,"work_id":"b3915bd9-3c1c-4a0a-ba76-39331798cf46","year":2014},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.002021Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:99f19840c4ef9ba39c8cf3a5e95ba3fb967c6c5959ae4b101ad14db5130a21eb","observation_id":"ade34d9d-41cc-4aeb-9cee-f0f4fbac233e","resolution":{"observed_at":"2026-08-11T15:14:11.428100Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.389058Z","title":"Non-asymptotic analysis of monte carlo tree search,","venue":null,"work_id":"e46c5a60-5fbd-4e9e-ad09-71bf5a58c2d5","year":2020},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.013793Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:6b09fb09a2d7cbb8f5e36f17acca4edff930cec05f6df8037e1410aa12ef3097","observation_id":"eb3ccfd2-92b3-4429-aa06-996eda102674","resolution":{"observed_at":"2026-08-11T15:14:11.401484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.352645Z","title":"Mastering the game of go without human knowledge,","venue":null,"work_id":"ab61711d-2b86-4b1d-a746-41b9d69e53e5","year":2017},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.027029Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:197e8989d6bf46d96e7a630205eca0d8946472d392e4a65bffed86c308318957","observation_id":"033ece6d-db7c-4f5c-ba1b-a7dca58663f5","resolution":{"observed_at":"2026-08-11T15:14:11.367295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.301971Z","title":null,"venue":null,"work_id":"d806c5c8-7bc0-4698-8176-5349262954e1","year":1994},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.038123Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:9a30a3ea6fa0ae99e4ba0e46fc7b31e665b6ca8bdc32edc1cf315137ecb8e415","observation_id":"0eab5a67-2d1e-4e60-9ede-869d2e920503","resolution":{"observed_at":"2026-08-11T15:14:11.310114Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.262879Z","title":"Zhou and J","venue":null,"work_id":"f8f1222c-8289-4e20-a6b6-65031daaaeb2","year":1998},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.043692Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:9d91c36b33a47a4f09cbcb50aa6eb63541755f37b61e218b8b2a80621ae169b7","observation_id":"496908b2-3306-4f14-92f5-ec5f3308a84a","resolution":{"observed_at":"2026-08-11T15:14:11.274908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.236374Z","title":"Neural tree expansion for multi-robot planning in non-cooperative environments,","venue":null,"work_id":"18852772-fa52-4386-8e50-c458b4caa003","year":2021},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.051253Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:4a5128fabba1787c32a41207042942e07acdcc4400b26d62bb5d2a32a9f9ad8f","observation_id":"3ec5e398-b4ff-4b31-9a26-474d21fd3919","resolution":{"observed_at":"2026-08-11T15:14:11.245450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.205760Z","title":"Online tree-based planning for active spacecraft fault estimation and collision avoidance,","venue":null,"work_id":"3be3b372-78c9-45a3-9b31-266b12425f7c","year":2024},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.059090Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:3301457bef6a4a3995405bb010688da17e005ab1935785fdea22fc1f6683de87","observation_id":"77cdea15-2a12-48a4-85b1-e1c8317a3957","resolution":{"observed_at":"2026-08-11T15:14:11.214924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.174486Z","title":"Neural-fly enables rapid learning for agile flight in strong winds,","venue":null,"work_id":"eeb0e42a-1f44-421c-af1d-a383b09790af","year":2022},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.065919Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:2f33c8ff021880f9ffe7345bde9a89d5a3d13b85948b48741be087e36f132ee0","observation_id":"d8908077-45d5-44b5-a251-c113d3d92bc4","resolution":{"observed_at":"2026-08-11T15:14:11.183061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.07193","last_updated":"2024-02-02T10:24:09Z","snapshot_observed_at":"2026-08-11T10:12:11.384939Z","submitted_at":"2023-04-14T15:12:19Z","title":"DINOv2: Learning Robust Visual Features without Supervision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.07193","snapshot_observed_at":"2026-08-11T15:14:10.071441Z","title":"Dinov2: Learning robust visual features without supervision,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.071441Z"},"links":{"cited_paper":"/paper/2304.07193","citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:8dc48dd2d54f3fe218fa98a29c291ede716267d7a4d23314e631a9d7ea54db34","observation_id":"61cb5476-61ab-4716-b369-657835532389","resolution":{"observed_at":"2026-08-11T15:14:10.071441Z","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-11T15:14:10.078127Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.078127Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:08ddddcfe62ef997604f70a6ad9baf16dcf1a65d010989bfe0a0561d85907aa4","observation_id":"a46b30f8-da87-45fc-891f-c36fd2aa9be6","resolution":{"observed_at":"2026-08-11T15:14:10.078127Z","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-11T15:14:11.131382Z","title":"Polynomial trajectory planning for aggressive quadrotor flight in dense indoor environments,","venue":null,"work_id":"a0e2fb49-b53f-4d4b-a755-e0056db52bae","year":2016},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.083427Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:5febdb49975b02907f01138f3fd1d5eef7fdb930a621cccd60e43d71e79476aa","observation_id":"0b804fb2-c4b5-41de-9196-1bae8d928b19","resolution":{"observed_at":"2026-08-11T15:14:11.137599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.102599Z","title":"Trajectory planning for quadrotor swarms,","venue":null,"work_id":"1542031c-977f-4a4f-9c12-6bbc3625595c","year":2018},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.089596Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:5537713167b2d82fb601622d0eda583863bb33997f8efe3e264c90357bc3955a","observation_id":"691f057c-1e03-4514-83c9-9d1acd1c1f73","resolution":{"observed_at":"2026-08-11T15:14:11.108589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.080712Z","title":"Optimal guidance and control with nonlinear dynamics using sequential convex programming,","venue":null,"work_id":"fde6397b-eac0-4905-9456-f99edb7203d3","year":2020},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.095302Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:5c1ee38451a51f81953f65264b74e5c8456b57a9c6a82bfc1fe9e17f8058e911","observation_id":"668bacf4-391c-4271-8ddf-9f8248f32200","resolution":{"observed_at":"2026-08-11T15:14:11.089527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.057153Z","title":"Magic-vfm meta adaptive control for ground vehicle with visual foundation models,","venue":null,"work_id":"2b50becb-9807-4fc4-8d42-c827e21afd94","year":2024},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.104090Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:d75163f6b52df2b5eb4e916e36abea57bc4c68dd0af7bfbeee03e0f37ec6d07c","observation_id":"3abc50e9-9491-4f08-aeac-a4bef6aff79c","resolution":{"observed_at":"2026-08-11T15:14:11.064335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T15:14:11.025975Z","title":null,"venue":null,"work_id":"63d7d94c-4dbf-4935-a17d-d486bbb3bfde","year":2005},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:10.113183Z"},"links":{"citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:a987dfa7b05630145f21c489d334bc7e622a857f83d482103a1219a39f204979","observation_id":"b822cf5a-d181-4be6-90fe-23821f16590e","resolution":{"observed_at":"2026-08-11T15:14:11.032606Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-13T11:09:13.173986Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":48,"verified_exact":2,"verified_fuzzy":49},"total_outbound_references":120},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 100 of 120 outbound references and 0 inbound Pith citation observations for arXiv:2412.11270."}