{"as_of":"2026-08-07T19:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8cdce95a322229ee0cd2d145c04753e13d144e7c4954adfb0841d52592070a1","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-02T18:27:35.055003Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2607.00215/citation-record","integrity":"/paper/2607.00215/integrity","json":"/paper/2607.00215/citation-record.json","paper":"/paper/2607.00215"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T04:16:00.046131Z","title":"Motion policy networks,","venue":null,"work_id":"524126af-d03c-4a55-aebb-1b92ef97a8d3","year":2023},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:1b2e7f7aecda9adeeaab9a27f312ca0294429efa556e871dce4075e716531315","observation_id":"f81d1449-9878-4da6-9566-ad7d83c4ae54","resolution":{"observed_at":"2026-07-05T21:51:27.357305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05864","last_updated":"2024-09-09T17:59:45Z","snapshot_observed_at":"2026-08-04T22:15:53.886927Z","submitted_at":"2024-09-09T17:59:45Z","title":"Neural MP: A Generalist Neural Motion Planner","version":1},"cited_work":{"arxiv_id":"2409.05864","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.05864","snapshot_observed_at":"2026-07-03T10:37:57.318806Z","title":"Neural mp: A generalist neural motion planner","venue":null,"work_id":"4fa0fbf0-1a0e-4d77-ba1a-43dc87fcb0a1","year":2024},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"cited_paper":"/paper/2409.05864","citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:609228fdf38635f8758cbd26f9af5235b2faf13cfd7941405360e8cfe9633264","observation_id":"05722432-271b-4888-9595-5d5dcab2aa17","resolution":{"observed_at":"2026-07-02T18:37:16.336840Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.06953","last_updated":"2025-09-08T17:59:35Z","snapshot_observed_at":"2026-08-04T22:56:01.917838Z","submitted_at":"2025-09-08T17:59:35Z","title":"Deep Reactive Policy: Learning Reactive Manipulator Motion Planning for Dynamic Environments","version":1},"cited_work":{"arxiv_id":"2509.06953","doi":"10.48550/arxiv.2509.06953","metadata_source":"arxiv_reference","pith_arxiv_id":"2509.06953","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Deep reactive policy: Learning reactive manipulator motion planning for dynamic environments","venue":"ArXiv.org","work_id":"8538ee2b-504a-4c97-b0fc-3766dac0b99d","year":2025},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"cited_paper":"/paper/2509.06953","citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:4cc78540367e21129e0760b0e77436f0256f19639f71df55ad590d9a0dfd09c0","observation_id":"9d7bdc4e-2d9b-4f8e-9d4b-54af81a97ce7","resolution":{"observed_at":"2026-07-02T18:37:16.340586Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.358180Z","title":"Rapidly-exploring random trees: A new tool for path planning","venue":null,"work_id":"e32d2ea8-520a-46b1-89fc-37adaad96b8d","year":1998},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:705e8641d3f245ef9b29bd1be3fd4634f4fff547b897003be17906d7f1824a47","observation_id":"52219759-6f93-4d25-a1c0-c7b830b6bf7b","resolution":{"observed_at":"2026-07-05T21:51:27.360122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.367115Z","title":"Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":"b493049f-f5a8-40f2-b184-fa96b84a3aba","year":1996},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:703030cfcc112d17ae0d183f81f692274db19b8d92a36e3b8312a71669544f87","observation_id":"db860789-17f8-4f78-af1c-d45b976007c2","resolution":{"observed_at":"2026-07-05T21:51:27.368799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.364832Z","title":"Path planning using lazy prm","venue":null,"work_id":"677ccb01-308c-46c3-97cd-c01680ec804d","year":2000},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:45c5844b40e501f36ffdc994ccacde08e5a74a3bd88331eb24d8121b1677be0a","observation_id":"78136709-2efd-448a-b6bd-68bfa2dc403d","resolution":{"observed_at":"2026-07-05T21:51:27.366564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.369170Z","title":"Batch informed trees (bit*): Informed asymptotically optimal anytime search","venue":null,"work_id":"38f1fd26-fc50-473a-ab5c-1f87128166b9","year":2020},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:c1ad9eef92cdadd417f1aa861b1eb2aa737849ace0e2ca67ade81bb5ea289914","observation_id":"4ccda60e-8648-4127-8b52-4cc190736b42","resolution":{"observed_at":"2026-07-05T21:51:27.371235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.360927Z","title":"Adaptively informed trees (ait*): Fast asymptotically optimal path planning through adaptive heuristics,","venue":null,"work_id":"3d52754a-503e-47e2-844d-c5ad6d2a949d","year":2020},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:c1a0a30ba5c4a2278f62ef0572128980feddff07806e6652ad1c71c9d92fc945","observation_id":"a83e154f-7108-4d20-88ce-dc9f70aa1f06","resolution":{"observed_at":"2026-07-05T21:51:27.362790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.346981Z","title":"Chomp: Gradient optimization techniques for efficient motion planning,","venue":null,"work_id":"8d7ce5d0-d751-4b63-9f17-a90a216ac423","year":2009},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:2eede71aff76e625be5c7722c75e45f6e2652188429015e03c1ba98e2cf237aa","observation_id":"4967749a-9da8-4e7c-a72e-ea6dc48eb834","resolution":{"observed_at":"2026-07-05T21:51:27.349359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-09T13:16:15.984076Z","title":"Motion planning with sequential convex optimization and convex collision checking","venue":null,"work_id":"62d2f372-444c-4e1e-bee8-2d2a2fc4d8f5","year":2014},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:27df18b29e5e61fb3da55b38616c9c6e9e5e08e03645c29eac7a8fc8b44b4bfd","observation_id":"18c10f09-ecfc-4694-90c3-5596e6d93f8e","resolution":{"observed_at":"2026-07-05T21:51:27.340815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.398452Z","title":"The convex feasible set algo- rithm for real time optimization in motion planning","venue":null,"work_id":"ce8b90b7-8681-4610-84f8-655648bbc427","year":2018},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:a3fc866195068a7c93eb32d48db460c5f0e840a2c7bc8fa65410a26ee0bcb6ca","observation_id":"d02301e9-9e61-4791-848e-8fd6016e276c","resolution":{"observed_at":"2026-07-05T21:51:27.399680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.372047Z","title":"Curobo: Parallelized collision-free robot motion generation","venue":null,"work_id":"13be4080-d108-4112-86d5-a51807d1153e","year":2023},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:ec3aa948a9381c542d2e7eb5c36fb545b05d1ba32c8ab284cf8bed19041febc9","observation_id":"cf2e54a8-69b5-42f5-9c9c-a5c93f6e50f3","resolution":{"observed_at":"2026-07-05T21:51:27.373578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-08T03:54:29.991902Z","title":"Storm: An integrated framework for fast joint-space model-predictive control for reactive manipulation,","venue":null,"work_id":"1b214f09-c9f6-4b62-9c62-013afe610ea9","year":2022},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:b504f2f2852c2214bb32bfeebda601aa0a4853bda2579f40b284d0bf21e61c88","observation_id":"6ef0a8ef-96b0-40e9-84c8-5b6facf5cd67","resolution":{"observed_at":"2026-07-05T21:51:27.361978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.371728Z","title":"Geometric fabrics: Generalizing classical mechanics to capture the physics of behavior,","venue":null,"work_id":"2a31e983-9a27-406f-a3e7-8d3edb81be50","year":2022},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:71d97a50aa82706a488d3e66d378c6e6e5008d9d3179e560b26c98caa5deb13b","observation_id":"53442e85-74ed-47d5-9fef-8a9d010680fb","resolution":{"observed_at":"2026-07-05T21:51:27.373211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.369325Z","title":"Learning fast, tool- aware collision avoidance for collaborative robots,","venue":null,"work_id":"666c908f-4397-4372-ad8b-627f9d977d01","year":2025},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:63107bbc001c332ee6d4afb31f14bc8d150b997fe92a4b91c56a4f0d64acac0f","observation_id":"e7561cf1-c3a1-44a1-9da8-38ec0ebfa448","resolution":{"observed_at":"2026-07-05T21:51:27.371093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.403628Z","title":"Motion planning networks: Bridging the gap between learning-based and classical motion planners,","venue":null,"work_id":"7ea46613-d0ed-4b91-a8a5-44531c8d386f","year":2021},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:62720d50fa2c459b7c8eb14a2e11e3b04599823bff42de890f7eb64d7a0db282","observation_id":"e831828c-7518-4b2c-821d-f046f1b3412d","resolution":{"observed_at":"2026-07-05T21:51:27.404959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.394558Z","title":"Brax-a differentiable physics engine for large scale rigid body simulation, 2021,","venue":null,"work_id":"2aaccde2-fa1d-4e86-9bb3-e6343b732dd3","year":2021},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:0eeff535fecf65fecdfe4fffdff49f531af568e4a79a3276b575708c82e10792","observation_id":"9aee6d0a-424a-4f11-9c84-eda870c3cc46","resolution":{"observed_at":"2026-07-05T21:51:27.395826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.396363Z","title":"Newton: GPU-accelerated physics simulation for robotics, and simulation research","venue":null,"work_id":"79c03bd0-5be1-4fe7-9abe-bc4cd2de7b35","year":2025},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:d66911772e14acfc07b23977f022ecbd725cd300e60c9c65444afc36d04ce993","observation_id":"bf651a73-43a5-44c7-ae7f-60de48287e16","resolution":{"observed_at":"2026-07-05T21:51:27.397851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2508.21065","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T18:37:16.322488Z","title":"Learning on the fly: Rapid policy adaptation via differentiable simu- lation,","venue":null,"work_id":"935022ae-9635-4e89-82b8-7df05d918807","year":2025},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:720dad38ea4d5e3eaa5e0a977b8369df6c3cb92ec9601859ccd86480248ba7f8","observation_id":"bdf8ce94-70ad-4a1c-ac00-5279aaf57276","resolution":{"observed_at":"2026-07-02T18:37:16.324117Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.388620Z","title":"Training efficient controllers via analytic policy gradient,","venue":null,"work_id":"71888281-11e5-4181-b26e-da4d4a7eed1c","year":2023},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:17e031bea9d328c8d8f9288b4bdbf66386a524a8c0f1fcfb89be798d76cf3a2f","observation_id":"e484343f-2dc0-412a-95ef-9b01db79258b","resolution":{"observed_at":"2026-07-05T21:51:27.389849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.390465Z","title":"Differentiable composite neural signed distance fields for navigation in dynamic indoor scenes,","venue":null,"work_id":"14789558-43c9-4be5-9b5e-cf6954c7d323","year":2025},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:eb2b32dff4b57935b054efc0efd48d7d0fa52a316d73835654948ac3a6c4c252","observation_id":"29bcda79-c3db-42d3-93af-bf983e2a68c4","resolution":{"observed_at":"2026-07-05T21:51:27.391986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-09T12:46:15.563467Z","title":"Pointnet++: Deep hierarchical feature learning on point sets in a metric space","venue":null,"work_id":"820971d7-5785-47b9-b984-7fdd4e2fb0e6","year":2017},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:d9764ef95a5b69df338e9986aa8d80bcc57a0a6c0914aa000f2aa04636789cb1","observation_id":"f454f395-a264-4d09-81a9-9a9ab3086cb0","resolution":{"observed_at":"2026-07-05T21:51:27.387729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.381366Z","title":"Backpropagation through time: what it does and how to do it,","venue":null,"work_id":"a84a1a4b-68f0-4357-9675-b1b21560fd56","year":2002},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:39f9a0eb94a5e81b0508ac0250350f90724e03d30db74613409ff4979984121f","observation_id":"c8da32b6-5e1d-40d7-aca4-28818ee5b81b","resolution":{"observed_at":"2026-07-05T21:51:27.383571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.01031","last_updated":"2021-01-17T19:47:56Z","snapshot_observed_at":"2026-07-06T09:25:03.937338Z","submitted_at":"2020-06-01T15:57:45Z","title":"A Smooth Representation of Belief over SO(3) for Deep Rotation Learning with Uncertainty","version":4},"cited_work":{"arxiv_id":"2006.01031","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.01031","snapshot_observed_at":"2026-07-02T18:37:16.325624Z","title":"arXiv preprint arXiv:2006.01031 , year=","venue":null,"work_id":"ade9f0d8-0e3e-40ab-bbcb-91e4b2d4b230","year":2006},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"cited_paper":"/paper/2006.01031","citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:2684ee45a0893c8d47498e584217d2233e1de16584fc8b355739237369f14362","observation_id":"e86446d2-ccd4-482b-82e1-d5d48c28585a","resolution":{"observed_at":"2026-07-02T18:37:16.327470Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.11735","last_updated":"2024-06-19T10:17:54Z","snapshot_observed_at":"2026-07-06T18:01:53.720064Z","submitted_at":"2024-04-17T20:37:29Z","title":"Learning with 3D rotations, a hitchhiker's guide to SO(3)","version":2},"cited_work":{"arxiv_id":"2404.11735","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.11735","snapshot_observed_at":"2026-07-02T18:37:16.331805Z","title":"Learning with 3D rotations, a hitchhiker’s guide to SO (3)","venue":null,"work_id":"6f0deb0b-4266-4abf-bfdd-e4dd632f2fcb","year":2024},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"cited_paper":"/paper/2404.11735","citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:37b6ec266a3a2a5c8a988a416ff7d14cf54800627ba2e153e50797120d609823","observation_id":"a711d9df-b789-49f7-b4bd-0c75d640e15c","resolution":{"observed_at":"2026-07-02T18:37:16.333523Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.384270Z","title":"On the analysis of movement smoothness,","venue":null,"work_id":"3c703347-30f5-4bdc-88b9-477686069a66","year":2015},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:24ca06d9c1dc6235e373d02cabea959550ba8fb98c0fda3e7885ceb21e68f823","observation_id":"03824b9b-0071-43d6-bf33-e483051134c3","resolution":{"observed_at":"2026-07-05T21:51:27.385867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.392671Z","title":"Learning long-term dependen- cies with gradient descent is difficult,","venue":null,"work_id":"55fb8d46-3d97-4abd-b8b9-7c810e83ec1e","year":1994},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:849c94ba29c8db196ae227e60ea2771a9d84b7cb30f3b68964b0fc3eec3ba8b8","observation_id":"226cf401-87f9-4c3d-a3b4-111cb927e248","resolution":{"observed_at":"2026-07-05T21:51:27.394015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.400233Z","title":"On the difficulty of training recurrent neural networks,","venue":null,"work_id":"b021ae4f-4f68-4a28-970f-4e7ab63d2f01","year":2013},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:b014eadd17ab053f34e3c04cb2ab2958370093dafa09d5e5e8d39a336bd8f212","observation_id":"6b3aeceb-0883-4313-82f4-e19289d392e1","resolution":{"observed_at":"2026-07-05T21:51:27.401462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.05803","last_updated":"2022-01-21T02:07:54Z","snapshot_observed_at":"2026-07-06T12:07:19.954510Z","submitted_at":"2021-11-10T16:51:04Z","title":"Gradients are Not All You Need","version":2},"cited_work":{"arxiv_id":"2111.05803","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.05803","snapshot_observed_at":"2026-07-04T20:10:08.808642Z","title":"Gradients are not all you need","venue":null,"work_id":"69b737d3-0230-4d55-814b-18c8e17895c6","year":2022},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"cited_paper":"/paper/2111.05803","citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:ca97aa6f8bda5f28a12d368c9b451923bb5e9bccff00cc8e9155aa03b1312947","observation_id":"23682b6d-7faf-43ff-b6ba-bee27bc2ec15","resolution":{"observed_at":"2026-07-02T18:37:16.333395Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.401952Z","title":"realtime urdf filter,","venue":null,"work_id":"6f26da69-31bc-4289-80c8-184232c58952","year":2022},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:0bb279eb6d102455c8194740aba8c0cfff7f58843455230f13f34c3356eb432b","observation_id":"a1836fca-dfa3-44f9-9b48-b420c49afb12","resolution":{"observed_at":"2026-07-05T21:51:27.403065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.352756Z","title":"Learning by cheating,","venue":null,"work_id":"27e49bc1-6ff7-4622-aa25-3d65f2ae8b86","year":2020},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:6db9f257a03f24c7e1ead1280d72d51c29d7ba643485f8b816c3bf06d59bb910","observation_id":"c6600b17-03e9-480b-a255-842fbbb5a18f","resolution":{"observed_at":"2026-07-05T21:51:27.354103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-09T11:46:13.577452Z","title":"Learning quadrupedal locomotion over challenging terrain","venue":null,"work_id":"3669bf67-2326-4e56-9d13-54e9cd148af1","year":2020},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:030e884d2e1bcd0837667974a48af98cae3955fb543385ed0bb2a892b3cbba5f","observation_id":"6952de46-eddb-4c48-a9e0-f5f0a55b9764","resolution":{"observed_at":"2026-07-05T21:51:27.378368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.379008Z","title":"Accelerated policy learning with parallel differen- tiable simulation,","venue":null,"work_id":"585243b9-fa6b-477a-a154-e9171ece4338","year":2022},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:b120b31d129c0969c604f733bc390171705c30c8b256a3343d0788ee349972f2","observation_id":"39315872-8d16-4201-be36-e3567f6912fd","resolution":{"observed_at":"2026-07-05T21:51:27.380727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T21:51:27.374129Z","title":"A new approach to time-optimal path parameterization based on reachability analysis","venue":null,"work_id":"96284105-3bcd-4d29-b1d9-1b129abe462c","year":2018},"citing_paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-02T18:27:35.055003Z"},"links":{"citing_paper":"/paper/2607.00215"},"observation_digest":"sha256:783e835d837c8f403e72e1d860b794bd00ae3d686c797099035f67f2c94fd86d","observation_id":"51bc5c8c-8cab-4543-a82d-21824d193d94","resolution":{"observed_at":"2026-07-05T21:51:27.375762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.00215","last_updated":"2026-06-30T21:47:09Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-01T12:34:05.647291Z","submitted_at":"2026-06-30T21:47:09Z","title":"ELMP: Efficient Learning for Motion Planning via Analytical Policy Gradients"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":5,"verified_fuzzy":28},"total_outbound_references":34},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2607.00215."}