{"as_of":"2026-08-13T02:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:08be85686ce25428b687eb6b42430d38b5b1a1a6caa5a6050d6d536f0e925954","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:12:44.625712Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"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/2411.15651/citation-record","integrity":"/paper/2411.15651/integrity","json":"/paper/2411.15651/citation-record.json","paper":"/paper/2411.15651"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:12:45.146943Z","title":"Improved monte-carlo search,","venue":null,"work_id":"b51064ee-0f15-4c2e-9d62-600ae4b3ab29","year":2006},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.495773Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:ea638df31af5c23dfa15037f9e5c6bec9ae54e4f9fa2d91916ee7ee1724114b7","observation_id":"32b9da43-8aef-4f3e-94ae-ec15a1d17548","resolution":{"observed_at":"2026-08-12T14:12:45.153245Z","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-12T14:12:44.502634Z","title":"Rapidly-exploring random trees: A new tool for path planning,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.502634Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:5639bee98d5484ef3dcceb946c8076167aea62ef66444a506ca65ab11e222804","observation_id":"e6a0f6f7-7a71-492b-a01a-c04de413db05","resolution":{"observed_at":"2026-08-12T14:12:44.502634Z","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-12T14:12:44.508279Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.508279Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:1b7a5fe1c98d5dcb6b15fba70be5073057d39921a73b4761434a81bec0e8ec5c","observation_id":"90ef4d3d-3b61-433d-b291-3f67617e5333","resolution":{"observed_at":"2026-08-12T14:12:44.508279Z","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-12T14:12:45.091873Z","title":"Rrtx: Asymptotically optimal single-query sampling-based motion planning with quick replanning,","venue":null,"work_id":"bc97dce9-8173-4867-b226-ef0e10186656","year":2016},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.514000Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:69537b777d725b1422301662e0f615710f1232c605182de606c1dac6a8b404c2","observation_id":"8ee6e7f5-d4c8-4330-a979-084060434040","resolution":{"observed_at":"2026-08-12T14:12:45.097619Z","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-12T14:12:45.072004Z","title":"Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":"40f8c8ac-0ae1-4f54-a568-9bf1a22525a3","year":1996},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.518946Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:a5c923502a5573583e722050d64bce1697007ad61ad826b26b0c276653593d8f","observation_id":"15f9a212-e5ea-4015-b315-6b71e0c159b3","resolution":{"observed_at":"2026-08-12T14:12:45.078402Z","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-12T14:12:45.046631Z","title":"Sparse methods for effi- cient asymptotically optimal kinodynamic planning,","venue":null,"work_id":"9ff40783-edf7-4dec-b46f-f0ff2bee37a2","year":2015},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.524252Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:83b7a01f69324dc4a44ef8e7d9f025f0b7f807131adf0d36066e7062f55afcba","observation_id":"fab9a523-7d23-40cc-ab52-c3a8f4ea94df","resolution":{"observed_at":"2026-08-12T14:12:45.056497Z","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-12T14:12:45.026111Z","title":"Monte-carlo tree search for efficient visually guided rearrangement planning,","venue":null,"work_id":"05685816-a0d2-433c-90e7-d9d9729ece75","year":2020},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.530079Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:bf5ddc72811e372b371c85b7bb6c705f1ecc0845608182a35fb90057c1b46f83","observation_id":"6063d67f-75eb-4f20-ba03-47c893ed1571","resolution":{"observed_at":"2026-08-12T14:12:45.032152Z","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-12T14:12:44.999568Z","title":"Neural tree expansion for multi-robot planning in non-cooperative environments,","venue":null,"work_id":"a62ff258-f305-4225-adcf-bff804da4e87","year":2021},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.534856Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:1dcbb39d83fb29b4c49f036bcf6304c31f81ef57269d16c9bfb0594de0d457a6","observation_id":"636e2394-590f-464a-8b04-3531f51cbaa8","resolution":{"observed_at":"2026-08-12T14:12:45.008403Z","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-12T14:12:44.980559Z","title":"Bayesian active sensing for fault estimation with belief space tree search,","venue":null,"work_id":"bdd9afce-5738-469b-a515-0aa13968d94e","year":2023},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.539604Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:7114b4209f237f9eb50b299d02b29694c1313ad129d9924c96f02b18f2dfbe13","observation_id":"077524a5-8a99-410f-8b4c-02c030be4317","resolution":{"observed_at":"2026-08-12T14:12:44.986444Z","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-12T14:12:44.959437Z","title":"Cross-entropy motion planning,","venue":null,"work_id":"9834af5e-5357-43d7-aa6c-4fcf4ffe28a7","year":2012},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.544402Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:baf3200e223e4fb126f41a3b54469823ef5c7404fb2bc567b78f2b74e94d71d6","observation_id":"48bbd800-5b5d-42bb-932f-24db4f9923dc","resolution":{"observed_at":"2026-08-12T14:12:44.967005Z","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-12T14:12:44.940613Z","title":"Aggressive driving with model predictive path integral control,","venue":null,"work_id":"1e760669-3165-43c7-8aa1-542fe2164210","year":2016},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.549475Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:5991a276e04afc80f3cadef6a372ca61a9db4c4cff2f57e010e6aea4481a5aa1","observation_id":"86046ad9-afaa-4ff6-a94c-789d9c047146","resolution":{"observed_at":"2026-08-12T14:12:44.946179Z","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-12T14:12:44.921170Z","title":"Real-time optimization and nonlinear model predic- tive control of processes governed by differential-algebraic equations,","venue":null,"work_id":"b532339b-aa9f-4705-94c6-a7c2eacd3bf7","year":2002},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.554374Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:360412615a4c201cd4c3535c0e264390dfd21920956b01ccaa8483e087b76769","observation_id":"98d4758e-1ee8-4609-94d3-717998537e8a","resolution":{"observed_at":"2026-08-12T14:12:44.926157Z","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-12T14:12:44.904014Z","title":"Receding-horizon planning using recursive monte carlo tree search with sparse action sampling for continuous state and action spaces,","venue":null,"work_id":"abf8deaf-4284-44a1-b105-b5ce219cf17e","year":2016},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.558878Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:71cbac6c85c8cd8fb942cce04f4e5dd104a59c8dd26b19b2f58a75d660adfa6c","observation_id":"b231c0e6-00e3-43d2-8d1f-eb3975d26fb6","resolution":{"observed_at":"2026-08-12T14:12:44.909911Z","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-12T14:12:44.563725Z","title":"Global planning for contact-rich manipulation via local smoothing of quasi-dynamic contact models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.563725Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:bb824a9e58f98fba01704ab2eed9a2bec1e35848b6152f0c090ffcde3f31b724","observation_id":"3d2aef31-21d4-40db-baaa-3f65efee4424","resolution":{"observed_at":"2026-08-12T14:12:44.563725Z","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-12T14:12:44.869724Z","title":"Linear time-varying MPC for nonprehensile object manipulation with a nonholonomic mobile robot,","venue":null,"work_id":"5e6a6931-f8f0-4b39-b711-8b2111dcd326","year":2020},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.569087Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:f75ed1491018d0c4a68340306fffabeac2c9531231ddae6da260610c32d609c7","observation_id":"4664bedf-7904-4534-9678-ed8b25e00a76","resolution":{"observed_at":"2026-08-12T14:12:44.875266Z","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-12T14:12:44.845888Z","title":"A motion planning approach for nonprehensile manipulation and locomotion tasks of a legged robot,","venue":null,"work_id":"b86054b3-11b1-4702-915e-b5383903a02d","year":2020},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.573917Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:820aa4569baf8a9b6217645d965120b2b886cc6f51426232930af5b2e412e226","observation_id":"5e8e2501-af06-463b-8a0d-2b4689050d5b","resolution":{"observed_at":"2026-08-12T14:12:44.852479Z","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-12T14:12:44.827025Z","title":"Non-prehensile object transportation via model predictive non-sliding manipulation control,","venue":null,"work_id":"51360b54-bf68-4142-9354-0f090ac4529c","year":2023},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.579533Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:2f38c94f320bc3450e8ae46cb9bdbb90886a6e6b1a63fcf975d8daf288783e0d","observation_id":"4f3ac237-6546-4b23-b777-1356098d4395","resolution":{"observed_at":"2026-08-12T14:12:44.833416Z","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-12T14:12:44.806344Z","title":"Rear- rangement with nonprehensile manipulation using deep reinforcement learning,","venue":null,"work_id":"f70f1cd7-d20e-4f36-96f6-f2a8fd0c0ba6","year":2018},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.584201Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:4006db20cf9e16a3b9cb99b4112450c7d6729e210124efd0f635ef3700363fec","observation_id":"a21e53af-5566-4e25-ba96-12dc33423f5c","resolution":{"observed_at":"2026-08-12T14:12:44.813346Z","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-12T14:12:44.788642Z","title":null,"venue":null,"work_id":"1e998ec1-1da6-408e-9af2-a7afa631a262","year":1996},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.591364Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:f46fd21c778571551eb4510437120ed25ec4fe8e94fa172ff64019d5be52245f","observation_id":"fb63e248-70de-4aa5-8c30-59410509e0c4","resolution":{"observed_at":"2026-08-12T14:12:44.793935Z","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-12T14:12:44.768153Z","title":null,"venue":null,"work_id":"9244a74e-715b-4a85-8904-c8f5179a844c","year":1991},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.598560Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:1d4aebee1e6b78c645e383a1af65a56b0f0f6b19dc5b27e56122868a8da9b854","observation_id":"da5806c5-d338-4abf-b187-cf6ca28b2e71","resolution":{"observed_at":"2026-08-12T14:12:44.774401Z","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-12T14:12:44.748540Z","title":"Safe active dynamics learning and control: A sequential exploration–exploitation framework,","venue":null,"work_id":"073698cc-64d6-47fb-ac5a-d4ad7afa644d","year":2022},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.603561Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:b09752506b5d28f27972212581185bd0794457cbb9922da89c74d73e1196b78d","observation_id":"a53da961-0284-439f-a751-8976eeaf2089","resolution":{"observed_at":"2026-08-12T14:12:44.755164Z","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-12T14:12:44.730028Z","title":"Robust online motion planning via contraction theory and convex optimization,","venue":null,"work_id":"e0ca3114-3d0a-4e66-a143-bc300695b3d4","year":2017},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.609912Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:79851cbfe790e639184e410d7187f844af8af70a97cdf20da2634799e569c21d","observation_id":"45347517-3dfd-4f4a-a767-50d5288931ad","resolution":{"observed_at":"2026-08-12T14:12:44.736142Z","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-12T14:12:44.709616Z","title":"Learning-based robust motion plan- ning with guaranteed stability: A contraction theory approach,","venue":null,"work_id":"56a5b506-f98a-47bc-9953-5c1c4e724c60","year":2021},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.615460Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:c8ab5517d08b20e5a72715efa2bd44a2ac6832f4382e3168de7b71e8038f3a36","observation_id":"98bf4be5-4a05-475d-b105-cb253005b295","resolution":{"observed_at":"2026-08-12T14:12:44.715770Z","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-12T14:12:44.684922Z","title":"Contraction theory for nonlinear stability analysis and learning-based control: A tutorial overview,","venue":null,"work_id":"94cbc089-6851-4465-97a6-fab0c0493b79","year":2021},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.620460Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:0c3b7a788090233a5849f2d14a1637ef9369b3b7dcc96b3f7a13d2959a9231e5","observation_id":"728939c3-131a-4aed-ae15-9c9776632dd0","resolution":{"observed_at":"2026-08-12T14:12:44.692012Z","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-12T14:12:44.662127Z","title":"Existence condition on solutions to the algebraic riccati equation,","venue":null,"work_id":"0e80d71b-357b-49de-b66f-c69aa7a8b7bc","year":2008},"citing_paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T14:12:44.625712Z"},"links":{"citing_paper":"/paper/2411.15651"},"observation_digest":"sha256:8ad35859f64857fc96717f05487f5dc51fbe75e090c4f9e8eb4c379976b292ee","observation_id":"6e9cd2b5-493b-4e9a-8775-f71ea6b078be","resolution":{"observed_at":"2026-08-12T14:12:44.670479Z","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"}}],"paper":{"arxiv_id":"2411.15651","last_updated":"2024-11-23T21:06:26Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-12T14:01:50.982460Z","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":20},"total_outbound_references":25},"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 13 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2411.15651."}