{"as_of":"2026-08-10T10:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b44fee7a2af0f8a471765283f1e4231213f23e7f23cbc0d8690c2f0cfc078a1","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:06:14.998890Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.06605/citation-record","integrity":"/paper/2507.06605/integrity","json":"/paper/2507.06605/citation-record.json","paper":"/paper/2507.06605"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:14.902064Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.902064Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:dafa2ff9e1937c0241835f6324d286d8005536d323186709d25f71f0b7cc47af","observation_id":"efefda2f-9b41-4a8e-9b12-ea84c4380d7c","resolution":{"observed_at":"2026-08-06T19:06:14.902064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:14.905884Z","title":"A formal basis for the heuristic determination of minimum cost paths,","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.905884Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:cdd5006bd7276484d26fc98a4170942bc8ede1d4869a835284fec54505ce10d6","observation_id":"b7b13b95-ccf9-4f14-8f00-7bae5912704c","resolution":{"observed_at":"2026-08-06T19:06:14.905884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.269277Z","title":"Rapidly-exploring random trees: A new tool for path planning,","venue":null,"work_id":"8e5ff073-10c6-4872-9fde-c831425ffb17","year":1998},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.909047Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:7c126ea808c52334440b3c082760a536c0408fab5877da5ee9be4dd568c516e2","observation_id":"12eb4fd0-dfc2-407f-9f42-19e94aaeb325","resolution":{"observed_at":"2026-08-06T19:06:15.272098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.261255Z","title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":"95443a30-30eb-41d9-b0f3-f19d37922eff","year":1996},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.912517Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:928c08cfa08dab6e7b9506296a70b6f04fa94121ba9002bbed6cd8e6fe0b5166","observation_id":"75ff86f7-39b8-4267-b659-5f636a6973a3","resolution":{"observed_at":"2026-08-06T19:06:15.264307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.253011Z","title":"Rapidly-exploring random trees: Progress and prospects,","venue":null,"work_id":"2ccac7b5-b488-4009-a840-23ea701f7e84","year":2000},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.915656Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:18b68802c26119e78c245aa218902df091a8e6eb809cd03d5bb27d6a1e08e051","observation_id":"f9593df6-8ef7-4f99-9e0e-c9a7ad63fb2f","resolution":{"observed_at":"2026-08-06T19:06:15.256053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.244407Z","title":"Learning-based near-optimal motion planning for intelligent vehicles with uncertain dynamics,","venue":null,"work_id":"99a85af6-0115-478f-9830-c9f8fdd885f2","year":2024},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.918717Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:9cd3590d393786eff1036de8fe42f6d88dd51b14fdc78a60ab71c31a301dccd1","observation_id":"00394420-8794-411a-9532-4c68f477d6c4","resolution":{"observed_at":"2026-08-06T19:06:15.247478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1801.01290","last_updated":"2018-08-08T21:27:08Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-01-04T09:50:50Z","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.01290","snapshot_observed_at":"2026-08-06T19:06:14.922455Z","title":"Soft actor-critic: Off- policy maximum entropy deep reinforcement learning with a stochastic actor,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.922455Z"},"links":{"cited_paper":"/paper/1801.01290","citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:8729bef5e504ce49fd31b968b8b49b4999b0cd9d72ed49c61cc2e4da3a25e6b9","observation_id":"ab901361-1206-4207-af44-a987e375869c","resolution":{"observed_at":"2026-08-06T19:06:14.922455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.236460Z","title":"Optimal and efficient path planning for partially-known environments,","venue":null,"work_id":"22354df8-96e4-4556-b228-8a07fab5b6f2","year":1994},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.925625Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:3fd5e3880a75d1338ade759f88378f0a478a59fb35c16c3312fa5f2a3b3f5050","observation_id":"5accc70e-bfff-4a66-bb3e-662ac26237b7","resolution":{"observed_at":"2026-08-06T19:06:15.239396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.228645Z","title":"Using interpolation to improve path planning: The field d* algorithm,","venue":null,"work_id":"15e8eb82-2805-410d-ae36-f070cb081c07","year":2006},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.928369Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:22c2b80a48cc21c0d5b9e49337c8cce9e202f219fc13321b6a122bff687e3468","observation_id":"1b937472-e40f-49d2-91ed-b1951d973b5f","resolution":{"observed_at":"2026-08-06T19:06:15.231374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.219608Z","title":"Lifelong planning a*,","venue":null,"work_id":"67a67ad9-b23d-4ab9-9f0c-dfa17514a5b4","year":2004},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.931140Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:e2777cf390b74d5250c3d8f8701dfa0bb9db237a266d83808ee6cb50f7cfa9bb","observation_id":"3c597294-5c59-41b8-843f-11aa6ca2afb1","resolution":{"observed_at":"2026-08-06T19:06:15.223471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.210459Z","title":"The jps pathfinding system,","venue":null,"work_id":"82d97ec7-7dc2-4adc-98ed-cde7016c3eae","year":2021},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.934044Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:7d9f494b3a21327c48793c3506f160012d5de232c9ed17419c5682f25c416253","observation_id":"c71fa56f-23b0-4964-9ac6-e1af86ac5c15","resolution":{"observed_at":"2026-08-06T19:06:15.213258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.201822Z","title":"Improving jump point search,","venue":null,"work_id":"4acd1a35-7775-475b-a067-10165ddc8710","year":2014},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.936967Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:4dfbd87232689cf64aa2accc2e82519f027ef90effd9b9fc7a6d4e94427d31dd","observation_id":"6a044c86-b216-4199-8586-22e9f1bb0af3","resolution":{"observed_at":"2026-08-06T19:06:15.204512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.193549Z","title":"Theta*: Any-angle path planning on grids,","venue":null,"work_id":"449f9c8f-8751-4a38-a80e-c0ec977fc705","year":2010},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.940107Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:bc441cf1728597699415476136740946142047252ac94091e666b34a54ba21a8","observation_id":"d8727142-c72f-4a0d-94be-5be64684bb24","resolution":{"observed_at":"2026-08-06T19:06:15.196297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:14.943230Z","title":"Randomized kinodynamic planning,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.943230Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:12aeab47bbe403315b7342fffecfbc13912ad5cbd0803058818935cd75648466","observation_id":"a9ab879a-f74d-4710-8d7a-4833cedcc5f4","resolution":{"observed_at":"2026-08-06T19:06:14.943230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:14.946592Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.946592Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:8833fe68a1e8c2732a3b0f90af8ae393c114eb3a645994fee3252477354bd40b","observation_id":"37cb964d-db82-44c0-b8cc-a97e01322607","resolution":{"observed_at":"2026-08-06T19:06:14.946592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.184348Z","title":"Rrt-connect: An efficient approach to single-query path planning,","venue":null,"work_id":"719ef65f-0b57-4490-9fe4-d9940811c1cd","year":2000},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.949606Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:8879907ed6b1d99af3391456b4323683d706b496eaaa1acb62390e9296640188","observation_id":"22f2f44b-c0ad-4ab6-a572-f14743611f72","resolution":{"observed_at":"2026-08-06T19:06:15.187753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.175916Z","title":"Informed rrt*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,","venue":null,"work_id":"09a9bae5-4176-4134-a5ff-43c0df04a4ce","year":2014},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.952228Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:84d3a2119b2317eb013efed23c179d99a8a4a039d28b2e28c33a74a3375eeaf2","observation_id":"48cc1b9d-c66d-43ce-a1cd-49f0a8b1e626","resolution":{"observed_at":"2026-08-06T19:06:15.178925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.165540Z","title":"Batch informed trees (bit*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs,","venue":null,"work_id":"eda094a1-c2d8-40d0-a07c-b9123bfd11c3","year":2015},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.956550Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:82d6759d84cc7498ffaf4f34035022f3bd7a8e3cc451b379b7d94da3d298d772","observation_id":"e7e5b17c-615a-4c91-a41e-20a8f98ad9ea","resolution":{"observed_at":"2026-08-06T19:06:15.169685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.157378Z","title":"Advanced bit* (abit*): Sampling- based planning with advanced graph-search techniques,","venue":null,"work_id":"bbd57871-d166-45b5-bbcd-9afef0cc37ca","year":2020},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.959257Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:158c6ef142cc02ce4529684904303c2d6d8ea0ab1d7a76dbcf43b427239760df","observation_id":"08d69303-85d9-42c0-b2bc-b083650a61d1","resolution":{"observed_at":"2026-08-06T19:06:15.160294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.149442Z","title":"Adaptively informed trees (ait*): Fast asymptotically optimal path planning through adaptive heuristics,","venue":null,"work_id":"3e09d4fb-9673-47ab-b863-dddfb332c64d","year":2020},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.962373Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:4e1a79ba1ada4bd8ce72572a1ea1db67e6e9562d7a1c0d300b5f28bbdc78c8b6","observation_id":"4e9fedca-a4b7-4548-adc8-25fd51bffbc5","resolution":{"observed_at":"2026-08-06T19:06:15.152443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.140500Z","title":"Pathrl: An end-to-end path generation method for collision avoidance via deep reinforcement learning,","venue":null,"work_id":"317d2514-da84-44e2-9637-72f45224700c","year":2024},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.965261Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:9be3f77f92d9084baa58ab2c3e47448954ba095287b2280c43d7524769ff6e5c","observation_id":"0c72c5c8-6b95-4492-a577-000e8a683c53","resolution":{"observed_at":"2026-08-06T19:06:15.143466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05864","last_updated":"2024-09-09T17:59:45Z","snapshot_observed_at":"2026-08-07T23:22:22.717149Z","submitted_at":"2024-09-09T17:59:45Z","title":"Neural MP: A Generalist Neural Motion Planner","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.05864","snapshot_observed_at":"2026-08-06T19:06:14.968446Z","title":"Neural mp: A generalist neural motion planner,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.968446Z"},"links":{"cited_paper":"/paper/2409.05864","citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:0c6796d667a7b0f165e794fcba163bddab920df96e45d5ceefffa783ebddede0","observation_id":"6aa0c1fe-b30d-4e38-8212-ee8a3cd3ac2f","resolution":{"observed_at":"2026-08-06T19:06:14.968446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.130267Z","title":"Prm-rl: Long-range robotic navigation tasks by combining reinforcement learning and sampling-based planning,","venue":null,"work_id":"c701afbc-b1a9-4ec0-90d5-f2446f5c75ea","year":2018},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.971409Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:864ac9d2e696f40d4f116aa7718d53be7e343d28f1df0517d607ef82677dd518","observation_id":"9130087a-9428-4e28-a4da-ea403577b2e2","resolution":{"observed_at":"2026-08-06T19:06:15.133997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.121090Z","title":"Rl-rrt: Kinodynamic motion planning via learning reachability estimators from rl policies,","venue":null,"work_id":"140f8356-6752-4a66-ba6f-40723684a404","year":2019},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.974174Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:803ea2ef7bb63c20377443fc1c5266651ab82d8eca6d6eb96cccfb848ac45c4d","observation_id":"27950d72-5480-419f-b458-7dc2c9227fca","resolution":{"observed_at":"2026-08-06T19:06:15.124583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.110832Z","title":"Mobile robot path plan- ning in dynamic environments through globally guided reinforcement learning,","venue":null,"work_id":"7602457d-3ac0-47b7-8d07-35f95b60918b","year":2020},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.976963Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:76af9e6bc2521ab27e1ebdc4806e13bce75f22d97abe4378c23b1b2e7ae93fcd","observation_id":"7674560c-761a-4f10-9dd4-cf0acf3e3fca","resolution":{"observed_at":"2026-08-06T19:06:15.115227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.101838Z","title":"Learning-based motion planning in dynamic environments using gnns and temporal encoding,","venue":null,"work_id":"71d6e6b6-21c8-4ea3-834e-954ea309ee1b","year":2022},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.979633Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:91f0bc84c0a35ff510b891850433915f0fdae37c3ca4679368a307797c125b94","observation_id":"3556af6c-fc64-4cf2-90a2-7807dfb4d818","resolution":{"observed_at":"2026-08-06T19:06:15.105180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.092285Z","title":"Deeply informed neural sampling for robot motion planning,","venue":null,"work_id":"894aea43-c946-423b-903b-e843b8d46122","year":2018},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.982300Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:e7c44b773307ba0f2cc8e28e37f9d94b0a027d78cc6282d6fc0e3e4b3e36776b","observation_id":"20522d33-b57d-494e-9800-bd40606ae4e4","resolution":{"observed_at":"2026-08-06T19:06:15.095240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.083849Z","title":"Learned critical probabilistic roadmaps for robotic motion planning,","venue":null,"work_id":"2bd853a4-83e4-4e69-a49e-696a32686bb6","year":2020},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.985020Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:b99fc2ed243ec754937783e5496a0a6e426f503cd40e5f8ece15d652836e5518","observation_id":"ed4c1a62-39cb-4c58-9380-d77be7eb7425","resolution":{"observed_at":"2026-08-06T19:06:15.086848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:14.988015Z","title":"Motion planning networks: Bridging the gap between learning-based and classical motion planners,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.988015Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:82b72051f4562db33148d235c36377608b1133fe832955f0b1738e3f47f2e69a","observation_id":"cc262bc9-ef70-4918-9162-2306f432209b","resolution":{"observed_at":"2026-08-06T19:06:14.988015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.070155Z","title":"Neural rrt*: Learning-based optimal path planning,","venue":null,"work_id":"d2594d4b-43f0-475a-b8df-6fdc3c6eee47","year":2020},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.990794Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:b7d9b237002d4c0e3606376e21b69f1b6440e27ed3412f24543087f3541b10fa","observation_id":"87d6ad5a-b10f-4af6-baa9-3dbe7628f008","resolution":{"observed_at":"2026-08-06T19:06:15.073146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.061531Z","title":"Neural informed rrt*: Learning-based path planning with point cloud state representations under admissible ellipsoidal constraints,","venue":null,"work_id":"018e0424-95b7-4abb-9562-b1515d95a105","year":2024},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.993455Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:95d4b5d6fc25003c459e8e453ad788c23b0a18b17026204a18749b7a5544587a","observation_id":"ef00b300-eed0-4cf5-9423-d00e66bd5618","resolution":{"observed_at":"2026-08-06T19:06:15.064609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.052870Z","title":"The Open Motion Planning Library,","venue":null,"work_id":"3065d2f8-7228-477d-bb93-805b7f051f3b","year":2012},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.996134Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:9449fbec57d4467607d2914f232028ddd98a58a27031da14a6c40e2aac2b2f60","observation_id":"229f6891-8c56-4338-988f-0dd224fde34d","resolution":{"observed_at":"2026-08-06T19:06:15.056008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:06:15.041860Z","title":"A new approach to time-optimal path parameterization based on reachability analysis,","venue":null,"work_id":"43a38115-6510-4516-9055-e128dae79d65","year":2018},"citing_paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T19:06:14.998890Z"},"links":{"citing_paper":"/paper/2507.06605"},"observation_digest":"sha256:2ec60d41410928a426879a2fc357ced3709504d9f8a4d4e1f39ca26cee15503c","observation_id":"a19a51f4-38f6-4b33-9d86-447edf3f65fc","resolution":{"observed_at":"2026-08-06T19:06:15.047225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.06605","last_updated":"2025-07-22T10:36:35Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-09T10:18:00.022396Z","submitted_at":"2025-07-09T07:24:18Z","title":"Growing Trees with an Agent: Accelerating RRTs with Learned, Multi-Step Episodic Exploration"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":26},"total_outbound_references":33},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2507.06605."}