{"as_of":"2026-08-09T03:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:614500952fb8d33e218723b72f0c12ed5f81799883bc2cc07e491026dcba7713","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-08T06:32:00.761636+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-05T14:42:38.564154Z","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-06T21:48:58.774893Z","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:a22e186581b3d17bce016a6524f798b337b70565d62ee9ca05fc38b222facc9d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:9ab882408defb2284c17c1661ae6dda1e17daaa73eee204e1ef4eea6d939de10","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-05T14:42:38.564154Z","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:862e1dd33ac8c97e3e7e60039b4aa7f311d94ebde829fa4539e1eaecb64a6f9b","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-05T14:42:38.564154Z","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:f3a2cfd2f27a3f2393a71efdbb53a2a5206ad991a75866f981f685fa6ac8e68a","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-05T14:42:38.564154Z","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:86ec555305d575e7391688ac8de79ae2867f80af9838ff512f0d72587a972447","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-05T14:42:38.564154Z","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:f2a65b5f89f0f429571780f6598250976ad1d32cad0848819d34ee1770f5c18e","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-05T14:42:38.564154Z","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:ba2b829aaf4aa8fbbdcc5e2ed653b9b91d11529d12188c156e194098832eafc1","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:3f27c2ac613b22f8d4b324857670f6bc4193829ee22322e013aaca1fa9eca70b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:3e5feac9a968f30b8c1a2cd14e701fa9dc467739a9319651cfb666b200a2383d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:0488597df1997a92950e2c6d44a63a855b8c6ab6175e00f4e6b5d64654ef3c86","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:2d40b73bc4d1eba414b76f590e9f2c88cafefc6119182cfc7153bd81cdb85f51","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:ac1924affc435f519277eb6ca24487750c2e8697af5bf728ddeebe4d1b16a418","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:a5df5eee293f8256c3ddd796e8d1d1a5af058df7bed4fdf14515c786b906384f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T02:11:23.670680Z","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-05T14:42:38.564154Z","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:f0f297ce606150ce6f062aa3df87b33e8b18659e6d10a140a7e2d4a050554f37","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-05T14:42:38.564154Z","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:646481ce2491a7e824aebbcc92c0a264b9dca4ef7504f95527ab9755dd6c3c03","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:7d2f9a9ddf758ebd59c3fba27b35246f95bfdc41a50074ac634bf4af29b83c29","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:a867608330b1d90b569b9a8d7316f69c04520dfce26a4c59c4261e38a158ca03","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:e54c765b0bc0661e519b4d30b7bf0e3fa39cabc28ce0d1edc2fff240a3ec1d15","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:c9ccfca86bc56e23a3537cb7a917881ea20e4995d6ee69361a3130c723e8f484","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:baef66afb904406d3ba29adf9e90e87bca53c21cded48eae45a53f39373a6a9e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:b1bcd4002b880b8226e2e8eaf0647aa3b7f59e2a7ddd26090729182a7b2d1be5","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:8605791852a24794fdb4a026cefabc6907d69cd18d761e25a7078c584d1df63b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:42:40.333031Z","title":null,"venue":null,"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-05T14:42:38.564154Z","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:773b072a5d3c0e8855ba33f45232163a6cf772a4040b5b5542400ed21917f682","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:ba24f72fe725ed53770bb55ecaebf9db37d9fc17fae188b840a4fd839eaf5fc8","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:7fe04d2eb77aa03857439d9a9be8cc7d0d71c65ecf563f5f13b8cfa6b49adcfa","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:46a119482518ae9cac6112b4b3fc827164d38a12e5f89cc689222f3866fb3c1e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:597a03c449a5bd5a87134699b33ed15871479c5826df5a216a09996a545b2314","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-05T14:42:38.564154Z","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:04252cb23f6d458396f6d132bb6b1d90a3c9f46ca5ce343ca148fed931ca753a","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-05T14:42:38.564154Z","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:8aab33abea1c2200e269c536a11a8ddc1c4c6790cb58760755fe944f8cd39ada","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:724eb2161278e5ba61736791201e269964b01734fdff7e0f833944cd9236d1af","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:6aad0472ec8dc9af145486c57b3d46a06c7976273a064c2e6e49959e3c1d42c8","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:086440646ddd547a39b47b9d127df872d978298690ba44f34e35f5fe2928aceb","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:044ed6254b3ec22c1e0474bb740ec00d880d188362f7e52a03a75d593244fdb5","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-05T14:42:38.564154Z","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:06e20674e81311f79333fc54ff128249771002b7f4439915750446b80339014e","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-02T18:24:58.914589Z","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-05T14:42:38.564154Z","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:d60c0181502b83f0141b654841d639cb8e691b008258592222c7ff8557d84b94","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-05T14:42:38.564154Z","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:df3d975c962b1349b3da203e614c0345d44a519fb4387cdab8f762ad5054ca5e","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-05T14:42:38.564154Z","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:6b3b4d1606498958933695c9f0b33f54fbddaad666672afdcb3eb13342be847d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:9d295cd5a0bf93139de5e5ed9464f788444e6be7fe050199f5f1726c16501369","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T14:41:25.716223Z","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-05T14:42:38.564154Z","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:8c0e924fc55c0cf72dec988ee856ca7729a7e55fb419c467fb2b54740cb180ab","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-05T14:42:38.564154Z","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:d7615dd927785cb3045e7c5277c1851a81a90efc4a7ad9f4adc94cf2f908ca9e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:500dd1fc00e6a866c0d216a1f8c7073fe5acb7cf9de108bec5d7042777f8fbd7","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T17:21:18.265715Z","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-05T14:42:38.564154Z","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:0cd506eb6619bb69ce9609a3a6dfaa296a52cd1213eed57377e657cbaa7a5b02","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-05T14:42:38.564154Z","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:de0d9f6da41faff68afb21622cc065cf86772db9d66608ba91eab108b478a05b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:5fd25b002745174ecfdf7476f198bc9eeec4bd252fcf3489f58e27b5acb9510e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:f1dc6fe941a849b2419a49f07d582134f7bbbf4f35bc9a2636cac1a8a662570d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:71c1ed8b146a5e4b57c8de6f39916e068c24d817593969a5515242bc6c12387d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:c7357190fc538cc4a622ec0fd42237945f3ff21ea5a5370debf73312504c761c","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:8a1eecbb754d3ffa9797fec9f0966257ab832bf103f396deaa67f7fe28e1bb88","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:9912591772abbaa908894893d61b904a40580dd0615b3bf2ec2e1cc74c198e40","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:6af42e2715b0ee58281eb681d52c9a660c77d4541ec0b24e4a852d0e9edcf209","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:fdccf4269ed07bbcc68df1b94311eca399249d542d953a1d6136537293eca893","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:315961bb4c22d14aaba67a292c1c7bd8792863e75d49e8ccab2363c3ec15b74e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:4bc009c076a465ecf2658f4a694e8d42fa677af8a8d7c5b9e1cf33ef2c85f9d3","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T16:27:22.878185Z","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-05T14:42:38.564154Z","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:bebc69389d5c44580212deeabb6f1f648aa1bf3c60231390a6642ba172be6aa9","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-06T06:00:31.009819Z","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-05T14:42:38.564154Z","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:09e853a6305f98c10d5333e03b8101c740bffc351f453fc858f8f6e4da0deb48","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-05T14:42:38.564154Z","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:7516183037709bf4cb5d8b67ab52bf2cb5d497fb1a249b72244d0efac465d17c","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-05T14:42:38.564154Z","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:41cfae5723cb2ed377f7fe2188828ac62187c7765a8431a0a3466c3dba9b33f8","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-02T20:27:48.466035Z","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-05T14:42:38.564154Z","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:2df0b827aa06ca170410f73d329e6faca69cd43517f52a530b74feff16c6e0c1","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-07-06T19:34:32.629776Z","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-05T14:42:38.564154Z","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:551f443a60fa5e8390700e7fc776db605fc8066429fe34df9a88ccc1d7505fe4","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-04T09:34:09.818156Z","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-05T14:42:38.564154Z","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:b5cf53aebe281f5cced9ec75713dd21ca34bd16e95e5989a98119175cafa2522","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-05T14:42:38.564154Z","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:090963380814d05915d77310779934057028996311ec44d3de69716f2f939f0e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:70362d489262f0fb38ba3eecee6efe1e9f954ebce94c37364f3095b85ae4097f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:8a4b50465c106b899fac793119c997be4039f961176de57ba395902504e16c25","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:12212e5bb92eba2de986244800fd39c6bd16e4f74afcb4e9fb7e9b7d1f97e9b2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:4e9f9702a13e01bb7ae2d1c163fec8f02a742cf87327d6fc96331505fe1bb694","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:157976ab8b5dd450f715cfc1ba8229b62bbb5818634bef7c4635972e878ef9e7","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:b79171e9ba94b78a205fa809ef47e4dce5b92ce4cc5fcf8e737dfec85d53cc54","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:30b134fa7fa2914e2912af8d41d5f028d1989b3bcd548d4b3c3dc540d126a587","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T10:35:00.273588Z","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-05T14:42:38.564154Z","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:f847ea5676576a5f4bff4eab26b917d9e991db341752776736fe7e89faf691e4","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-05T14:42:38.564154Z","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:e2af24ac2def7d00683bf5eea65bd55c16b3694b7db99712d477ebd9554f9e93","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:eca7f734d7741cd1ae734c2e40f8a291c8dfb45feb15d2e426ae0c63c32a2cc9","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:21767d1ff1690cc9d22b6744ea403c5e691c66ff3680df640a897bd7409ee9b4","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-05T14:42:38.564154Z","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:8fac2757eeb5c1fd5ce4c5a190208ae36ec7bfe4de1c49dfb07679d9512d736e","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-05T14:42:38.564154Z","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:34afb223a69a49cd6eda57504a926ff02f2770df650cf4919d2c6d6092ecf51a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:39:56.385826Z","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-05T14:42:38.564154Z","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:a6e7145feb9c56cfa8a4ffcf81eecc578cb00ec98cff14576c7638dbbe888038","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-05T14:42:38.564154Z","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:d8be570eeca6ae8d8ebcf3fd1aeb2f24f2b6934c7b447c7344c94064f71af0d7","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T04:30:34.125084Z","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-05T14:42:38.564154Z","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:f7f35ea0183c98455fca6291e60b3e09ae96fe3d4316a900e17d290fdafd940e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T10:01:50.133383Z","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-05T14:42:38.564154Z","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:acc3e1943bbf0046df82a5794d76a224633a2c64bd46ce39d4ac669215d4b3d9","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-05T14:42:38.564154Z","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:c0b8dfdab86a1ffc13d5b7d53eea57732a56e53abba2a818f0a86b3831c1d8c7","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:ce2bada847db8672971d4704f729480a8f43e8e45a4297ae8165b45333954875","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:c012d63793869179cd2c9d614586a46c878679d49264c8e6f08bc6059fd00700","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T18:51:06.750136Z","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-05T14:42:38.564154Z","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:6ada357c60e31be9d05519a4a4e057993c2fc23417f8cdab05ae89c7f08ced10","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-05T14:42:38.564154Z","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:cfdd38e60e5e1767b8202d57cca9f887b23fa78cf81d1f8296562fa8dceadc8d","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-05T14:42:38.564154Z","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:cbf4a6e37fb299cc51bf0d6eeacff1509f2bcb9bbe925c83b6d5d700f0a10e80","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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:3e9292f1100ab4469a55e6f5127540dd53fbb96fd081b32016a9b8fe126f0f7c","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":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:42:40.342842Z","title":null,"venue":null,"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-05T14:42:38.564154Z","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:ae0b81edd57753980a21605157bacdeb24a9de7e3aaa04ad639eb415e0d9fa08","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:42:38.564154Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 85 of 85 outbound references and 1 inbound Pith citation observation for arXiv:2508.21001."}