{"as_of":"2026-08-22T03:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb4c9c40c717affc6c1f91300859b6ab6ce6dc6195f8b61f98b99567265ffc28","coverage":[{"denominator":85,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":85,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:42:40.310660Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T09:44:54.897829Z","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-07-02T03:46:32.394527Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"cited_work":{"arxiv_id":"2508.21001","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.21001","snapshot_observed_at":"2026-07-02T03:46:32.394527Z","title":"Hassidof, T","venue":null,"work_id":"275b7b61-32ec-4b04-a1aa-8c40cd3d3a96","year":2025},"citing_paper":{"arxiv_id":"2606.03756","last_updated":"2026-06-02T15:06:25Z","snapshot_observed_at":"2026-08-15T02:33:43.103854Z","submitted_at":"2026-06-02T15:06:25Z","title":"Neural Navigation Functions for Zero-Shot Generalizable Motion Planning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T09:44:54.897829Z"},"links":{"cited_paper":"/paper/2508.21001","citing_paper":"/paper/2606.03756"},"observation_digest":"sha256:c69f6fa3e3da8388e1770c0e766bc9c8c1a7b1648df71990deafb9805ce7aa70","observation_id":"2470ccb0-cabb-4148-ad2d-bc0feafec25e","resolution":{"observed_at":"2026-07-02T03:46:32.396203Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.21001/citation-record","integrity":"/paper/2508.21001/integrity","json":"/paper/2508.21001/citation-record.json","paper":"/paper/2508.21001"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:42:40.071896Z","title":"Paden, M","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.071896Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:3d64108b6a1eed237c265753d8cc5d7d68c37a09d159c65445f8c42c1e81ccaa","observation_id":"74f955da-823f-4e88-85f0-2e4d8c85fd05","resolution":{"observed_at":"2026-08-05T14:42:40.071896Z","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-05T14:42:40.076157Z","title":"Ghambari, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.076157Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:e74afd7008d625fd75aed9403bd9815f97a70890abafa9249cfa447c545c10c5","observation_id":"0d2886f7-bdd8-4806-beaa-f5e26ab8d979","resolution":{"observed_at":"2026-08-05T14:42:40.076157Z","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-05T14:42:40.079507Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.079507Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:d0cb929401ecc0dbe86f8d293778987b7de5f9bc45fe09a7452e169fc149772a","observation_id":"d93fbeb1-84e8-4321-b145-565ca8749afa","resolution":{"observed_at":"2026-08-05T14:42:40.079507Z","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-05T14:42:40.086250Z","title":"https://underactuated.csail. mit.edu","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.086250Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:045d2c578490e19df4c03f06505a29e19dd79bf1f2a5c9a4095abce7ec099d58","observation_id":"37e8215a-071e-4211-8f1b-15f841eedb9f","resolution":{"observed_at":"2026-08-05T14:42:40.086250Z","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-05T14:42:40.089591Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.089591Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:1deeb47c322f26002a09e94539bc7cf1297647efed9476b3fe02432ef0ae7228","observation_id":"ceec6960-c66d-4a48-a6c0-7835f19afdd2","resolution":{"observed_at":"2026-08-05T14:42:40.089591Z","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-05T14:42:41.070494Z","title":null,"venue":null,"work_id":"52e0b7c1-6949-4fcd-bbf8-8b8e9261b09d","year":2019},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.093086Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:21c9528d6017087f9d7dbaa03adb423d570c22c9f9207d41aa982fd100633b0c","observation_id":"c5d50ee0-0dbd-4bcb-9d9c-115c7190210b","resolution":{"observed_at":"2026-08-05T14:42:41.073140Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:41.062423Z","title":"Elbanhawi and M","venue":null,"work_id":"6ddf15a2-cbd2-409b-8f5e-d977fa97ea3a","year":2014},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.096263Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:d25fbb77c671b5d8411aca3c9cb64f3527bd3ccf5ac0d7ed2fdfe01da76d0487","observation_id":"d392d974-46c0-4958-aa20-083225c5b82c","resolution":{"observed_at":"2026-08-05T14:42:41.065536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:41.053719Z","title":"Janner, Y","venue":null,"work_id":"c90abfd7-54ea-49e6-93d3-046d53672735","year":2022},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.099089Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:cf2f1930f93e6717fed2d2261bb1eba087f0d02d725138c42414d671012be19c","observation_id":"1185ed94-27f7-4629-985d-63b321957241","resolution":{"observed_at":"2026-08-05T14:42:41.056968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:41.044212Z","title":null,"venue":null,"work_id":"c807dca0-6e44-478e-b4c6-24b571c06fde","year":null},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.102210Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:4e40e630ead132a0b18e8cf5c461d83b312d78517567654d7596899c09f3a73c","observation_id":"b8c90625-256b-43a1-8193-3b01257c2103","resolution":{"observed_at":"2026-08-05T14:42:41.047101Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:41.035526Z","title":"Silver, J","venue":null,"work_id":"2e154139-29a7-40f3-a95a-f18edc98c7b2","year":2017},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.108695Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:a008fea2e5886d1d81e6ca5897039b7e3fc6f176a501a1a3d219115cc8be7412","observation_id":"79d42512-9d9a-443d-a481-18d5990734bf","resolution":{"observed_at":"2026-08-05T14:42:41.038315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:41.027301Z","title":"Silver, T","venue":null,"work_id":"b6c6f153-c108-469d-a216-9d9f52b5033c","year":2018},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.111887Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:b1d5c10157681ec89407b7a0cab4ed39fa036a0ebbb61f777a9a1fba1d9661ee","observation_id":"269fd1d7-798b-407d-8596-65b9106b049c","resolution":{"observed_at":"2026-08-05T14:42:41.030687Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:41.019079Z","title":"Openai o1 system card, 2024","venue":null,"work_id":"e2f44cea-aa20-4eb9-9f75-76d0bd0e1828","year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.115227Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:55fedb8cef55f31e340536b4f1df53059bf086f3c9e7f9361da465220387e0d1","observation_id":"dc723186-e250-408c-b31a-7b6a1186fe84","resolution":{"observed_at":"2026-08-05T14:42:41.022261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-05T14:42:40.117843Z","title":"Deepseek-r1: Incentivizing reasoning capability in LLMs via reinforcement learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.117843Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:0526f981d109a3c527b68f7a39e2a0895572e86ec326ca50ed44a352141b52f0","observation_id":"4dcb3c8b-eacf-4a92-a624-0a9802a75043","resolution":{"observed_at":"2026-08-05T14:42:40.117843Z","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-05T14:42:41.011321Z","title":"Kavraki, P","venue":null,"work_id":"fda7f212-b2a5-4832-b5a6-704d82b509cc","year":1996},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.120438Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:817f4e30ee2dd19e43623f9184766916a9ef0f695bb2daa2ebc25effe68401d6","observation_id":"44cef120-dfd2-4f91-b8d3-c094f6baf47c","resolution":{"observed_at":"2026-08-05T14:42:41.013759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:41.002327Z","title":"Bohlin and L","venue":null,"work_id":"d41f05b1-51a5-47af-a60f-956ace39880b","year":2000},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.124012Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:24c9a5feeb75d28b95f8dbdd1261e5516252e68fe04005c64e7d38df21bb7f56","observation_id":"884b85c4-93e2-4da5-bc2e-e11968b86aa1","resolution":{"observed_at":"2026-08-05T14:42:41.005599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.994503Z","title":"Karaman and E","venue":null,"work_id":"558564f0-8049-4760-8e28-855aec2b5cfb","year":2011},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.126589Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:6fbef97f22e5b7dc9c0b18386da3148545ce0380ae3f05f56b572a19c217a484","observation_id":"cbe55c3a-621d-4cbe-84d0-a965a7e386da","resolution":{"observed_at":"2026-08-05T14:42:40.997185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.986432Z","title":null,"venue":null,"work_id":"e243acf2-7d1f-4ffa-983e-f54466d0654e","year":2013},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.129111Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:ac951eb2626e2cd27ec9efc888ecb556a62b0f2b4aea7e9a754d1e371ccc0775","observation_id":"79d1f53e-b176-4888-a39b-3f48ec5f7d45","resolution":{"observed_at":"2026-08-05T14:42:40.989383Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.978237Z","title":null,"venue":null,"work_id":"de7e2b8b-a8e7-4fae-8ca1-bacbed4d476f","year":2018},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.131686Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:d30d98ce7ebb7459cf5100649439a7343e09c7989cdaebf96d8a3365bbb23743","observation_id":"a6d521b1-9592-45bb-bced-08d036d95460","resolution":{"observed_at":"2026-08-05T14:42:40.981083Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.969624Z","title":null,"venue":null,"work_id":"5403886c-cce2-41ef-ace7-837ef0ba5ea4","year":2001},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.134268Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:e175413cb621fea1fffdd7bd87e9a125a0952f7c771197d18f8579e232da4d20","observation_id":"e39c3c3a-d4a7-4b18-9dd9-4fa469d8b4b5","resolution":{"observed_at":"2026-08-05T14:42:40.972813Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.959946Z","title":null,"venue":null,"work_id":"193a56e6-7fdf-44c0-8d11-f9d87dec2f74","year":2016},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.136756Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:4bccb15794811acf0c3c75017fa4b8bc4604a1ed6a8b9af60c35a1a280c4e389","observation_id":"ef36cfbb-456d-46d2-8c06-f6e9d107d54a","resolution":{"observed_at":"2026-08-05T14:42:40.963427Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.950460Z","title":"Hauser and Y","venue":null,"work_id":"bf4ca6a7-201e-4b99-9661-9cfb6e7c6f32","year":2016},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.139379Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:0fb756f4c4390f3ce6ca337a1e3f57df2a7c020a2e4e17281324e2260c865668","observation_id":"f2b01cb8-0b5b-400c-94d7-3c75f28cde09","resolution":{"observed_at":"2026-08-05T14:42:40.953582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-00312-7_28","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Springer tracts in advanced robotics","work_id":"f84fd54e-187c-4ef6-8fe7-4ba14f3bd32e","year":2010},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.141784Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:16dd0bf6fbcf8f0bf995fce070e61637f8888ae2afb975e2750d77af30c874ff","observation_id":"99fd32b9-070d-409e-b128-80485051daca","resolution":{"observed_at":"2026-08-05T14:42:40.336623Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.941375Z","title":"Kleinbort, E","venue":null,"work_id":"3e5f25b1-06c5-4c07-bdda-1682a21c0320","year":2020},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.144385Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:a43066673f7e9c018a545d4746729f86c649598b45541e6b8f4578b630613e71","observation_id":"a618df58-6b8f-4792-8d23-9fa72c13b54c","resolution":{"observed_at":"2026-08-05T14:42:40.944619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.932085Z","title":null,"venue":null,"work_id":"570be7f8-8d06-460b-bafe-0249ae060e92","year":2022},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.146914Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:2ed9033ea58bf6624b1521ccba8e7ca053955fcdde3c3f6564ea85d56d3c7a85","observation_id":"3eedeee3-5571-4ed9-bff1-62663248e985","resolution":{"observed_at":"2026-08-05T14:42:40.934981Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.923763Z","title":null,"venue":null,"work_id":"5eb0c499-9dba-4a2a-9499-54cc6c2fbecb","year":2025},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.149602Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:6b82b43ee2b3b40fcb3bcbc4af885984783c90540849ee2752d1a2bc6b19bdd7","observation_id":"47ca336f-66f5-4115-81eb-2bc9d389599c","resolution":{"observed_at":"2026-08-05T14:42:40.926724Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.152209Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.152209Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:b089ad3bbffd1a21f25a77ccfcc6b73b4368ba1cea957a9342ff1d61123d5e46","observation_id":"17c3642f-6b6e-4f9d-8e9e-074dfcd99e85","resolution":{"observed_at":"2026-08-05T14:42:40.152209Z","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-05T14:42:40.155272Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.155272Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:08f0e4d5388b5dd7282640f4607ed03dc127e836ea82b1c1b6a957b8115c883b","observation_id":"4d53b89c-ed2a-44c4-994c-ca8eb2cd0d1a","resolution":{"observed_at":"2026-08-05T14:42:40.155272Z","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-05T14:42:40.909867Z","title":"Carvalho, A","venue":null,"work_id":"b64e3986-2857-43a6-9174-b3bc40bf344a","year":2023},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.158095Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:3d5716d5d347cb00454f4d1080c3a8f1764076a93225d2fd3a31960986da3310","observation_id":"275a9cd6-1511-4b49-bfbd-ba7d70ecf030","resolution":{"observed_at":"2026-08-05T14:42:40.913067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.901086Z","title":"Xiao, T.-H","venue":null,"work_id":"f7f034b1-49c9-4649-8fcc-e502b7995397","year":2025},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.160815Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:9e97f17059a61fde8632b6818786bc37b34dad8752087c4b5a051577a85ea49b","observation_id":"7907da6a-064b-49e9-9be5-ddb01674b7e4","resolution":{"observed_at":"2026-08-05T14:42:40.904197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.891702Z","title":null,"venue":null,"work_id":"0c4d10b5-9f39-472b-881d-cbf0be1b9cfe","year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.163266Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:c4bf34525d53cf295b928c946e62dbb5282fde85c65e615ca63a745a399f6c19","observation_id":"6eaa9691-d835-409b-bd17-297e242bb269","resolution":{"observed_at":"2026-08-05T14:42:40.895260Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.883109Z","title":"Sohl-Dickstein, E","venue":null,"work_id":"d6fbb761-605e-4f21-a257-529117e59167","year":2015},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.166037Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:124cc571673547661bd5829abe59d43fc5989f226a5a505f92056297a5d7f433","observation_id":"9e12bae2-5b2d-4d7a-99e5-48927120af84","resolution":{"observed_at":"2026-08-05T14:42:40.885923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.168584Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.168584Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:cb286bda1b0a3bc1bc95b19d9a291709b399b82fe68a49c7caa785977e082468","observation_id":"c8ae90e0-4581-42a3-9b22-837c33347560","resolution":{"observed_at":"2026-08-05T14:42:40.168584Z","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-05T14:42:40.171630Z","title":"Song and S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.171630Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:24d40dfeaa349fc30891e22f373d7a99a374c511b016fb2d8eb4d4df66a9e7e3","observation_id":"1d6d5973-8dbd-40c8-93a3-70ac39e4a2ee","resolution":{"observed_at":"2026-08-05T14:42:40.171630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.02747","last_updated":"2023-02-08T15:46:05Z","snapshot_observed_at":"2026-08-16T02:30:42.660030Z","submitted_at":"2022-10-06T08:32:20Z","title":"Flow Matching for Generative Modeling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.02747","snapshot_observed_at":"2026-08-05T14:42:40.174241Z","title":"Lipman, R","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.174241Z"},"links":{"cited_paper":"/paper/2210.02747","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:ae8223d1e95dfb886fb2c96dc281b1776cdb0543792c09c7495f059a2151f67e","observation_id":"9f84f37d-b718-4d08-be0c-e12392a2728e","resolution":{"observed_at":"2026-08-05T14:42:40.174241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.03003","last_updated":"2022-09-07T08:59:55Z","snapshot_observed_at":"2026-07-06T13:49:40.974495Z","submitted_at":"2022-09-07T08:59:55Z","title":"Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.03003","snapshot_observed_at":"2026-08-05T14:42:40.177075Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.177075Z"},"links":{"cited_paper":"/paper/2209.03003","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:8c7e4a964f452a1d04aad4d973da17db942ecf2ecb7e023d31a704f37c4b112f","observation_id":"deee79ee-8973-4da6-b462-71c316b69d94","resolution":{"observed_at":"2026-08-05T14:42:40.177075Z","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-05T14:42:40.863032Z","title":null,"venue":null,"work_id":"0a6f07d1-9048-4999-a762-4b321ef368ea","year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.179680Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:78686c79a9d9bc9bd43d14786d69db9b8883821de801083a672279a871d90610","observation_id":"8b5dd5f7-8c2c-4ebb-b6b6-579c86f51c26","resolution":{"observed_at":"2026-08-05T14:42:40.866018Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.854845Z","title":null,"venue":null,"work_id":"5293fac8-ed10-4b3b-a3dd-aba1ff2c1dc1","year":2023},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.182278Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:eb10b6a83f20ff1337bda0509f8073053cbfd0224ca784c818949e210d06e0d8","observation_id":"69f4fd50-df60-43c6-8654-34d3bb494485","resolution":{"observed_at":"2026-08-05T14:42:40.857691Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.06015","last_updated":"2023-01-15T03:43:45Z","snapshot_observed_at":"2026-08-21T14:07:27.896309Z","submitted_at":"2023-01-15T03:43:45Z","title":"Diffusion-based Generation, Optimization, and Planning in 3D Scenes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.06015","snapshot_observed_at":"2026-08-05T14:42:40.184970Z","title":"Huang, Z","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.184970Z"},"links":{"cited_paper":"/paper/2301.06015","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:b4a8b602eaf158aadfc38ef6b7c6386902269cf4e980ff6bacbe35c382bddc09","observation_id":"3b251851-3216-4954-b7bc-2755da8ab6ee","resolution":{"observed_at":"2026-08-05T14:42:40.184970Z","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-05T14:42:40.846086Z","title":null,"venue":null,"work_id":"518764fe-271f-48c0-9513-a47bd74ad8ba","year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.188479Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:a7ad91942a9497a8c7acd66f0135c831bdded969a82c40596ef3f4b539896748","observation_id":"1e2a9577-4949-46e4-bacf-47815e919db2","resolution":{"observed_at":"2026-08-05T14:42:40.849017Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.837473Z","title":null,"venue":null,"work_id":"26fdbacb-0d24-43a7-b1e5-ec7958352b58","year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.191301Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:99a212cf4527296d9f651ccbeafaf4151c49648a26d47b473f553bb5baad3ba0","observation_id":"618cca59-be96-4469-8369-84e6e84ba35b","resolution":{"observed_at":"2026-08-05T14:42:40.840272Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15443","last_updated":"2024-10-25T03:36:07Z","snapshot_observed_at":"2026-08-18T09:03:44.533819Z","submitted_at":"2024-01-27T15:30:49Z","title":"DiffuserLite: Towards Real-time Diffusion Planning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15443","snapshot_observed_at":"2026-08-05T14:42:40.194545Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.194545Z"},"links":{"cited_paper":"/paper/2401.15443","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:7f8e798e4b252ef107e883ef8bdb7d04bea8098ea0cb03347944124ca1097977","observation_id":"3f0fc06a-39b3-400f-b3ce-4f8723d70952","resolution":{"observed_at":"2026-08-05T14:42:40.194545Z","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-05T14:42:40.828288Z","title":null,"venue":null,"work_id":"f9cebacf-9fbe-4d3c-b508-98d83c76b247","year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.197617Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:0a9db335716a73664b49ce9d9684e3b8d5becb6b082a65807d239d5a8772f372","observation_id":"900eef49-0de5-42dc-a948-a01b51d29b80","resolution":{"observed_at":"2026-08-05T14:42:40.832220Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.819542Z","title":null,"venue":null,"work_id":"c0b9683f-7522-4a88-8151-c78e4037c30c","year":2019},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.200634Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:59657b6fd6dafba16ef6b5a4d765a833e4261561bb4ef04414d366ec6c022845","observation_id":"21e43dfc-14f5-43bc-a284-cbdb8a2c48f9","resolution":{"observed_at":"2026-08-05T14:42:40.822528Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.810867Z","title":"Ichter, J","venue":null,"work_id":"4dd46ef3-2217-49ad-b56d-09ef43589126","year":2018},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.203082Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:d8bab3cf8077c91115159f3cb7fb7922d57b3b2cd13b2725dc8db69183290be0","observation_id":"d6e1bc4f-b94e-4a0c-9f95-83e701f9c343","resolution":{"observed_at":"2026-08-05T14:42:40.814165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.801346Z","title":null,"venue":null,"work_id":"b6572108-7bb9-4b00-9a36-b606e782de24","year":2020},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.205661Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:357ea2b2422dd33acb99ce49d1d14e65c82bcc443bd25320d22f7a6a2626cfc2","observation_id":"4a001b1d-ce43-4c01-a70a-dd593c5e9412","resolution":{"observed_at":"2026-08-05T14:42:40.805308Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.792444Z","title":null,"venue":null,"work_id":"453142d9-4151-4cc6-ab8e-f040efbccb49","year":2019},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.208298Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:cc48a2224877e425a5c123bf91e5a1e130111c91c103f7b92bc82dde00e45580","observation_id":"3b01fd39-4326-4331-9ec2-d62ae5210d63","resolution":{"observed_at":"2026-08-05T14:42:40.795292Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.783428Z","title":"Ichter, P","venue":null,"work_id":"759c4deb-e778-4fae-b5a7-709f6157ddb9","year":2020},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.211558Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:bdff89d423c1ec9f8f761ce129af78a49b0bef01fd4872656841efeaacdf48af","observation_id":"eb2ea410-cf59-44a5-9ddd-a83baecf24d1","resolution":{"observed_at":"2026-08-05T14:42:40.786775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.773168Z","title":"Sivaramakrishnan, E","venue":null,"work_id":"4e96d183-9507-407b-868a-8620e5743a13","year":2021},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.214243Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:3362e6c5cebfdc6731231eef5022b1a4c4d322057d0e14857602a9767e02fc40","observation_id":"86fd1f81-54d9-4665-82de-05377b2c222c","resolution":{"observed_at":"2026-08-05T14:42:40.776859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.763847Z","title":"McMahon, A","venue":null,"work_id":"2b7287fe-9ef7-4ebe-bf09-f80f75f79dc8","year":2022},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.217067Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:e1868b8ec26f1b6f016664b949de149eaca67570be25988f09bd772246662677","observation_id":"14935fce-90fe-49dc-945d-40a81b74354e","resolution":{"observed_at":"2026-08-05T14:42:40.767237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.753427Z","title":null,"venue":null,"work_id":"7e604c6f-d7d0-470c-8182-ea9aa128d1e9","year":2019},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.219675Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:6754f6109c3c0ac8533e5ec8fc82879d8c3fb0a3fd4c74c663ae8e4cfb2749a5","observation_id":"db6921a9-d1c9-4187-bda4-badd1edc2876","resolution":{"observed_at":"2026-08-05T14:42:40.756760Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.743469Z","title":null,"venue":null,"work_id":"359e09e3-ffab-4078-8d3e-24a093788eb4","year":2000},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.222030Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:fb2440606b5c5037e13c03eacc719460a3e22f65a7162fc4b82bdade0c02c5ae","observation_id":"c8a24d23-edda-4fab-9754-bc5c2cd964a9","resolution":{"observed_at":"2026-08-05T14:42:40.746606Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.733930Z","title":"Esser, S","venue":null,"work_id":"942986be-9665-4ff4-ad4a-0f799b8d94c4","year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.224478Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:3902ca1364068f93df5cd07a73fc98db520322ff5d6b8611b9c3d6f6a0920bc3","observation_id":"600b0e54-1498-4fcf-bfad-61b32e91d007","resolution":{"observed_at":"2026-08-05T14:42:40.736967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02391","last_updated":"2024-04-11T16:29:12Z","snapshot_observed_at":"2026-08-18T18:21:15.865456Z","submitted_at":"2023-10-03T19:24:24Z","title":"SE(3)-Stochastic Flow Matching for Protein Backbone Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02391","snapshot_observed_at":"2026-08-05T14:42:40.226986Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.226986Z"},"links":{"cited_paper":"/paper/2310.02391","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:dbd8aca43bfa4fa75f74df763cccab90ea7b43337a67c059bf2e57332d5d95f4","observation_id":"f13b0e99-c3b0-423d-b2f7-d3a44440297a","resolution":{"observed_at":"2026-08-05T14:42:40.226986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04292","last_updated":"2024-11-22T18:11:23Z","snapshot_observed_at":"2026-08-19T14:32:40.375054Z","submitted_at":"2024-02-06T10:15:38Z","title":"AdaFlow: Imitation Learning with Variance-Adaptive Flow-Based Policies","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04292","snapshot_observed_at":"2026-08-05T14:42:40.229697Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.229697Z"},"links":{"cited_paper":"/paper/2402.04292","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:6cb5e1158375890553fc4644a1120ad5193b6d38033bb05fca7d29e5fbbdd481","observation_id":"67c6c25e-27a2-4110-a88d-c057ab8b3014","resolution":{"observed_at":"2026-08-05T14:42:40.229697Z","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-05T14:42:40.232240Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.232240Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:2002d300c9ded6dec4bdb6b9ff66a10f26de9b05c40296417fbe59ead205d07d","observation_id":"bf744474-8fe9-4b19-b3b9-4360846a2825","resolution":{"observed_at":"2026-08-05T14:42:40.232240Z","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-05T14:42:40.720753Z","title":"Kleinbort, K","venue":null,"work_id":"3a3380f9-2655-41f4-9710-344db4503a2b","year":2018},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.234619Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:656e9db7935a7324a852c6e7ed7246694b93e53b03e965e76de2f52f88d44ac2","observation_id":"35cd71da-b695-4849-aee9-fb724739a422","resolution":{"observed_at":"2026-08-05T14:42:40.723837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02398","last_updated":"2024-07-02T16:15:37Z","snapshot_observed_at":"2026-08-17T16:42:56.554179Z","submitted_at":"2024-07-02T16:15:37Z","title":"Consistency Flow Matching: Defining Straight Flows with Velocity Consistency","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.02398","snapshot_observed_at":"2026-08-05T14:42:40.237242Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.237242Z"},"links":{"cited_paper":"/paper/2407.02398","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:28b1b55dcc10c3ba240f50e411156c20aa3c629d7fe0d3da5808162bb408fcdc","observation_id":"4cf82530-d8ff-496f-b57c-b2c83091eb9b","resolution":{"observed_at":"2026-08-05T14:42:40.237242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12557","last_updated":"2025-06-23T14:26:35Z","snapshot_observed_at":"2026-08-21T08:27:55.351250Z","submitted_at":"2024-10-16T13:34:40Z","title":"One Step Diffusion via Shortcut Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12557","snapshot_observed_at":"2026-08-05T14:42:40.239798Z","title":"Frans, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.239798Z"},"links":{"cited_paper":"/paper/2410.12557","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:09642dda043c1908420b290f225ee3e1626c7da41a2053dbb3959c7ca92986a1","observation_id":"4f08b517-9705-43df-9f5a-5386ae13ed17","resolution":{"observed_at":"2026-08-05T14:42:40.239798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10088","last_updated":"2024-10-14T02:02:54Z","snapshot_observed_at":"2026-08-18T19:46:57.991314Z","submitted_at":"2024-10-14T02:02:54Z","title":"The Ingredients for Robotic Diffusion Transformers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10088","snapshot_observed_at":"2026-08-05T14:42:40.242489Z","title":"Dasari, O","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.242489Z"},"links":{"cited_paper":"/paper/2410.10088","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:3b574f8a5e8f09134c7ef42dcc3a8b2e6fe3e067e5e8b89171cb904c5b4a225e","observation_id":"e8123e6b-2b52-4e9e-a3d2-44304ba05c13","resolution":{"observed_at":"2026-08-05T14:42:40.242489Z","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-05T14:42:40.712153Z","title":"Ronneberger, P","venue":null,"work_id":"ba7bdc22-691e-4cc6-8fe9-b9749aee870b","year":2015},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.245446Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:77eaa506dd5ae43cf121f86a68267af38e86ff1c97900ca6d8beba2f201067e0","observation_id":"bc32a04e-b53f-4b07-8093-44988e504f3e","resolution":{"observed_at":"2026-08-05T14:42:40.715302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.693479Z","title":null,"venue":null,"work_id":"4c1499a7-ec48-4e44-8ca5-aab54396651f","year":2019},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.251158Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:65284c404bad65001c8d3fa9c601b64da1b03e2fdd0502b730f455c74e2983f4","observation_id":"a9add849-55a4-4609-b934-63850ad334b9","resolution":{"observed_at":"2026-08-05T14:42:40.696238Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.684275Z","title":"Kloeser, T","venue":null,"work_id":"63164629-db26-48de-a669-b228bb184cbf","year":2020},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.254124Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:fef3092cf0ac395664947c05ff4ecaae482acb36f512c588cd8be315a13fde7e","observation_id":"0329781a-187f-4402-859c-e1e3e0005342","resolution":{"observed_at":"2026-08-05T14:42:40.687644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.675343Z","title":"Todorov, T","venue":null,"work_id":"663ec13c-2470-48c7-8c99-82f0fa7bc264","year":2012},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.256704Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:91c70c8e6469fd7677c977841cf2b9d22c000b37fd5568e5fd380b15276137d6","observation_id":"da9eca6e-476a-436c-9742-e8399fb1c070","resolution":{"observed_at":"2026-08-05T14:42:40.678299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.666050Z","title":"de Lazcano, K","venue":null,"work_id":"5be1b1cb-ca84-48c8-b01a-212c05cb00ab","year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.259262Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:28d5039b065411d7d0c77b7bec0594fc7cc0aca5a344fd26bad94fc8d5291795","observation_id":"9abd5ba0-a086-49f3-b2a9-ba501613af9a","resolution":{"observed_at":"2026-08-05T14:42:40.669182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.656536Z","title":"Minari: A dataset API for Offline Reinforcement Learning, May 2023","venue":null,"work_id":"9197e9b7-cec7-48f0-a608-028937ebe5a0","year":2023},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.261880Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:e41a96b8c758267a5959351596b2494f09456711c3cba51194cc427ac0d85b6a","observation_id":"b8472015-6dbf-445f-9000-fd070d72262c","resolution":{"observed_at":"2026-08-05T14:42:40.659532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.646711Z","title":null,"venue":null,"work_id":"0fb99fb1-3af7-48d2-a05e-cf52c4b0c7aa","year":2012},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.264959Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:48962365af011236757556d84203ca5df16bd832516a74488e86d94c9d610386","observation_id":"eda7e638-53df-464b-a719-a941c2c25074","resolution":{"observed_at":"2026-08-05T14:42:40.649566Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.637811Z","title":"Zheng, R","venue":null,"work_id":"ffca7c24-0747-409a-8251-c70359673409","year":2025},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.267804Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:8cdc10248a9fa21bac9855344ade50009efcc6c8cb4ad0f0ace2e839392ca216","observation_id":"3a3a74e0-b163-45cc-82e1-6634a95b9d06","resolution":{"observed_at":"2026-08-05T14:42:40.641119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.09671","last_updated":"2021-06-15T07:15:40Z","snapshot_observed_at":"2026-08-16T18:50:25.068009Z","submitted_at":"2021-01-24T08:21:04Z","title":"Pruning and Quantization for Deep Neural Network Acceleration: A Survey","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.09671","snapshot_observed_at":"2026-08-05T14:42:40.270613Z","title":"Liang, C","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.270613Z"},"links":{"cited_paper":"/paper/2101.09671","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:92479cfd17ab2c268aee8e44bcf976fb10e63d1d6cadaea0700eff373bbd9359","observation_id":"fedaca92-9384-4feb-ad7b-de90d7c20074","resolution":{"observed_at":"2026-08-05T14:42:40.270613Z","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-05T14:42:40.628530Z","title":"Kleinbort, O","venue":null,"work_id":"9b2806c8-4bec-432b-a3b7-40eb0f2f4189","year":2016},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.273620Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:0ff6c2969b94733d22f91871c588d4ffd745254d32f812fbeeb3f2c1f20c2dc9","observation_id":"b3af3113-834d-46f7-88f5-251546596daf","resolution":{"observed_at":"2026-08-05T14:42:40.631611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.619630Z","title":"Elhafsi, B","venue":null,"work_id":"0afb1e88-023f-4530-ac28-c4a6304d2f78","year":2020},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.276035Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:cfcc247a02038b01085b3a129ac12b2105556baa07657569137aef2aa5092c7a","observation_id":"1657d63c-0b5a-4075-94dc-20a9f82fc4a3","resolution":{"observed_at":"2026-08-05T14:42:40.622796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.278738Z","title":"Koenig and M","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.278738Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:fc40236d35efbfba54a64f0086d2251369ce66d182e6d63a224d1564489978cf","observation_id":"c129c0bc-b163-409e-977b-d338951d1bf2","resolution":{"observed_at":"2026-08-05T14:42:40.278738Z","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-05T14:42:40.281980Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.281980Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:e40ee4282babf27813afa01a43c6b2de7f6b38cfa4ff6c4ca2c699b3a88bba7c","observation_id":"c9921bce-968f-4245-bab5-d517515ecbd8","resolution":{"observed_at":"2026-08-05T14:42:40.281980Z","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-05T14:42:40.598526Z","title":"Kaufmann, L","venue":null,"work_id":"7478ee9e-5c36-46c5-a4ce-ca68f263af44","year":2023},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.284937Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:9d86b5271de311637c699612fb551f3390939dc7bc2fbd20ff8a76c49fbf1380","observation_id":"23e08d87-445f-42b8-96f0-f815a2d4a75f","resolution":{"observed_at":"2026-08-05T14:42:40.601408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18892","last_updated":"2025-02-01T23:49:26Z","snapshot_observed_at":"2026-08-17T21:25:19.816980Z","submitted_at":"2024-11-28T03:53:14Z","title":"A Comprehensive Survey of Reinforcement Learning: From Algorithms to Practical Challenges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18892","snapshot_observed_at":"2026-08-05T14:42:40.287382Z","title":"Ghasemi, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.287382Z"},"links":{"cited_paper":"/paper/2411.18892","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:40085450d0252ee6bdda7b09a8caf7a57566c185590d20922181c6ea62be095e","observation_id":"160563b1-a527-48d6-a5cd-619c26980934","resolution":{"observed_at":"2026-08-05T14:42:40.287382Z","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-05T14:42:40.589727Z","title":null,"venue":null,"work_id":"2c58d3a6-cfd6-4c99-b296-70e5a98c79df","year":2025},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.290121Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:a1219cea26968bd251c4cdaa791b5fdd7fc5bd0d2c182a5a44d54faaf62258b0","observation_id":"8384e866-5011-472f-a8c7-fd528fec5b45","resolution":{"observed_at":"2026-08-05T14:42:40.592710Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.14545","last_updated":"2023-09-28T19:26:34Z","snapshot_observed_at":"2026-08-16T14:57:41.813694Z","submitted_at":"2023-09-25T21:42:35Z","title":"Motions in Microseconds via Vectorized Sampling-Based Planning","version":2},"cited_work":{"arxiv_id":"2309.14545","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.14545","snapshot_observed_at":"2026-08-05T14:42:40.371184Z","title":"Motions in Microseconds via Vectorized Sampling-Based Planning","venue":"cs.RO","work_id":"e36e766f-8fa2-4be0-b081-b110706c0ad8","year":2023},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.292750Z"},"links":{"cited_paper":"/paper/2309.14545","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:1b57c4532a7f350b7b5fc8f6d33b6b452d7fdb50cf65461770785284d54d6506","observation_id":"07497f1d-0358-4dd1-aefe-53879792aa14","resolution":{"observed_at":"2026-08-05T14:42:40.375137Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02502","last_updated":"2022-10-05T20:19:21Z","snapshot_observed_at":"2026-08-11T15:38:14.931716Z","submitted_at":"2020-10-06T06:15:51Z","title":"Denoising Diffusion Implicit Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02502","snapshot_observed_at":"2026-08-05T14:42:40.296151Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.296151Z"},"links":{"cited_paper":"/paper/2010.02502","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:d6ef4f7ffb7d4e3a87748580dd8c2a6f35f70f6eda9dec7b19149a82953c1668","observation_id":"055f8600-11f0-4115-95eb-8df8df2ba740","resolution":{"observed_at":"2026-08-05T14:42:40.296151Z","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-05T14:42:40.580412Z","title":null,"venue":null,"work_id":"a352c701-1e8b-4ea4-9b80-10e8b85a1c8c","year":2021},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.298947Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:53c09187f7a8a43501c6a3bf7579dfffa52cb6e2e514d175f906ce41342c4544","observation_id":"ffe7571e-ab5c-4312-aa1c-7789cf35f856","resolution":{"observed_at":"2026-08-05T14:42:40.583585Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.570628Z","title":null,"venue":null,"work_id":"70992b27-22f1-4185-b650-eeb22f1be6e4","year":1992},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.302324Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:ceecf056cdde50c58d1d258d71260ded855dc0820a352022d010b0787f03adf5","observation_id":"e0c49f7e-479d-4dca-9c7b-e804d2e7ace9","resolution":{"observed_at":"2026-08-05T14:42:40.574014Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T14:42:40.560412Z","title":"Nechushtan, B","venue":null,"work_id":"9ce74455-2ac5-4924-8ed6-b24d147933b1","year":2010},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.305226Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:7e1562d10ee87016311684276a5c8d90ad25b62778305b8f6e4fa4f76455816e","observation_id":"1685d6a8-ebf3-4060-94cc-dde70b32d5ea","resolution":{"observed_at":"2026-08-05T14:42:40.563878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17032","last_updated":"2025-11-02T13:42:19Z","snapshot_observed_at":"2026-08-13T22:24:37.672685Z","submitted_at":"2024-07-24T06:35:05Z","title":"Gymnasium: A Standard Interface for Reinforcement Learning Environments","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17032","snapshot_observed_at":"2026-08-05T14:42:40.307480Z","title":"Towers, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.307480Z"},"links":{"cited_paper":"/paper/2407.17032","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:91f1d237cef323b31bc72b0e82fd57c5bdb8f4625c45078e21136231cb16f089","observation_id":"3abbe8cc-89d5-4a53-80e9-f2192a74ac7e","resolution":{"observed_at":"2026-08-05T14:42:40.307480Z","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-05T14:42:40.310660Z","title":"Virtanen, R","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.310660Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:2852d599beab47154a5f0fad1f7ebb0dda43351385ac8d27ead54855915938b7","observation_id":"0dcfe3bd-1b3d-44e3-b1cb-5733b23dff99","resolution":{"observed_at":"2026-08-05T14:42:40.310660Z","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-05T14:42:40.702523Z","title":"ISBN 978-3-319-24574-4","venue":null,"work_id":"8b7995d2-516a-4430-b837-cdbf749091b8","year":null},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.247946Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:57b999b678caa7e2e4632fa957c7915469902596a9519bd2b2780b104c63b288","observation_id":"a373ae9a-d23e-4d62-b301-e4ea5b4f30f6","resolution":{"observed_at":"2026-08-05T14:42:40.705624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.00909","last_updated":"2018-05-20T20:03:59Z","snapshot_observed_at":"2026-08-08T20:31:18.897748Z","submitted_at":"2018-05-02T17:11:20Z","title":"Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Review","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.00909","snapshot_observed_at":"2026-08-05T14:42:40.105528Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.105528Z"},"links":{"cited_paper":"/paper/1805.00909","citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:3b2966b15768ed89530d4c1af12b7a0c8fbeee4298ee606374476ebbd752b3ed","observation_id":"8cd7c5d7-a579-41aa-82cd-bd5fb0e14288","resolution":{"observed_at":"2026-08-05T14:42:40.105528Z","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":"10.1007/s10846-024-02117-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Journal of Intelligent & Robotic Systems","work_id":"9490e9ba-19bb-48f1-9337-7088b2458caa","year":null},"citing_paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:40.083216Z"},"links":{"citing_paper":"/paper/2508.21001"},"observation_digest":"sha256:05f53c8fd112968afe59163827a58be190d46c2a4500530b2e186b77d7255a54","observation_id":"e2e6e3a7-bb98-40b0-b1b4-5a2e609ecb7d","resolution":{"observed_at":"2026-08-05T14:42:40.346055Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.21001","last_updated":"2025-09-05T15:50:08Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T23:39:18.939909Z","submitted_at":"2025-08-28T17:04:00Z","title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees"},"reference_resolution":{"displayed":85,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":51,"verified_exact":3,"verified_fuzzy":29},"total_outbound_references":85},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 85 of 85 outbound references and 1 inbound Pith citation observation for arXiv:2508.21001."}