{"as_of":"2026-08-15T09:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:697930031cf658be3d607bfcb3a607435ffb44543423b69a36163484a1e0499e","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:12:06.528630Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T18:31:43.925120Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T00:00:52.232360Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.11833","snapshot_observed_at":"2026-08-02T18:31:43.925120Z","title":"Differentiable gpu- parallelized task and motion planning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.09971","last_updated":"2026-07-28T19:12:58Z","snapshot_observed_at":"2026-08-13T05:57:12.833569Z","submitted_at":"2026-03-10T17:59:00Z","title":"TiPToP: A Modular Open-Vocabulary Robot Manipulation System That Plans","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-02T18:31:43.925120Z"},"links":{"cited_paper":"/paper/2411.11833","citing_paper":"/paper/2603.09971"},"observation_digest":"sha256:e043a7aab4ac004968684bf33f810740abb55e9a34ad7c0d7c44dc738105dc9c","observation_id":"c73a76a4-5436-4ad8-a9b4-05ce86d1ce00","resolution":{"observed_at":"2026-08-02T18:31:43.925120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"cited_work":{"arxiv_id":"2411.11833","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11833","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Differentiable gpu- parallelized task and motion planning","venue":null,"work_id":"24dc79a1-e062-42ef-aedf-4ebae99226c2","year":2024},"citing_paper":{"arxiv_id":"2604.05226","last_updated":"2026-04-06T22:42:05Z","snapshot_observed_at":"2026-08-11T06:41:30.928596Z","submitted_at":"2026-04-06T22:42:05Z","title":"RoboPlayground: Democratizing Robotic Evaluation through Structured Physical Domains","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T18:46:08.897540Z"},"links":{"cited_paper":"/paper/2411.11833","citing_paper":"/paper/2604.05226"},"observation_digest":"sha256:f4c3acffc826746d9cd9a923454bf7ce3651a5884024a06f291a28fa0230ec75","observation_id":"cad0e0ff-3235-4860-8b70-360c17e8a7cf","resolution":{"observed_at":"2026-05-11T00:00:52.238695Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.11833/citation-record","integrity":"/paper/2411.11833/integrity","json":"/paper/2411.11833/citation-record.json","paper":"/paper/2411.11833"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:07.151703Z","title":"Integrated Task and Motion Planning","venue":null,"work_id":"dbb5619f-c2bb-46ef-9494-62c4ffc4745e","year":2021},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.359015Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:8e461a5f70864ce0e7e019cf1087295a985451d80a69239176d1c71846c414ee","observation_id":"547654a5-e523-435c-a3ed-f0e4ed74554f","resolution":{"observed_at":"2026-08-12T18:12:07.155148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:07.142840Z","title":"Garrett, Tom ´as Lozano-P ´erez, and Leslie P","venue":null,"work_id":"4dcfc7cf-4a84-4153-8c05-756693a896f3","year":2020},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.362948Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:4d8de825d93eb11fb97655519a4a1ceecf007e7cb2a562d69045d9fdc4b7309f","observation_id":"905a7411-1590-45c8-8289-91b14258c49c","resolution":{"observed_at":"2026-08-12T18:12:07.146135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02475","last_updated":"2022-03-04T18:12:49Z","snapshot_observed_at":"2026-08-13T16:29:20.371927Z","submitted_at":"2022-03-04T18:12:49Z","title":"Cooperative Task and Motion Planning for Multi-Arm Assembly Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.02475","snapshot_observed_at":"2026-08-12T18:12:06.366087Z","title":"Cooper- ative task and motion planning for multi-arm assembly systems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.366087Z"},"links":{"cited_paper":"/paper/2203.02475","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:a59f38724e129aaf786913b21bee0855b9e6defbcb8ec2c726862aae62acff25","observation_id":"2a441fca-64e6-4607-9221-25dfb872c798","resolution":{"observed_at":"2026-08-12T18:12:06.366087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.01576","last_updated":"2023-05-22T15:49:42Z","snapshot_observed_at":"2026-08-15T09:05:12.902496Z","submitted_at":"2022-11-03T04:12:04Z","title":"Sequence-Based Plan Feasibility Prediction for Efficient Task and Motion Planning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.01576","snapshot_observed_at":"2026-08-12T18:12:06.369284Z","title":"Sequence-based plan feasibility prediction for efficient task and motion planning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.369284Z"},"links":{"cited_paper":"/paper/2211.01576","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:658ac2f901b8d8812c22ed0d4553ca4d866c51893eb98ab64d39918aac7e076f","observation_id":"bc5a3920-0f88-4339-889d-77ae2ed11098","resolution":{"observed_at":"2026-08-12T18:12:06.369284Z","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-12T18:12:06.372609Z","title":"Hierar- chical task and motion planning in the now","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.372609Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:7b13e4669dc03fd88a6cfb645ea46548f10207d091ac1d53bd2fa24bb388628e","observation_id":"97505524-0870-4eaa-aea4-8e65fc4aa763","resolution":{"observed_at":"2026-08-12T18:12:06.372609Z","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-12T18:12:06.375690Z","title":"Combined task and motion planning through an extensible planner- independent interface layer","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.375690Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:e483aecdbfc6d797741b8fd87c8cec5850032d9511f1cef69a2cc4ecc4fc5a0a","observation_id":"044ca015-9351-4458-8d67-9c117887706c","resolution":{"observed_at":"2026-08-12T18:12:06.375690Z","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-12T18:12:07.124719Z","title":"Sampling-based methods for factored task and motion planning","venue":null,"work_id":"1e4eb043-727e-44c3-8839-6327bc4e69ac","year":2018},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.378959Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:4f1c51a94333cd57a09e1a99407f86e847d7be11679fcdd2bc603994c5611927","observation_id":"0c02fbfe-bbb1-450a-9651-b4a6065a2619","resolution":{"observed_at":"2026-08-12T18:12:07.127772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:07.115774Z","title":"Asymptotically optimal planning under piecewise-analytic constraints","venue":null,"work_id":"e7d70038-4770-4e66-8c6c-ea21f424acd8","year":2020},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.381797Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:7967163085064c9870146d4772ea17b4b70ffcc2041cb022cb2344b739c28a9c","observation_id":"65b74c1b-8aac-4814-a3cc-a0589853620f","resolution":{"observed_at":"2026-08-12T18:12:07.119292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.13196","last_updated":"2024-10-11T22:31:42Z","snapshot_observed_at":"2026-08-13T11:10:59.454748Z","submitted_at":"2023-06-22T20:40:24Z","title":"DiMSam: Diffusion Models as Samplers for Task and Motion Planning under Partial Observability","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.13196","snapshot_observed_at":"2026-08-12T18:12:06.384608Z","title":"Dimsam: Diffusion models as samplers for task and motion planning under partial observability","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.384608Z"},"links":{"cited_paper":"/paper/2306.13196","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:302dc40f3daacca164ba49353149256dba7fd9ced5d69ec3567759830cddf36b","observation_id":"d93d3be3-dca5-4778-bef8-f4da40de80e5","resolution":{"observed_at":"2026-08-12T18:12:06.384608Z","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-12T18:12:07.106387Z","title":"Tenenbaum, Tom ´as Lozano-P ´erez, and Leslie Pack Kaelbling","venue":null,"work_id":"13aa3ade-8749-4ec1-a9bd-a840c658778c","year":2023},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.387812Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:06c9439f024a6fff4a85781d2af19304b5e3cd2e36e43f4444e2a6fc54b7a87d","observation_id":"c2de0293-12a1-46ef-830e-34a26512e61e","resolution":{"observed_at":"2026-08-12T18:12:07.109698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02817","last_updated":"2024-10-07T10:09:16Z","snapshot_observed_at":"2026-08-13T00:38:22.312890Z","submitted_at":"2024-04-03T15:38:36Z","title":"A Survey of Optimization-based Task and Motion Planning: From Classical To Learning Approaches","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02817","snapshot_observed_at":"2026-08-12T18:12:06.390716Z","title":"A sur- vey of optimization-based task and motion planning: From classical to learning approaches","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.390716Z"},"links":{"cited_paper":"/paper/2404.02817","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:e1352bdaf486d0c4351a851e6c3f8031e6e6bd197192d68f9332308929637fa2","observation_id":"8e8f6fc0-a14c-4a7e-8c17-9002f4228d52","resolution":{"observed_at":"2026-08-12T18:12:06.390716Z","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-12T18:12:07.097055Z","title":"Fast motion planning by parallel processing–a review","venue":null,"work_id":"390a96cf-4188-420a-9562-1a857cd283e6","year":1997},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.393976Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:6640d7f3e9f7a3b20f735aa90571b83bcbf69c06a73a0dc02abaa9bd09309b31","observation_id":"aed0816f-260e-4a06-925c-324736856281","resolution":{"observed_at":"2026-08-12T18:12:07.100293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1991.13172","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.754496Z","title":"Lozano-Perez and P.A","venue":null,"work_id":"a07b046b-2b07-413e-afa5-69f4043aeb91","year":1991},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.396847Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:14fba41f6f488f663b87719dfd6fa9d114a7e596be7844f47b7a68964e2999d2","observation_id":"c8c027fe-8baa-459c-927b-eaaeae1b60b9","resolution":{"observed_at":"2026-08-12T18:12:06.759156Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:07.088318Z","title":"Motions in microseconds via vectorized sampling-based planning","venue":null,"work_id":"5143c967-00c9-4983-90b8-3f19d040fe2f","year":2024},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.399990Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:9961d766a341d91367a4e2ba25174b16e7d71a750c8dfe54f19a0832f6c1e6d4","observation_id":"71b6530c-da79-45b5-8120-d8f2ea7fc791","resolution":{"observed_at":"2026-08-12T18:12:07.091506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:07.079462Z","title":"High-dimensional planning on the gpu","venue":null,"work_id":"20102625-67f9-47a8-b4e0-6e417351e618","year":2010},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.402812Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:0cb10f32d15e5fe3d9cee7b2f66157a9a63e9a902a9c5ebde561bcd5c5c38b91","observation_id":"5448be3b-2a4a-42e0-a958-621ad2c03849","resolution":{"observed_at":"2026-08-12T18:12:07.082769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:07.071539Z","title":"Gpu-based parallel colli- sion detection for fast motion planning","venue":null,"work_id":"2484b377-206d-401a-8797-03bf1e07f401","year":2012},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.405723Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:fdc7184eedf7adad3cafa8d2209bd7a4b82b09115e9156ea8e23ed43ff16fb42","observation_id":"ef427773-531b-4528-906d-176018eadcba","resolution":{"observed_at":"2026-08-12T18:12:07.074320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:07.062611Z","title":"Curobo: Parallelized collision-free robot motion generation","venue":null,"work_id":"06f237a0-fe6c-4041-b931-06218e876964","year":2023},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.408589Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:4d9702a245f202730d174810a02775362b03a06ac293300e7ef9efc66537d084","observation_id":"b91dee27-6ace-4ff7-a68c-6be58930a122","resolution":{"observed_at":"2026-08-12T18:12:07.065957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.411340Z","title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.411340Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:7405e97b0d2392ec762d3744e7ab7923bbd7d5e456a1d9e4856d446aa6ce4625","observation_id":"5af3c0b2-c659-43cc-b9e8-7e07a71f008d","resolution":{"observed_at":"2026-08-12T18:12:06.411340Z","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-12T18:12:07.048633Z","title":"Ffrob: Leveraging symbolic planning for efficient task and motion planning","venue":null,"work_id":"ea2c2cbd-5058-44e8-98ef-eb390589d62d","year":2018},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.413804Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:8e96b2ccb27f171156e44dbaa0c5826462a4125a15350282e21b6819aa9df6a9","observation_id":"921099e4-0429-4f45-a892-02702cfac61f","resolution":{"observed_at":"2026-08-12T18:12:07.052027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:07.040433Z","title":"An incremental constraint-based framework for task and motion planning","venue":null,"work_id":"09695aca-a548-4074-8745-bc239200bc7f","year":2018},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.416398Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:68e7d38fb42635913bf5afc9754a21dafab9ef1d8fbe070c5771a3c815de034d","observation_id":"4b7ba816-6af4-418b-b449-2fbae75b6c76","resolution":{"observed_at":"2026-08-12T18:12:07.043475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:07.031723Z","title":"Randomized multi-modal motion planning for a humanoid robot ma- nipulation task","venue":null,"work_id":"32ef5f51-c7f0-4304-9c20-2bbad8d4f4aa","year":2011},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.418999Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:f39985225039b71f51d1004a071812de26c938139a72c8094415ca418bab9d80","observation_id":"86961a3b-fb2a-4d8e-b90d-8294283a9067","resolution":{"observed_at":"2026-08-12T18:12:07.035200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:07.023681Z","title":"Learning to search in task and motion planning with streams","venue":null,"work_id":"d6ca6112-0d99-422c-a8a4-32957ade1558","year":1983},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.422089Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:0fd9b450b1fe5d72598d7056fc24b7b8b6e96844f00e89d92126395905654b8c","observation_id":"d99e6de2-1fb7-4ea9-9873-e8eda70688e3","resolution":{"observed_at":"2026-08-12T18:12:07.026311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:07.016202Z","title":"Ex- tended tree search for robot task and motion planning","venue":null,"work_id":"3db1317d-c7fd-402c-8020-bd712f3d2f7b","year":2024},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.426082Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:762472968658d9bd374ce756a8e545e39b4c23024a456cfab33c886839cc6447","observation_id":"20a9f1c2-ad22-420f-ae07-7d135fecf78d","resolution":{"observed_at":"2026-08-12T18:12:07.018955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.429103Z","title":"Nlp sampling: Combining mcmc and nlp meth- ods for diverse constrained sampling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.429103Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:17b331c6c24acc4269394136bf599fc39532cda334e8776f8039d1133a1fcac3","observation_id":"935f5b7d-475f-4f47-968f-42b0ccaf027d","resolution":{"observed_at":"2026-08-12T18:12:06.429103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01775","last_updated":"2024-09-29T04:43:45Z","snapshot_observed_at":"2026-08-13T05:58:44.796469Z","submitted_at":"2023-10-03T03:53:51Z","title":"STAMP: Differentiable Task and Motion Planning via Stein Variational Gradient Descent","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01775","snapshot_observed_at":"2026-08-12T18:12:06.432099Z","title":"Stamp: Differentiable task and motion planning via stein variational gradient descent","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.432099Z"},"links":{"cited_paper":"/paper/2310.01775","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:78896f2692117968d9ba815120add3f362229b023749f6663171bd4c814cdc90","observation_id":"6cf2c557-4ebf-44fb-9468-680af6070cfd","resolution":{"observed_at":"2026-08-12T18:12:06.432099Z","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-12T18:12:07.008045Z","title":"Sampling-Based Robot Task and Motion Planning in the Real World","venue":null,"work_id":"4dc6f70f-eb77-46f7-9805-56b430f8fd68","year":2021},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.435695Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:05a50ec056e8ae19357c2b3e154c7a4c162f99a4bccdb18fe99608df6d099c27","observation_id":"d90b9020-1e85-45a8-a201-139914d868d9","resolution":{"observed_at":"2026-08-12T18:12:07.011151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.999818Z","title":"Optimal grasps and placements for task and motion planning in clutter","venue":null,"work_id":"657267d9-758d-49f5-84ef-7560ca590b23","year":2023},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.438536Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:4ee493424cfccf414d49d50171d9a70511082b1ab9f304f3a4e3dc3a003f6a59","observation_id":"28c3cec0-f2cc-466f-b245-92f0cd764452","resolution":{"observed_at":"2026-08-12T18:12:07.002872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.990850Z","title":"Smc: Satisfiability modulo convex optimiza- tion","venue":null,"work_id":"077452b5-ce39-4b1d-9d77-f150d2ed3450","year":2017},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.441647Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:99b666477c1d9db3d44b0696b98b7b0a0fe25220ac8cbb3aa8c9dc0d4c588711","observation_id":"90607ed1-6076-48fe-a147-34076b23bc74","resolution":{"observed_at":"2026-08-12T18:12:06.994093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.982572Z","title":"Smc: Satisfiability modulo convex program- ming","venue":null,"work_id":"00de15f4-7c0d-49b2-91eb-8a34d375ac97","year":2018},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.444594Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:a266beb0e44d83f097bd57f9a5507403d4b1fade943630dfdf1708560948ab86","observation_id":"517d227f-2ad8-4b70-82ef-aeeb10bc387b","resolution":{"observed_at":"2026-08-12T18:12:06.985797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.973984Z","title":"ScottyActivity: mixed discrete-continuous plan- ning with convex optimization","venue":null,"work_id":"68086b99-e7f8-45e6-9ef1-c411aec5f87c","year":2018},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.447455Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:2ca309775b23103050bc4b00e59f860652d364be3957cd1c82dbdb2c7238f545","observation_id":"6ac59241-c660-4c6d-9507-bdebed72a085","resolution":{"observed_at":"2026-08-12T18:12:06.977396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.966250Z","title":"Optimal constrained task planning as mixed integer programming","venue":null,"work_id":"7f6b4213-7455-4ce9-8246-0d4480203bb5","year":2022},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.450245Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:468ed700c5af0e9a3c63305e1cbb5f8e498c09893a1c93ebfd0e0fdf6bdc7242","observation_id":"eeaa4b15-09f9-4bb7-b1a3-cafd0aca78a7","resolution":{"observed_at":"2026-08-12T18:12:06.968949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.958904Z","title":"Sequential Quadratic Programming for Task Plan Optimization","venue":null,"work_id":"b090c147-feb1-446d-9b8e-2005e669e288","year":2016},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.453181Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:d49c5eceab12d8ada649710d5866c3b2e778d2ab562fbcfcc47c228343003b99","observation_id":"0319fd52-2975-458e-b7a5-f30f86167208","resolution":{"observed_at":"2026-08-12T18:12:06.961435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1407.0414","last_updated":"2014-07-01T21:45:48Z","snapshot_observed_at":"2026-08-14T23:28:17.997518Z","submitted_at":"2014-07-01T21:45:48Z","title":"Newton methods for k-order Markov Constrained Motion Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1407.0414","snapshot_observed_at":"2026-08-12T18:12:06.456015Z","title":"Newton methods for k-order markov constrained motion problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.456015Z"},"links":{"cited_paper":"/paper/1407.0414","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:271339871ff950d6693717b8c6c4f7d6fee25ea6fa086c82f15c1e2d8d1a5f7c","observation_id":"e1115745-d190-4dde-9a56-bfa3baff1ac8","resolution":{"observed_at":"2026-08-12T18:12:06.456015Z","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-12T18:12:06.950240Z","title":"Logic-geometric programming: an optimization-based approach to combined task and mo- tion planning","venue":null,"work_id":"6887852d-b6b4-4cbd-a1bc-bc88b55aaa70","year":2015},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.459217Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:bafcbf7f264373754b7108d228792929131c7a842a2e8e25a59b66bdbf26f0ad","observation_id":"639ac2be-fa7a-4fc9-be48-1223d5e6b60f","resolution":{"observed_at":"2026-08-12T18:12:06.953585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.461587Z","title":"Differentiable physics and stable modes for tool-use and manipulation planning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.461587Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:5698a2d2db494554ff7515f9f9cc3070836473a79329b7ddb9d2eb04ce3f6853","observation_id":"cf75cced-e7d3-44c8-8551-08b3fd27206c","resolution":{"observed_at":"2026-08-12T18:12:06.461587Z","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-12T18:12:06.941817Z","title":"A conflict-driven interface between sym- bolic planning and nonlinear constraint solving","venue":null,"work_id":"426d4643-23cd-4d74-84da-ea5cf695ba75","year":2022},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.464233Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:df6bf82fa03c9506ea5ca95e2cdaaf5a4a1b4f026cecc85bed2664819e5d4e8a","observation_id":"c131cad6-4605-450c-ac49-ceb14965c9b4","resolution":{"observed_at":"2026-08-12T18:12:06.944820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.932817Z","title":"Conflict-directed diverse planning for logic-geometric programming","venue":null,"work_id":"c7cebcd2-89b8-4c3f-81bb-361f40dee4dc","year":2022},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.466635Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:361e98dd141aa13cb3cd4965678b6dd67a9cce4606d6063b01677102ec8c386f","observation_id":"cb86b730-dc99-4028-bc2d-11bc6bff5dd2","resolution":{"observed_at":"2026-08-12T18:12:06.936108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.923312Z","title":"Sydebo: Symbolic-decision-embedded bilevel optimiza- tion for long-horizon manipulation in dynamic environ- ments","venue":null,"work_id":"965f8fb3-ca28-4995-b8fe-e8e87fbb5aa6","year":2021},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.469479Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:23a5df1eb35611d88cd7e1061fa4efd52c2bf59d5088cdbc6471d7d08266f0d1","observation_id":"142665c8-c856-43a2-956e-e555b5668079","resolution":{"observed_at":"2026-08-12T18:12:06.926486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.913912Z","title":"PDDL: The Planning Domain Defi- nition Language","venue":null,"work_id":"3ac29bf7-c49a-4ffa-a336-6d315ff6d69c","year":1998},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.472682Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:2210cd62dbc3507a73f98e6ff2c07917fa753fd4484b5dad8d8bd78141b0d6c3","observation_id":"eb2c197a-7c31-42a2-ab35-f83476d71200","resolution":{"observed_at":"2026-08-12T18:12:06.917904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-12T18:12:06.475543Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.475543Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:23ddfe80108e3085e738a7dc9a8f33de6ba55197aa98853070b23c24cdec3b74","observation_id":"3551cdc6-69b6-4ded-9630-91ea6386d431","resolution":{"observed_at":"2026-08-12T18:12:06.475543Z","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-12T18:12:06.905718Z","title":"Constrained differential op- timization","venue":null,"work_id":"502bacc6-a30d-4f19-97ec-1cfd83d2ed69","year":1987},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.478372Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:a17b7b3271d7a652de99f28a730d61f1bd230e3f57efbcddc3e0ca3c4acda265","observation_id":"7e7cb9f0-997a-46d0-8520-1039b3f4338f","resolution":{"observed_at":"2026-08-12T18:12:06.908573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.03319","last_updated":"2019-07-02T03:54:58Z","snapshot_observed_at":"2026-08-14T17:18:54.064221Z","submitted_at":"2019-02-08T22:55:30Z","title":"A Differentiable Augmented Lagrangian Method for Bilevel Nonlinear Optimization","version":2},"cited_work":{"arxiv_id":"1902.03319","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.03319","snapshot_observed_at":"2026-08-12T18:12:06.586664Z","title":"A Differentiable Augmented Lagrangian Method for Bilevel Nonlinear Optimization","venue":"cs.RO","work_id":"cac72f46-bf83-4448-b5f3-d197f2cb6717","year":2019},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.481289Z"},"links":{"cited_paper":"/paper/1902.03319","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:fe45b82bd2ee0b018a597b097bfc33adbb1634a8444fb4683a5755694c995ce8","observation_id":"e59ff696-8319-412e-9ea4-cd4b02ee3ad3","resolution":{"observed_at":"2026-08-12T18:12:06.591621Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.896926Z","title":"Probabilistic inference of simulation parameters via parallel differ- entiable simulation","venue":null,"work_id":"4fa11da1-268b-48e8-bbf9-5f75ae7f230c","year":2022},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.484357Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:1cf967ea0ef88a32ef417dd938ee254f0fa08c746d24a5ecea9725f0200f885d","observation_id":"1aa670ec-45be-4915-9590-9be6db9eaa19","resolution":{"observed_at":"2026-08-12T18:12:06.900157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.888041Z","title":"Coordinate descent algorithms","venue":null,"work_id":"5feacbfd-894f-421a-871b-5f1f5eedb151","year":2015},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.487358Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:3a02e7f66e8779c4479d20eb1fdde6b66b92c90206e3345b0dfda17920c5d116","observation_id":"051f11de-2f00-4a15-a34e-537289be2448","resolution":{"observed_at":"2026-08-12T18:12:06.891101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.490353Z","title":"On the limited memory bfgs method for large scale optimization","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.490353Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:aae2c6421f23b7367fc04fdf8da34ab24ab1bc1704babb49f8f56a19ceb07534","observation_id":"b7e9bc2c-6636-442e-a4c4-c6fa4be06dac","resolution":{"observed_at":"2026-08-12T18:12:06.490353Z","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-12T18:12:06.493065Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.493065Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:a41e4445390783d8108cc757e4a1412bb79db1c000358b5390c77c5ee38b949a","observation_id":"cf14f0e3-b2d0-4930-9089-6eaba6bef9ab","resolution":{"observed_at":"2026-08-12T18:12:06.493065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16727","last_updated":"2024-10-22T06:25:34Z","snapshot_observed_at":"2026-08-12T22:17:53.444912Z","submitted_at":"2024-10-22T06:25:34Z","title":"DiffusionSeeder: Seeding Motion Optimization with Diffusion for Rapid Motion Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16727","snapshot_observed_at":"2026-08-12T18:12:06.496111Z","title":"Diffusionseeder: Seeding motion optimiza- tion with diffusion for rapid motion planning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.496111Z"},"links":{"cited_paper":"/paper/2410.16727","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:efacf0eecd5e46b3c61f729275ab9a41a2722cb1b94cd29270173a85ebc0b8b3","observation_id":"716a8d72-8c49-4de4-b2a0-efaf07c15ac8","resolution":{"observed_at":"2026-08-12T18:12:06.496111Z","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-12T18:12:06.869286Z","title":"Optuna: A next-generation hyperparameter optimization framework","venue":null,"work_id":"6738ad41-7bdd-4bb9-a720-f2d601a081f4","year":2019},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.499180Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:d266d4ad44c0d27834888d25cad5749600bb83c30b073986db515c94035686f4","observation_id":"82b4ac0e-e155-4e0a-8eef-319a75b36e04","resolution":{"observed_at":"2026-08-12T18:12:06.872420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.860363Z","title":"Long- horizon manipulation of unknown objects via task and motion planning with estimated affordances","venue":null,"work_id":"81a9937c-1262-480b-abc7-bb3a7cbd6812","year":2022},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.502017Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:c794fa645941e305af5bde9227a844ccc69ce23f94d7207cb20a52dae256c319","observation_id":"29cea24a-0f63-4711-b480-cbf44b9aaede","resolution":{"observed_at":"2026-08-12T18:12:06.863533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.851102Z","title":"Cud@ sat: Sat solving on gpus","venue":null,"work_id":"3a9aadb3-e5b3-4c97-b169-58a2abf15315","year":2015},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.505020Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:dee9eae50c6770f04b8420af34663e535ccf8726dc1595a532cd05196dcb6611","observation_id":"2b65a709-8f02-467c-90f9-7cbc689b296b","resolution":{"observed_at":"2026-08-12T18:12:06.854070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.843280Z","title":"Planning as satis- fiability","venue":null,"work_id":"3542118a-cd6b-4fd3-ab40-76b29dc96023","year":1992},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.508149Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:07a2fc8af8aec64f61a29891880fec0d7efb895d825a0ae77357154bb05b9ae9","observation_id":"780dddf7-fae5-422a-8c53-b0971612ca0c","resolution":{"observed_at":"2026-08-12T18:12:06.846093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.834556Z","title":"Inte- grated task and motion planning in belief space","venue":null,"work_id":"761c5760-9402-4f27-aaa2-c016d960b61f","year":2013},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.510766Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:5071e8e02c0c3da7dda915d59ef2a9ce674fe38182faa63b14f413d3948eed0b","observation_id":"c1da2463-e549-434e-aa7f-d2aa1970e3ec","resolution":{"observed_at":"2026-08-12T18:12:06.837748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.824918Z","title":"Online replanning in belief space for partially observable task and motion problems","venue":null,"work_id":"d33731e5-08a5-4b2a-8da8-398428230727","year":2020},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.513215Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:32516b1209a72ab26eccaceae7420a7cc27f5a2a79ffa1f358fe6362f114b5f1","observation_id":"046678ab-4ce7-421f-900d-a4a30b0f2e79","resolution":{"observed_at":"2026-08-12T18:12:06.828113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.814896Z","title":"Decidability of semi-holonomic prehen- sile task and motion planning","venue":null,"work_id":"c72c936b-b71c-4e2d-b62f-dc1e486747c0","year":2020},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.516170Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:d53e262f4dce7ff6eabed8906898de1f18952398302f48e87b0e5db854a187c9","observation_id":"4f8cb154-5678-4958-9df3-7116550cbc23","resolution":{"observed_at":"2026-08-12T18:12:06.819102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.805815Z","title":"Task and motion planning is pspace-complete","venue":null,"work_id":"5ff7644f-2e5d-4f27-a74a-77c9c3c3555a","year":2020},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.519638Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:9db77ee0cdef57e8cbcdce172fca35dac66ea2998a3f1563cc2d4db6fefbc3d0","observation_id":"de464572-ce56-477c-9ef8-971d27d989ac","resolution":{"observed_at":"2026-08-12T18:12:06.809121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:12:06.796031Z","title":"Sampling-based methods for motion planning with con- straints","venue":null,"work_id":"d0eab41a-6456-44ae-9fb5-bffdb87b38aa","year":2018},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.522555Z"},"links":{"citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:5c584c40146191cbba4575be925ff48fa7bc63e5bc26722ba0b6fe0947be6e8e","observation_id":"41af392f-2bee-4655-8820-e5dceae6667d","resolution":{"observed_at":"2026-08-12T18:12:06.799735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.11127","last_updated":"2026-05-31T18:23:52Z","snapshot_observed_at":"2026-08-13T11:57:57.181602Z","submitted_at":"2023-04-21T17:02:38Z","title":"Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performance","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.11127","snapshot_observed_at":"2026-08-12T18:12:06.525450Z","title":"Tree-structured parzen estimator: Understanding its algorithm components and their roles for better empirical performance","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.525450Z"},"links":{"cited_paper":"/paper/2304.11127","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:0da53a327579ecd23708bc5ea1d1fe659fdda7e293045682375fd0f1443eb6bf","observation_id":"dbda99ec-c005-4733-b544-7451cafe4e3c","resolution":{"observed_at":"2026-08-12T18:12:06.525450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.00772","last_updated":"2023-03-10T09:45:23Z","snapshot_observed_at":"2026-08-14T17:57:14.284736Z","submitted_at":"2016-04-04T08:16:12Z","title":"The CMA Evolution Strategy: A Tutorial","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.00772","snapshot_observed_at":"2026-08-12T18:12:06.528630Z","title":"b *h 4 4","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T18:12:06.528630Z"},"links":{"cited_paper":"/paper/1604.00772","citing_paper":"/paper/2411.11833"},"observation_digest":"sha256:71a53d5f9093aafac91f459153e5c834d0c409cde07a2339803e3158d7903619","observation_id":"3e2a7401-e88e-4e57-916d-f27e0ce8e78c","resolution":{"observed_at":"2026-08-12T18:12:06.528630Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.11833","last_updated":"2025-04-29T15:22:16Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-13T11:24:06.161580Z","submitted_at":"2024-11-18T18:51:57Z","title":"Differentiable GPU-Parallelized Task and Motion Planning"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":16,"verified_exact":1,"verified_fuzzy":39},"total_outbound_references":58},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 2 inbound Pith citation observations for arXiv:2411.11833."}