{"as_of":"2026-08-23T04:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb11fc244ecbb89c452a3d424aead30532a6af8aad7679a48bc4d9eadbca14f6","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:45:53.004852Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.04949/citation-record","integrity":"/paper/2507.04949/integrity","json":"/paper/2507.04949/citation-record.json","paper":"/paper/2507.04949"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:46.995423Z","title":"Thinking fast and slow with deep learning and tree search","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:46.995423Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:4215ba8aef10ba5556bcb4b76227505aa191c163f9e53f2a33d067ce1553402c","observation_id":"444d83eb-aa8e-4b86-9f1e-65e1873f8300","resolution":{"observed_at":"2026-08-06T19:45:46.995423Z","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-06T19:45:54.659215Z","title":"A survey of monte carlo tree search methods","venue":null,"work_id":"c5922e5d-fb15-46df-82a5-7f4965ec4948","year":2012},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.115908Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:609128186432c16fae9ebab81b5cab4d77e8538a9878458c102583cd57700641","observation_id":"c0bd8eb3-85d9-4c97-b227-40fee19e02d1","resolution":{"observed_at":"2026-08-06T19:45:54.664941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.641223Z","title":"Parallel monte-carlo tree search","venue":null,"work_id":"f229053c-664a-42fe-8dce-9f38a71e958f","year":2008},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.199454Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:2060025770c89bc9db8d061a924b3eb7693854cc4984eee8280c8fbaaa62dbcd","observation_id":"e6335dbb-b946-4391-8942-50cb43e22c73","resolution":{"observed_at":"2026-08-06T19:45:54.646535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.621416Z","title":"Enhancing dexterity in robotic manipulation via hierarchical contact exploration","venue":null,"work_id":"1eb193eb-e294-46ca-9cba-0ef53273d9f6","year":2023},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.298782Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:eb57b1913407bcb0cb9f5b91e55875a527d914fd9131cb9a48244639c22a7987","observation_id":"5d2eb40f-af31-46a0-a3a4-a03b7a05464f","resolution":{"observed_at":"2026-08-06T19:45:54.627898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.603325Z","title":"Principles of robot motion: theory, algorithms, and implementations","venue":null,"work_id":"5b067baf-299a-4021-97a5-b9899e8e5778","year":2005},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.374179Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:433076f5d4865dd1b46325322925cca90283bf2a3fcb0da7f01fe7e74275c3ba","observation_id":"b0898927-a243-40bd-b647-2b544d5bcb1b","resolution":{"observed_at":"2026-08-06T19:45:54.608635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.579967Z","title":null,"venue":null,"work_id":"375907b6-d77e-40b6-8b11-14ccf9a4622c","year":2016},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.471888Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:a91e6d846ce3ad4c23bb0217a8119f811b5d263b25367bf360fcd152eee092c9","observation_id":"8397133e-6c20-4b40-a379-d6754fda1c81","resolution":{"observed_at":"2026-08-06T19:45:54.585196Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:47.573749Z","title":"Efficient selectivity and backup operators in monte-carlo tree search","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.573749Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:9535cc8ec314757ce102d6e277fdc3ef8e6fe750628ea42d0869b846b1d9096c","observation_id":"4fdcef96-609b-4c58-936e-cb153a1386c7","resolution":{"observed_at":"2026-08-06T19:45:47.573749Z","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-06T19:45:54.541775Z","title":"Computing large convex regions of obstacle-free space through semidefinite programming","venue":null,"work_id":"b4940d09-bb63-464e-bef2-cc2457e8443a","year":2015},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.627403Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:d87087e914d7b1f855aebf389db78d8fea208070376f567bfd871889f833aa48","observation_id":"8f865e00-0fcc-48c0-9356-66020df1af2a","resolution":{"observed_at":"2026-08-06T19:45:54.549385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.518959Z","title":"Data-driven tensor train gradient cross approximation for hamilton--jacobi--bellman equations","venue":null,"work_id":"4453debc-5cd5-4d69-8e4d-8637b4724a75","year":2023},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.672343Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:2143574707d50f7f3773c12ddec8d2b04f4ff00f632f88a4115ee42bbcc2bb13","observation_id":"c30caced-c24b-42f1-b5be-ddbfc87fc7c6","resolution":{"observed_at":"2026-08-06T19:45:54.525138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.485738Z","title":"Fast solution of parabolic problems in the tensor train/quantized tensor train format with initial application to the fokker--planck equation","venue":null,"work_id":"29484078-4cc2-4224-b3d8-7259f60ccff8","year":2012},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.722905Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:efed6817e014d426e623aa3e0a493515bdeebb87813e8ef49d529dddd19d0665","observation_id":"c5f8f942-fa35-4647-88dc-552f5a95516c","resolution":{"observed_at":"2026-08-06T19:45:54.492533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.461655Z","title":"Hybrid differential dynamic programming for planar manipulation primitives","venue":null,"work_id":"4ea96638-3297-4e90-bea2-53e5a99eab1d","year":2020},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.781588Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:03099e96f509acdca34d7e3ef7d53e67f4746fdfebf79f98fc50b7c002d84e3b","observation_id":"63f7716f-29e1-44ad-99ca-51557ca73b4a","resolution":{"observed_at":"2026-08-06T19:45:54.468027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:47.830820Z","title":"Colloquium: Area laws for the entanglement entropy","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.830820Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:87b54c810879d4c974dbb578f39935881f356ecd85b119f72d51a83aa753b53e","observation_id":"fae472bb-e909-4c96-b518-6715d5aca12b","resolution":{"observed_at":"2026-08-06T19:45:47.830820Z","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-06T19:45:54.427640Z","title":"Batch informed trees (bit*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs","venue":null,"work_id":"ba41b654-86d5-4cd4-802d-f3f26aec32ad","year":2015},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.882186Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:03de634578e37404a2ea5205e5ac11cca39438c548794fc1a7948aada53fe175","observation_id":"7d91d140-d004-41f4-90f2-78dc7246a46b","resolution":{"observed_at":"2026-08-06T19:45:54.433995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:47.926646Z","title":"Integrated task and motion planning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.926646Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:9eae32cf70eabc2adf1fba1916393187996cf8980057a482b61db6dd5d6c87dd","observation_id":"a52b14b2-df2e-4ed4-8fb9-5e0755657165","resolution":{"observed_at":"2026-08-06T19:45:47.926646Z","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-06T19:45:54.395568Z","title":"Path planning and trajectory planning algorithms: A general overview","venue":null,"work_id":"55664c3b-cc18-4752-b39e-d6ebda502ba4","year":2015},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:47.977414Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:264196051b6cb5e5a19e41c80bc1d312a51194f73d87dd1941d0bed6f01d81f0","observation_id":"f41d2d93-3bb6-46dc-b062-096ddbfed6b4","resolution":{"observed_at":"2026-08-06T19:45:54.401971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.374241Z","title":"A complete generalized solution to the inverse kinematics of robots","venue":null,"work_id":"4598ff3a-949f-43f7-b6b6-0480b4de729d","year":2003},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.035236Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:cd1d72a2e12c95d40896ba88fbabd54b9a925b90379d7b6cb349e162319be18b","observation_id":"6746b3e4-b7a7-4c1c-8142-955d610465fc","resolution":{"observed_at":"2026-08-06T19:45:54.380306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.350007Z","title":"Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (cma-es)","venue":null,"work_id":"151baf86-1a0b-4376-9daa-fb6a4a28d3bf","year":2003},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.111362Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:600f11d52b0bc8400f9946521d249ba1e4e2715efdeb73fec0430b22181b21f8","observation_id":"a7eba938-a720-4ff9-a373-d58161559508","resolution":{"observed_at":"2026-08-06T19:45:54.360020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.325773Z","title":"explanatory","venue":null,"work_id":"6dd9903a-8057-42fc-bc8e-4dc12b8627a4","year":1970},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.191120Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:249730dcb13f893eaa8feb3eb4770cda48287a8e0d4b1a9ce0e1fe222d623db0","observation_id":"dd3123a1-ffe9-4b9e-b420-b8b3bbd69eca","resolution":{"observed_at":"2026-08-06T19:45:54.333861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.302622Z","title":"A formal basis for the heuristic determination of minimum cost paths","venue":null,"work_id":"86d3b482-cf5f-4ed4-84a3-57d3dde5d775","year":1968},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.269615Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:b8c31e15baa0246cbe0bf3e0fb2b8d23f25c44f8143d10f2c516d0958c85cf00","observation_id":"9977156f-c53e-4d11-81a4-42547babb8d9","resolution":{"observed_at":"2026-08-06T19:45:54.310360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.276789Z","title":"Robust planning for multi-stage forceful manipulation","venue":null,"work_id":"fcd630d2-0113-49c1-8669-11e484fba419","year":2024},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.328562Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:30c7d7194667dc7633f81567614c0ab2b94dd544b4626b104aabee7decf69a8c","observation_id":"e50476f2-1518-47a9-b845-f9602b7c6637","resolution":{"observed_at":"2026-08-06T19:45:54.284941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.255150Z","title":"Vp-sto: Via-point-based stochastic trajectory optimization for reactive robot behavior","venue":null,"work_id":"1fd16a8e-13d4-46da-8906-55a85472fd1f","year":2023},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.392470Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:691d281988281f600c60d7a914b3a55ef401b52979e7e70b738d97048911bb8f","observation_id":"f8dc4bf6-d345-4528-8292-f75029e1e7dd","resolution":{"observed_at":"2026-08-06T19:45:54.261679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.229641Z","title":"Sampling-based algorithms for optimal motion planning","venue":null,"work_id":"60d67f47-0c80-4d68-b6f9-5ca00da9ade9","year":2011},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.454145Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:7d98a3b672d62853946ff628108335204149846963195023209b44bc72d3829a","observation_id":"d03c1bc5-cd81-4adb-b464-00aa4c93bf8a","resolution":{"observed_at":"2026-08-06T19:45:54.236830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.194946Z","title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","venue":null,"work_id":"e1e9f469-bc06-41bc-b51e-160b5acb4208","year":1996},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.523721Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:9720705ab7f29982500171d31565dc25e073eecbd67787278c01235543877040","observation_id":"e3ed3a46-ee3c-4281-b2f7-6dcf7739323c","resolution":{"observed_at":"2026-08-06T19:45:54.207319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.173677Z","title":"Monte carlo tree search in continuous spaces using voronoi optimistic optimization with regret bounds","venue":null,"work_id":"f2459a95-cbd1-455d-a208-5ea187419b42","year":2020},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.582039Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:8418fd5bbb1d8d0fb97e1598d39c7aa12b2a09b235d5070852b99e3ef1002d94","observation_id":"df774bc6-f2a4-402d-8f73-cf88b7be3ff4","resolution":{"observed_at":"2026-08-06T19:45:54.180836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:48.637949Z","title":"Planning algorithms","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.637949Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:17c0f9ffd164455bbc3582af47d315ae363fb274f9f4d9541e3a6ffbf82b8b1a","observation_id":"7d7d5969-30ff-431f-b2ce-e9c84c9670ba","resolution":{"observed_at":"2026-08-06T19:45:48.637949Z","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-06T19:45:54.123202Z","title":"Memory of motion for warm-starting trajectory optimization","venue":null,"work_id":"5464f1c0-5761-4b72-9bef-c6e5321e57dd","year":2020},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.701502Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:3199147130c42653294d221dd43ce36394fc1f505999b7a94bdd2702b63097f9","observation_id":"21126900-dfdd-4827-8a0d-5a73a1ebecf8","resolution":{"observed_at":"2026-08-06T19:45:54.130583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.100577Z","title":"Iterative linear quadratic regulator design for nonlinear biological movement systems","venue":null,"work_id":"877dfd3f-f449-4321-a1f3-05f8fa5d5d22","year":2004},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.756188Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:a5d44269e65bc52fd754c4a682dd5384394d21dfcae18b46315309d13ceaf684","observation_id":"9da2cb0c-67f5-4c10-acc0-9cc9a90d62c9","resolution":{"observed_at":"2026-08-06T19:45:54.107416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.075165Z","title":"Gpu-accelerated robotic simulation for distributed reinforcement learning","venue":null,"work_id":"47e8bccd-135f-47eb-8f4b-e7e7abb3a91e","year":2018},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.815327Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:2ede1bd8db63853e23e62628f293139855c228f9d17c91691b52be09c7088d46","observation_id":"8c207c0f-1526-403c-8c8b-5c5345a5dcc2","resolution":{"observed_at":"2026-08-06T19:45:54.082199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.052664Z","title":"Undecidability and hardness in mixed-integer nonlinear programming","venue":null,"work_id":"c6960e17-2bd2-4333-8658-9a4e61f1e8f3","year":2019},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.867284Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:26c12ff3b29625ce06bb9af62b50bbf5fedaa7fdbae3a5f96df34af3345ca541","observation_id":"8557da91-78b1-4b1c-b277-33678f212afa","resolution":{"observed_at":"2026-08-06T19:45:54.058854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.034259Z","title":"Sampling-based path planning for uav collision avoidance","venue":null,"work_id":"6bb4f2cd-9fcc-4e94-9df3-8c29f77aa345","year":2017},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:48.961237Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:b73a6c28df9cd6df4e5d182e4ba3777ed220cfc165394ac1da3372f3baef2cce","observation_id":"f2437f47-4fab-4abc-93c6-e065cda4b64a","resolution":{"observed_at":"2026-08-06T19:45:54.040963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:54.012801Z","title":"Convex optimization for trajectory generation: A tutorial on generating dynamically feasible trajectories reliably and efficiently","venue":null,"work_id":"0cb6d05b-b8bb-4773-9bd0-f1f84a0f24ac","year":2022},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:49.067571Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:fb057c5885be05764926424045bbf415f5145fa6c3afc270fbd9c3a7ddb00a6c","observation_id":"e91c4eae-48b7-43ba-8939-b1715590e248","resolution":{"observed_at":"2026-08-06T19:45:54.019666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.990923Z","title":"Motion planning around obstacles with convex optimization","venue":null,"work_id":"71290439-d6d2-47d7-9eb8-fddf52eaf436","year":2023},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:49.100116Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:841c927c6d7f39c83adc74ef73757d8b1e1de41a10e6aa97b140f0f99b8be159","observation_id":"0b198df1-633a-443d-a31a-0aba40c52da8","resolution":{"observed_at":"2026-08-06T19:45:53.997302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.971297Z","title":"Shortest paths in graphs of convex sets","venue":null,"work_id":"9cd1d230-fd52-4f5f-b5c7-3bdc9fffaf60","year":2024},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:49.232588Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:21dd367357b0abf6d3f21105677c488fdfb0c7f6ae666ad825a9ca2a5601f176","observation_id":"d47eb76b-4259-439c-b6eb-0e9774966248","resolution":{"observed_at":"2026-08-06T19:45:53.978131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.950508Z","title":"Mechanics and planning of manipulator pushing operations","venue":null,"work_id":"e87f51dc-7bb2-4dd1-98f9-84fb647fe6a2","year":1986},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:49.296731Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:537dd3cc39901bf32d4476d52a5e9cd090d9a71b5caf005f23e34b6c07abc97a","observation_id":"0ee03a66-bada-441c-bd53-140925b79e42","resolution":{"observed_at":"2026-08-06T19:45:53.955990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.920621Z","title":"Progress in nonprehensile manipulation","venue":null,"work_id":"4ef5c29f-8e29-48b7-80ad-a1dafcc8bb32","year":1999},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:49.403760Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:d5711b8e6993786a636d71e6637c59bfcf9702e751b2527a00b7b96322ea7647","observation_id":"677acdfb-86fc-4968-8ed7-94f6da1349e7","resolution":{"observed_at":"2026-08-06T19:45:53.927085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.898559Z","title":"A second-order gradient method for determining optimal trajectories of non-linear discrete-time systems","venue":null,"work_id":"025e2a83-3553-4a44-b856-5c82cbb22444","year":1966},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:49.484536Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:b9d46b3dd8d7de4c6f8d4962feed42b809523182780ebce5c3cd0cfbd23f9d30","observation_id":"2e43d56d-7542-4003-8ab9-34903fce303e","resolution":{"observed_at":"2026-08-06T19:45:53.904629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.870321Z","title":"Non-prehensile planar manipulation via trajectory optimization with complementarity constraints","venue":null,"work_id":"4cbc536d-2d62-47ba-b60c-1f9a1f7cc5d1","year":2022},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:49.622208Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:2516bf820c37594d4335a9f9ca7abeab82a704676794538dca0aff2d9acf6b33","observation_id":"0bb8c40a-95b8-49a9-bcf4-d77717c1aacf","resolution":{"observed_at":"2026-08-06T19:45:53.879469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.840732Z","title":"Continuous-time gaussian process motion planning via probabilistic inference","venue":null,"work_id":"759bcf1c-2d79-4b26-9c27-89d9aef40da6","year":2018},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:49.729499Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:d133f68846b7785908d50d94afcbcf5e77503394aeefa1e54506c8084a648f05","observation_id":"852dee1c-5bc6-4874-9e22-db4efc8a6355","resolution":{"observed_at":"2026-08-06T19:45:53.850438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.815834Z","title":"Interleaving graph search and trajectory optimization for aggressive quadrotor flight","venue":null,"work_id":"c525224f-8b34-4a5b-8688-9e3b6a73426f","year":2021},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:49.985061Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:9893cecccf2b5f8c09b98fa182575a9c4aecc631ab9fc62f1e882ba4c30c766d","observation_id":"61eced6f-548f-4bf7-9aa3-974401991170","resolution":{"observed_at":"2026-08-06T19:45:53.822721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.788628Z","title":"Tensor-train density estimation","venue":null,"work_id":"f278f097-29c3-494e-be88-0d3d68a3d5c1","year":2021},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:50.373590Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:db91bd651aff055d3f58328a18a47aae7b4aaef1d7470640aa6616daa72472ab","observation_id":"567ad6b7-ede2-4d32-8e18-57c5aca90e4f","resolution":{"observed_at":"2026-08-06T19:45:53.794441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.754807Z","title":"TT -cross approximation for multidimensional arrays","venue":null,"work_id":"0fb71387-b080-429a-8ef4-39a941c184ee","year":2010},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:50.732606Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:3312b2c490aa0a995ba8a7466bd34a9c9bc7486a65a779c055b2a66ed4a6a9ec","observation_id":"c99b297b-4381-4ca4-b8a0-aba575277ef9","resolution":{"observed_at":"2026-08-06T19:45:53.764440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:51.548410Z","title":"Tensor-train decomposition","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:51.548410Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:5d9f1510aed7fb956ccfa379ec98c6badc4031d2e46a48d691ada06d72af5eb3","observation_id":"3c5df851-795e-4f26-8a4b-5c3c184b6412","resolution":{"observed_at":"2026-08-06T19:45:51.548410Z","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-06T19:45:53.690583Z","title":"Global planning for contact-rich manipulation via local smoothing of quasi-dynamic contact models","venue":null,"work_id":"84bada3b-87de-4b1b-aba4-43a7064f2c08","year":2023},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.199781Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:29ed2349319900dc971436fa2b7f46e7a4136945ea9f61bf6580493edb57ccd5","observation_id":"98e8f8a3-47cf-4fc3-95b8-b6c8ecfd659e","resolution":{"observed_at":"2026-08-06T19:45:53.710061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.667243Z","title":"A direct method for trajectory optimization of rigid bodies through contact","venue":null,"work_id":"34036cb6-71d2-4467-b1aa-ef09e5ef708b","year":2014},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.361588Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:1eece589b1ea7cec2694ad78358797e8c57b44c51218bd081581042aa721ff77","observation_id":"455e4f63-0725-4298-8162-3e19ff4d1846","resolution":{"observed_at":"2026-08-06T19:45:53.674116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.639558Z","title":"Chomp: Gradient optimization techniques for efficient motion planning","venue":null,"work_id":"4e8f1274-d272-41f1-a922-e21a3c1b8d3c","year":2009},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.399666Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:504105d880e11104c22bd84e6959f24bd95a69d37530b87daa09b300b8fc1ae4","observation_id":"1dd665c7-54b7-49b3-b9c1-6df8030fc84d","resolution":{"observed_at":"2026-08-06T19:45:53.645233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.614092Z","title":"Monte carlo tree search with spectral expansion for planning with dynamical systems","venue":null,"work_id":"09263879-eed2-466c-9c38-62b381588b24","year":2024},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.459320Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:770a5e92854b41fc98392d69664c01345f3593f7ca954d96dd9a741601b8bf13","observation_id":"3907921b-bdb8-4b56-ac5f-c3f350288dc3","resolution":{"observed_at":"2026-08-06T19:45:53.621801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.15245","last_updated":"2021-10-28T16:04:01Z","snapshot_observed_at":"2026-08-20T08:32:55.900097Z","submitted_at":"2021-10-28T16:04:01Z","title":"From Machine Learning to Robotics: Challenges and Opportunities for Embodied Intelligence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.15245","snapshot_observed_at":"2026-08-06T19:45:52.534958Z","title":"From machine learning to robotics: Challenges and opportunities for embodied intelligence","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.534958Z"},"links":{"cited_paper":"/paper/2110.15245","citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:037d8b6268163dea78c807f12844510882ddcc9f21299baef5952426ddf36c36","observation_id":"c80605fc-c556-4eba-bfd5-73ef270fdf5f","resolution":{"observed_at":"2026-08-06T19:45:52.534958Z","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-06T19:45:53.590483Z","title":"Asymptotically near-optimal rrt for fast, high-quality motion planning","venue":null,"work_id":"1b173c05-70f3-4cc1-a2ed-5654aa441df8","year":2016},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.595996Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:a77701f770121925023dfca59e253f34b518f5e98bc1fb0048e641ab503ac23f","observation_id":"e681a534-3089-4517-bb83-21d088f48f1d","resolution":{"observed_at":"2026-08-06T19:45:53.601401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.571150Z","title":"Savostyanov and Ivan V","venue":null,"work_id":"05ae9710-bf07-422e-831c-b1a9bb189cf1","year":2011},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.655136Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:def2897917b044ec04f825d67913241830356376b5fc78dbc91dc150f3876d87","observation_id":"9976f289-e528-47d0-9548-66fa7993ed98","resolution":{"observed_at":"2026-08-06T19:45:53.577609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.546720Z","title":"Motion planning with sequential convex optimization and convex collision checking","venue":null,"work_id":"b64c6f2b-399b-4ded-b24a-af63e6ec7523","year":2014},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.710495Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:a223da0b0e0fb41603c8d4221c280bbeb14cd369bd28de552d8f833fb0c5cffc","observation_id":"93ee8cad-53e3-4cf8-8110-9e60cdadd384","resolution":{"observed_at":"2026-08-06T19:45:53.557638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1177/02783649231217527","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Tensor train for global optimization problems in robotics","venue":"The International Journal of Robotics Research","work_id":"96977661-a2ef-4148-aef2-a98f7a0d0940","year":2024},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.744206Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:ba7c0059683bb22f6505d930e842492a5b42332f932c072e4a465de5ceb2d9b0","observation_id":"e6b81520-c10a-454f-8e83-c8989b6ab1c9","resolution":{"observed_at":"2026-08-06T19:45:53.065458Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:52.780348Z","title":"Mastering the game of go with deep neural networks and tree search","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.780348Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:9bfb4db851914ca31a81d0577766756ee42130d50242e22c0f0b68050206e97a","observation_id":"d7246450-7f9a-4745-830c-fe41ff50ac68","resolution":{"observed_at":"2026-08-06T19:45:52.780348Z","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-06T19:45:53.516173Z","title":"Lillicrap, Fan Hui, Laurent Sifre, George van den Driessche, Thore Graepel, and Demis Hassabis","venue":null,"work_id":"ef857be0-8ef5-4f51-bd35-fd5cbf40c52d","year":2017},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.874880Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:5124c1ad09c68f02ba4db479ea16b3886e55f82a25d7cec692eb89264f9af26f","observation_id":"e99de5c3-0f32-4c3b-995e-cd69aff02380","resolution":{"observed_at":"2026-08-06T19:45:53.521727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.490315Z","title":"Ttopt: A maximum volume quantized tensor train-based optimization and its application to reinforcement learning","venue":null,"work_id":"270a1c88-b14b-4903-80a6-757c8716da9a","year":2022},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.905149Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:99ecac002c1074001170a17742e6a15ff65617828b4d62707ecf961bfae36129","observation_id":"ab347a5d-a6a9-4602-b353-aed27b55417b","resolution":{"observed_at":"2026-08-06T19:45:53.497383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.471964Z","title":"Riemannian optimization for high-dimensional tensor completion","venue":null,"work_id":"a5435df1-5cf2-4dac-b176-62dc2b11bd2f","year":2016},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.911743Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:999e52ab4f10c3bea244893c2b00f5b0c909e6ba1e6f9423936a38d1e9a3c9bf","observation_id":"1c788579-c642-4077-8c67-52270d48376e","resolution":{"observed_at":"2026-08-06T19:45:53.477871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.451778Z","title":"Synthesis and stabilization of complex behaviors through online trajectory optimization","venue":null,"work_id":"b4eba80c-11e8-46d4-a717-1215fdae471e","year":2012},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.917239Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:13c76b9bbb0adb4c9de85f36630e70219e420d4bc03a14ee6430e598ceb12389","observation_id":"2390ca0e-8b2d-482a-973b-871e8fba096f","resolution":{"observed_at":"2026-08-06T19:45:53.460359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.426764Z","title":"Mujoco: A physics engine for model-based control","venue":null,"work_id":"9290876c-4c07-4ce4-aa65-e9ebcdb46dec","year":2012},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.923295Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:f84e98fc0a8d14c0a6fcd4d17f4ebe10314ca85023e9204942eaa9cc48ef494a","observation_id":"5ad60f28-7548-4c42-9dc6-a0205ff381c0","resolution":{"observed_at":"2026-08-06T19:45:53.436107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.404544Z","title":"Logic-geometric programming: an optimization-based approach to combined task and motion planning","venue":null,"work_id":"90e90fe7-79d3-4f7f-b889-544f17266753","year":1930},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.930720Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:ed694d1b04fe9c07b7b2561f4117970dc7905ed9751c2ddc6faf9e6152c8ed7f","observation_id":"b4ca6d8d-aa6b-4bf5-b68b-cf5647a62d87","resolution":{"observed_at":"2026-08-06T19:45:53.411091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.383300Z","title":"Implications of factor analysis of three-way matrices for measurement of change","venue":null,"work_id":"cc167f52-7f54-4410-94a8-5a68787c2a40","year":1963},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.936033Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:17e74b0688f9554b952d20db450f9dbbb8d655e3d7cc13e0cda584e32c3576ac","observation_id":"07f787ee-63d4-4956-b0b2-313452ff8037","resolution":{"observed_at":"2026-08-06T19:45:53.388894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.359562Z","title":"Constrained trajectory optimization for planetary entry via sequential convex programming","venue":null,"work_id":"366163b5-3d8b-43bf-a6fb-88bbc06e4e3d","year":2017},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.941945Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:2c3fec75e764a97b7c2b66ee032ecf1e81f0c21f8ed865380f13870f6493b318","observation_id":"be1a605a-e685-494c-be96-62e5b2edea82","resolution":{"observed_at":"2026-08-06T19:45:53.365680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.341259Z","title":"Demonstration-guided optimal control for long-term non-prehensile planar manipulation","venue":null,"work_id":"ee64c3bf-25e5-4a3a-b69e-569ace192bb5","year":2023},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.948395Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:80d73e8f1216f9e74f7af4cc90827630c5d21165baa7a9fdee082dcda06e4f20","observation_id":"b121474e-198d-42b6-a271-f33269c75489","resolution":{"observed_at":"2026-08-06T19:45:53.347787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.320638Z","title":"D-LGP : Dynamic logic-geometric program for reactive task and motion planning","venue":null,"work_id":"1115e80a-fff6-45a5-a9e8-5ad5f35c685d","year":2024},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.954127Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:b76d0c91ca9fb8e3b063bd477e1396d0b35a5e3f0a0ecd45d8d0692f74b0249e","observation_id":"f4515951-4867-4530-a850-22ab93e1c73a","resolution":{"observed_at":"2026-08-06T19:45:53.326985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.294882Z","title":"Robust manipulation primitive learning via domain contraction","venue":null,"work_id":"a8572515-ee2e-493c-9d41-82c4f8ec0d15","year":2024},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.960368Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:a5dc6dcb79dfe14248610c6671a85f69dd56a72dd3d3ef6c49dd21cee7f2d1ce","observation_id":"cca311ae-c831-4839-866f-54e630912395","resolution":{"observed_at":"2026-08-06T19:45:53.300898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.277704Z","title":"Logic-Skill Programming: An Optimization-based Approach to Sequential Skill Planning","venue":null,"work_id":"a31131c8-8eb2-41bc-8c40-7f86c59ca1bb","year":2024},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.965822Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:95cd3dc56063160661f0e8933e16ef4310ff6927b9a1c7067c0a19de8aabe0c1","observation_id":"380eaeab-ae3a-4066-a289-ae378eea7268","resolution":{"observed_at":"2026-08-06T19:45:53.283297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.253911Z","title":"Robust contact-rich manipulation through implicit motor adaptation","venue":null,"work_id":"989cc2eb-dc13-4cb7-a21a-655ea3056cf2","year":2025},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.971578Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:e0be97af35cd3ee1140cc0030536822c9cccbb2456c66f0f6c9f2db99ad2f920","observation_id":"98369e7e-b182-4cff-9b9d-512e66d3c2ab","resolution":{"observed_at":"2026-08-06T19:45:53.264286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.220882Z","title":"Genesis: A generative and universal physics engine for robotics and beyond, December 2024","venue":null,"work_id":"5852a0de-52e0-4a62-94d3-220cb51216a6","year":2024},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.978057Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:e24a88f8ce567566de931eae682de14b9058f535cdd0deb458d96550dc07960e","observation_id":"ff622f17-a190-4272-8a13-a3228c33b97f","resolution":{"observed_at":"2026-08-06T19:45:53.227882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:53.199801Z","title":"Efficient object manipulation planning with monte carlo tree search","venue":null,"work_id":"cc76b2b7-69e8-44b0-a891-245e85b013be","year":2023},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.983544Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:d694a6f09ff41074e98976b768afdac420316a43f2b4cb9fa5cdda82da772fe2","observation_id":"21fab52e-6663-46ee-a367-70b01bf90f7e","resolution":{"observed_at":"2026-08-06T19:45:53.205779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:45:52.988424Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.988424Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:74f0adba3ac1f415362c72ad1676dc5fdc70a1bf5500976a097e78d36341b21e","observation_id":"3d56b49a-193d-4454-9f06-1430fa7ff85f","resolution":{"observed_at":"2026-08-06T19:45:52.988424Z","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-06T19:45:52.993501Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.993501Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:eded07c32bc4e4dea5ab3b749a38f3d3faf603767e59868e4bb35d972216a023","observation_id":"b90ff0b4-519a-4dee-b2b3-c1035e9b336d","resolution":{"observed_at":"2026-08-06T19:45:52.993501Z","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-06T19:45:52.999185Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:52.999185Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:5accff84e47fbcb606d74e976b615ea5f378aeb6323a16d57ab50ad8cba37bd1","observation_id":"2828f68b-c504-4366-9145-dace81f13101","resolution":{"observed_at":"2026-08-06T19:45:52.999185Z","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-06T19:45:53.004852Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","version":3},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:53.004852Z"},"links":{"citing_paper":"/paper/2507.04949"},"observation_digest":"sha256:9b9010013892d8160949d527e6d268454c05411a0093c132ac5cebb353363c94","observation_id":"fcbc2be0-8938-4e52-87cf-e13afb1a967e","resolution":{"observed_at":"2026-08-06T19:45:53.004852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.04949","last_updated":"2026-06-25T07:54:51Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-19T07:54:08.846944Z","submitted_at":"2025-07-07T12:49:20Z","title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":1,"verified_fuzzy":57},"total_outbound_references":71},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2507.04949."}