{"as_of":"2026-08-12T09:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:57e89aeba7b0a1d00d3023d4ca41525259859f541fad19ba44da59888e25b35e","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-12T06:34:41.77262+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-11T15:05:11.233260Z","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:d3b29eedcfc3f35d47438f6fd20b2f3cd03cb692eb3779f7f21f7f0c75c02f03","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-11T15:05:11.233260Z","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:3068d16db1605cf1ebccd67eb64b6c67d256e049eac01dd62d74761c13d08d76","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-11T15:05:11.233260Z","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:25d593e09d4c419f1e24039c5b7325917e62191c6e65a52d6910cc03897c0219","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-11T15:05:11.233260Z","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:44937c7c00cadbee44f95aeeb2cef443f343c611fb5a72a8d041f846b333c4c7","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-11T15:05:11.233260Z","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:804ed305a12d2c65e9d21efffb5b18f6e5cdfff45c056c3dcff6a30d226ecf8e","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-11T11:29:51.938219Z","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-11T15:05:11.233260Z","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:95669e26e45655001cc6f9a6d606d6108f59a7636e03183ed181191495cc4d1a","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-11T15:05:11.233260Z","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:4839704f917ff7eed93fef3b7cefcab6aadabb260eb6b1e12a3f4d984e5cc117","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-11T15:05:11.233260Z","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:ff5a62fab3b12e15956e40f66419de3709b24550ff95e8dc83653c3e9481b592","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-11T15:05:11.233260Z","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:d5ce6c6961b2088ed4c6a79470a0889ee1b47a393478bd7b4d2b70bc02aca01b","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-11T15:05:11.233260Z","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:ab1ee34a986d2ea41f19163853d7d23c0979cd0096bd182f836c18a9f8f1c6cf","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-11T15:05:11.233260Z","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:ad83ef11771b5f91c88039fc671e860def078794a9752477946f5f512fc6faeb","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-11T15:05:11.233260Z","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:40097b2c2af7f819d2ee02166842f5bcd53e80f524ab73e5d6b783b37a593961","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-11T15:05:11.233260Z","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:296bb11d30bb50aae5f2bef377da64d86f074ea32c82c934a4be9388dde205fd","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-11T15:05:11.233260Z","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:f91d65bf920772fa21805b8417cc47c66e24a78aa95a420a0f35abf47e424f7f","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-11T15:05:11.233260Z","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:a95045448559011e7fb0218e3a8eaf0b55392580bbb5a4fb4c4d586ebc593517","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-11T15:05:11.233260Z","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:d75000b1adee46f22dd89c6ddda7ba8f9d8b372b49b98b84a06cf4bc5ed82eac","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-11T15:05:11.233260Z","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:6d9996549ccc4f105e26c7b4a39c59c5eda26e122bcccd91b5afdb6d167ec934","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-11T15:05:11.233260Z","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:a397675a66acdf70505b7888e5971250a8cbc078a9f1c736487ccee0c4bdf55c","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-11T15:05:11.233260Z","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:42ea390cd636c872541501938b449d90f88b5afbbfc6322b8453576a4a48a9ab","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-11T15:05:11.233260Z","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:54696f383a7b4c2020ac98fc040fb41942facf8c1440b87eaa48d44a5d9c578a","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-11T15:05:11.233260Z","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:4aa9c5033ad28e5d3092193eded356485276a0e93b6716f60db15794cfa0fbbe","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-11T15:05:11.233260Z","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:8a6c440bfca9c7856ede747c4a872a3f93eaf3f1f2982fa4ec88df73bd021458","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-11T15:05:11.233260Z","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:b0149961e28b483cb23bfd0ff59c79050ed2216f7118d74a33fb6cb453819032","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-11T15:05:11.233260Z","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:1f25431c61b28a1f34a3e810685f39771eba9021dd5d9573ad7f84d2fa60db93","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-11T15:05:11.233260Z","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:4a949053f98b3b86725e3ead1b16a024e238bf08ce94ab465602064282cf6f36","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-11T15:05:11.233260Z","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:45c71d452137cf3b2a54a0064c62c586c60e94213eb413bd611943ba7ecf8b51","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-08T21:02:49.411549Z","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-11T15:05:11.233260Z","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:d75382bb7a5c8d9d5f2d51adceeabb5c753c503bc9a44cf17742385e45576d09","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-11T15:05:11.233260Z","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:25682b21fc80f0575a5ad99f5e3e99d3d3671e1f05a7991fbdb13078e25b417a","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-11T15:05:11.233260Z","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:d62bfcd6187dfff50671793c8ad16f6da3ba05fa2ffc9d89bf7051080d9ae528","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-11T15:05:11.233260Z","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:aee48340448540ee8cd61a74f8e6b134edbc1db5bf9b172e38d2a7ba225192ee","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-11T15:05:11.233260Z","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:fbb659af2094acc11baaa863f15be65b095040e92a0a7424465ddf9a81aaf869","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-11T15:05:11.233260Z","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:eb738c5fc77938bd446aa691f2803ad46d976c1dab9801cbd662224e0fe85906","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-11T15:05:11.233260Z","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:cd30879d6bcfc42980d3fe6a4551a60f573821e187588a248c6517eab835e040","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-11T15:05:11.233260Z","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:378b158c89b30a733aed64341ac23ee66a97fae2dcf520f61188473dd08c855b","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-11T15:05:11.233260Z","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:54aaee1d791cf6d01d6e8dda12a0dbcf81e8e0a7d485bb68a659fc02444c77a0","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-11T15:05:11.233260Z","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:d3e37b2b8c9c7373d58b19b6867fc9ff30634346b52f5b066a3a96e7c0cb8220","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-11T15:05:11.233260Z","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:a737dcdb0e98e78224472f89aeea47f1cbd78d6927d7ca57b89424b3d1db4dd8","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-11T15:05:11.233260Z","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:ef9131e94009ef4ab555a1d6a743144be42cbc0bb9b1a25fa599cc664852a8d1","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-11T15:05:11.233260Z","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:76f9699e4fb6d4b365f8825ed9ada42f13ac4249ac495b9a89b9e0bdb3055136","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-11T15:05:11.233260Z","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:03dae9d8246b1835e6d6622e51e6786b77af88ad8c1c495c430bef737e6b053f","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-11T15:05:11.233260Z","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:e973c86cd975b795045b31ad581aa1a1571eae9fad4e9f8122baa2cb16749c5b","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-11T15:05:11.233260Z","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:fd8811011c188a337f66d53e2cfcbf7dca07ba777ab93fe5202e7e31f9da10e7","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:9c3944090679af6198bda960a7b5cfd2068a936fd7c237993951d47cbc3315c5","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:31fb509eec043484d2393b31a383a583763a006e6fc0436675254f0646f42606","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:4fc638083af6049034f4b736ac7dea59eba03039a703e9e7b8da09f318e2fd2b","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:c720c4069be3857081c80066506d01d54a7955a4baaa91b23bfabf3de4fd89cc","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:741f15cbbf164985f3d29c4da967558f8a15dd2702d7f90ce7acb06ec2486dac","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:e0ae47f571b6766061b490d9543a6699fb2babe9fe0b7155a6aef38bf581731c","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:0c179e0df5e0be114beec7bce072e36deddb5767e1dfa85a6415d5298361ba54","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:ae659fe468c8c18ef69eec52f5f629c81b0f05455eb9242730f523cc47b3bf54","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:d83f249eb6f18955fe5b5769dc724ec761fc28b2c48ad980fa09acd74e8f3ecd","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:f517ec21fc40ddbefafcd0b2948b20f0605ab26be0b139b9fb3bdef5bf4a703c","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:add7d751f853bf0e4bff872f7f6d39a934bc5d8c1199f872df265ec6e35775cf","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:4ca87b20b9d49cdfef38ff52dfae6fc41fb3cc896d4859ffc299390e5fd20105","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:b233c97006a6d8231a316ec495a5339e59e428def7bb1e3729d8ef92e413a16f","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:97382aa5ec6b35af6e0793a284445fceaf435628198f3f29ab9572ab92e62b5e","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:cbe5c255743744a777b25df69d0bc1874181dcd71c365dcac16f109b948ea5da","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:54535553f05c76430ad641a14336e6581ee2463d632dc0595f1896e56ab34874","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:401565682ce9586e31f1f16156057a0b393c0f02b59aad663727f80851dcc66b","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:e1fc6831c4a671c77d034cfe0e60ba5c6e2444f1ba5d274ff5e22b177a1a5d17","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07-06T15:55:13.876017Z","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-11T15:05:11.233260Z","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:25dafcf78005d27fe0841b02f7df129f749539d9fa19fe34271aff117d23ff99","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:382eb535921b76068c12bdd8a4e2c160bd4e4870b6d69da181c86b8d01312d1a","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:9998978e80cf19caee06c5c5732a7b7810c07db8d805600ca9e28eb4dee68b20","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:f58822116140630f75b96e0e32b19837a75edb4db971a471e20155889cabc04c","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:a83563d91d1383f5664b97a2429fbde32199ece39e60cf9fee4d85e88a503c42","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:34bef25265f792ca28078b86528f7b8abbd5871959ce7cb72b55599986f8f3b9","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:30e22a3302065d9c3f9a620d3af127536da1c9cd7f080f50786018aa63ace7f7","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:f21d7478340b60b06cf6313b99c3e436234c683f2d5b1a94cf4fa71c0a2b6421","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-11T15:05:11.233260Z","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:5ccc1426d3d7a87f50fd3b3ea046341a647db926cb590894f98e1c40dd654290","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07-06T02:11:23.670680Z","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-11T15:05:11.233260Z","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:c2d12bf4f09ffd25b21973ccb7bd03102cd05be3f17dbf407cf15e5b27f7a8dd","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-11T15:05:11.233260Z","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:73bb61b5ddf079fb347fdb860502f5b29d8ea628f11c185d36d73689bcc312b0","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:3a46ab26d3d687dbb897d98c96e76b0c47ab1209eaca54893ffec710f530b91f","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:8297528a5fde0e34b22860322e52922aa999cdfaf514246a5fe4c2063b80d8f3","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:9ed0c0c15d3385ba04004e113d13ac8eb1d45ff2a44adcacc4ba165aa492dd71","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:66d58eb0d12cfc36ab977919a8e73cc8a0993a6f4aad3b20450dec55a0f6b4c2","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:8ee58c8c7b20f4e745e7c9dbd98c38702e550335b354c188d08822ff52df59c1","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-11T15:05:11.233260Z","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:595fc260d6cc78690d40edba04be488177adbfba242c22a528bff06a14eef65a","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:d7ff4b0d23d6ed3b581fda8c084b8af5d227120b03f2beff8177cb0f9ae0e3d8","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:ae42fabb89d47f9e453e4fc209f08722ac607cc912fcdc197e3bb8a687b8502a","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:36ae4de0c4250be3c32be36b3f6f52ed1f32f731285d293f0ae07d3b731cee9c","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07-06T16:40:51.343918Z","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-11T15:05:11.233260Z","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:345d86a6001adc64664fbc2334affce9a6266c7d2b41667b68391680a2432f15","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:c83030e3385f760c153bb0cdf477cfdcc821aec771f7cf6793f4b7afd1345290","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:b8eb1a04a0f19dc0e426a11f59ae15162e0ffebf0fb4e427d77e5b4c56a1abf6","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:12d826113f602a7955bcedadf2e99130192379fd25fa85ee4e3c3cc583b98c09","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:98344d496be525ba5370e745af1ce023c7077727047ee6ccb1667e8b6d42a38f","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:9ca01ed17616737645f66c42e8f8bcc4032a43c44fa3455cd1cea26bbad2a8af","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:ba2e5346a509cc4feafac8752f849e4a9d6e9c01f39c64c06909fa37d0d4cfdd","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:730c60f32b0a27219331177800ad3a1baaf702b74a8629ff50bc30122359665f","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:6abba8f177f6fc246f6ba3655c2936c5d3b8d9c29d9ad82a57d14aba1a3798f6","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:cf71c8680cc723244fb4fa77218db2e9ed1f9ec9fe9c1f5302fca755d8e23037","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:1aea55571f993e60e71c3083ce720205a20bc2dbf406ff9bdaf05ddd14f55a9f","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:4a3962af05d8e8edde8b54334b20b96667eef78f260b324e9a86e21b09a5022a","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:da9f3f0a7b64d0c53ef04b068b19a487935d176bdee47d97ade1ba3ed9f2ba7a","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:aec1293bc7db930f51413a681ca5d1e58b2fc274725d64e621d9b98380f0fe55","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-11T15:05:11.233260Z","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:93d7ec2c426a5fd4a1dfe8ae80fc6622dc1d4643f49288bcb9a20a6489138a82","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-11T15:05:11.233260Z","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:8c93abc7b1941087e1d516adfa8ded0144450eeea1cb8ccfde0bb62ade127bf0","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:60fb6e921c980f27758d0632799cfe0b664326e2f1096e72f7d4dc99d4582c1e","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:1678e7c705a1323d851f4cf72c79b236075bd158e831a993faf6c008f830874f","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:7c210693c5b218d67681b649edfac96e4eab130890dd4a5a60dbb72bafac7554","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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:cd676b2db783f1b7aa85d6581ff4615d1e71b1ab39aca3f25080cdc85cb2c6fe","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T15:05:11.233260Z","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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 100 of 120 outbound references and 0 inbound Pith citation observations for arXiv:2412.11270."}