{"as_of":"2026-08-14T10:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d8963cc98ac12049597ea0f45d0831e7f9f111aa7f6649314710560fe14cf424","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T01:08:39.494809Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2606.06618/citation-record","integrity":"/paper/2606.06618/integrity","json":"/paper/2606.06618/citation-record.json","paper":"/paper/2606.06618"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T01:08:39.494809Z","title":"TLDR: Unsupervised goal-conditioned RL via temporal distance-aware representations","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:0a108227ceda55659d309c1e91c33aa7f41dec062d7728f684480bcb2ab6e037","observation_id":"66b0271d-4b38-418b-b0f4-28b251654f44","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Graph-assisted stitching for offline hierarchical reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:c94f4cfb6cf3b073aa2c46f8aa272c0b7bcc2675ce232ef4d5e0b13657f98b7c","observation_id":"91b94723-4e33-4a5a-81ed-6a7a43a35bc1","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Universal guidance for diffusion models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:00b038e20a9a758b8e89ae8984f63a8ac82e3c4e7fd1de0983abaf9606ab2c40","observation_id":"a9b32750-87de-4ceb-a74b-047a467a9660","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Diffusion forcing: Next-token prediction meets full-sequence diffusion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:0e36e854f2d1884b7f34def0c7c0fb5ebcfd1a5aff5450c53392432561e5aefe","observation_id":"ef23959f-f1a6-4895-87c7-d99b8dd9401d","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:aa6d8fbd292d9ef25c813107fa17421467d07628e278ee53641481275474b3fe","observation_id":"db70b546-5ea7-488e-9cf5-2323ce331162","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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.1109/lra","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T09:34:47.869876Z","title":"Falanga, S","venue":null,"work_id":"c94bd22b-7fd4-49cd-a6c1-0618e1f2f7e0","year":2023},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:5040f39c8f6f56ffcf89887235332bfcb53a5f0daf18a25824d1eb0637d74195","observation_id":"9467068f-1b51-4f80-a718-f47e9fc02146","resolution":{"observed_at":"2026-06-28T01:11:28.171323Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-28T01:08:39.494809Z","title":"Diffusion posterior sampling for general noisy inverse problems","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:cddf148207dec4e10f067b485de4a280745b06b6212e6c6944e971d9ed7a03f8","observation_id":"e21974ef-1957-4062-889e-2a38277cceb6","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Dellin and Siddhartha S","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:f86911b95f2f848fbd874cc177d99ac268f5a59d125b08f06f4094bb4aebb16c","observation_id":"6617d4c8-9136-4518-b3b2-6fc543457bb3","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Diffused task-agnostic milestone planner","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:9d89a86b8b7b3f553876729b98aa4658db542d47b4845595d02aaabc3c8ff39f","observation_id":"999f6819-43a9-4615-af10-315266e6c6af","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Tenenbaum, and Sergey Levine","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:35d4cc5f7f5c8bea31ddb66f0b741ec9826e73ec37603ebe2b26d84b8f103bb7","observation_id":"6c0ae05c-e561-4406-89fe-ae3c6f59cd61","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Tree-guided diffusion planner","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:859b856a2d674844652f7ab141a0672399d922e6839f40447008801eb0efb322","observation_id":"f0d9c851-40e4-4dca-aa1b-c5c5af5e5355","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"State-covering trajectory stitching for diffusion planners","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:6e02a27dae5c5bc6786754f055eb0a20e4fe652d5bd452163e761aead3cf873e","observation_id":"26725a0e-6e32-4b2a-af70-a7c029bff501","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Metric residual networks for sample efficient goal- conditioned reinforcement learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:f538f9cc712a578ae2079b63daa127a83dde8ce7a2a5d57b52ca0d09a7c2ace2","observation_id":"b1507466-64da-467f-8d6c-4eeb16ee545e","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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.1609/aaai.v37i7.26058","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"210a2850-1ffc-4616-9f25-4e938bf7135e","year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:9149a721d5a696ade20b7692bba1f2b530ebdfad916804c7c113b16808a2f7ba","observation_id":"3bbf88a2-9209-4430-b61b-dfb3dc1353e6","resolution":{"observed_at":"2026-06-28T01:11:28.174581Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-28T01:08:39.494809Z","title":"Mishra, Yilun Du, and Danfei Xu","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:a24c49bb3bcc5170d4086e2bf3cc8ad73ded638eb8012946555a8b548196eeac","observation_id":"2cead1ff-c88c-4829-9441-2a206ab5d5c4","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Compositional diffusion with guided search for long-horizon planning","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:bf809a39ade69ea132b5456b57fb9c8f86a2cf42354873a13427c1cc6d5ce56d","observation_id":"7639748b-c115-4ac7-a191-cea9354aa189","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Dragan, Sergey Levine, and Benjamin Eysenbach","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:24960ba977e80c7ea5e0c954e5462d6548b2b06f6a97c7e4cf9e7c399e598077","observation_id":"6594bdc6-c5c8-4b20-bb62-2051b717d382","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Offline goal-conditioned reinforcement learning with quasimetric representations","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:b66ba2aafaccbba57dcbb415fb8698cf1ff5fcbe8a9647a67f2ec77a73920d4e","observation_id":"12025486-5c3a-4c68-8af2-91be6cc777d4","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02549","last_updated":"2024-06-04T17:59:32Z","snapshot_observed_at":"2026-08-14T01:11:10.994449Z","submitted_at":"2024-06-04T17:59:32Z","title":"Dreamguider: Improved Training free Diffusion-based Conditional Generation","version":1},"cited_work":{"arxiv_id":"2406.02549","doi":"10.48550/arxiv.2406.02549","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.02549","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"8c512bb3-af12-4a4b-8860-f20575746f09","year":2024},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"cited_paper":"/paper/2406.02549","citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:007c5656a8d6df42be2a374395e40a7a34885bc3b624bcc6a893a118d00d0791","observation_id":"543262ea-2a90-4766-90b1-4b6f6a1cd507","resolution":{"observed_at":"2026-06-28T01:11:28.173829Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/opre.2019","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T01:11:28.176775Z","title":"Adaptive submodular ranking and routing","venue":null,"work_id":"be5d82dc-0589-43f6-9232-36d234960f7a","year":2020},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:a1e2d545476da3de0fa17c802a0b29a0a3cbadb7f7930ada0f6b29b92965bc0d","observation_id":"32062e12-ce31-4331-a278-2da217485524","resolution":{"observed_at":"2026-06-28T01:11:28.178412Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ins.2018.08.062","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Taghirad","venue":"Information Sciences","work_id":"dcedd64f-4709-4114-9029-d78f8c4ed3d7","year":2019},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:a9f34b070e80552272a6bbd4ba0ce423e000e2b0556aa0fab88406bae4100bb2","observation_id":"2a2ebbf9-378a-4fa9-97f5-df889a666559","resolution":{"observed_at":"2026-06-28T01:11:28.172486Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-28T01:08:39.494809Z","title":"HIQL: Offline goal-conditioned RL with latent states as actions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:85170aef677d200897861a1c6e84765c3352c07b4ce6e67b41bdddc6a4b32468","observation_id":"928bc630-b3cd-4575-931a-cc27905d2584","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Foundation policies with hilbert representations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:d5ef6929a2e8ed8a21472e96507a220cf9841db475698805d968fdd85ab74ac6","observation_id":"9702c336-d58a-4248-a4b4-962e1597db9b","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Ogbench: Benchmarking offline goal-conditioned RL","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:4e63d830a9b1d306bd2528f6e9589b85c33207e0d3cc5ee88573417c838ad2be","observation_id":"a79de9db-21d5-4f7b-818a-63fa0bd514ab","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Transitive RL: Value learning via divide and conquer","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:85096d06f6132b9a2b4ac1a5a26cf648255ba9c43dbb0d3613028180ce53b090","observation_id":"5ec215de-b721-4482-ae6d-ce45dd67a556","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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.1111/exsy.12691","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The boundary node method for multi-robot multi-goal path planning problems","venue":"Expert Systems","work_id":"2510a382-5be4-4821-bc71-33370a3c1968","year":2021},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:76ba66553acea2e4a50891386c7f4644c05a2d0623469095d03beba0029531b7","observation_id":"389222ce-538a-42bf-b716-3374a44bede9","resolution":{"observed_at":"2026-06-28T01:11:28.176063Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-28T01:08:39.494809Z","title":"Improved representation of asymmetrical distances with interval quasimetric embeddings","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:71ecfe76ea9f00db91922b3165314e22928cae6b7e33698ba190d8a6a614a0fc","observation_id":"4bca4e76-a545-4cf8-a394-52c358dc5832","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Optimal goal-reaching reinforcement learning via quasimetric learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:c4c48147daad17662e8145bb7d8ab95ad59e949ca4c043f30741f63def80c631","observation_id":"c6a816d3-b004-4443-906e-84ca8ba914f9","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Hunt, and Mingyuan Zhou","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:af68e893eb6f77198407daae0cbed499c28f20e8224763fa82804ab73f3b8828","observation_id":"a070d129-cc21-42dd-b6c9-f9c76e08ac37","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Compositional monte carlo tree diffusion for extendable planning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:41607bf2980fd580c1726156ecbb8a1beb2a982a7f46f43474ea68c52f64586b","observation_id":"d82e241d-ea67-453e-9607-40b3f5366840","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Monte carlo tree diffusion for system 2 planning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:44a4de9408108f318c38ac67b90da4cccbb01aabb70cc02a2ad20e096b4c86ae","observation_id":"53bef9de-c8ba-4181-8ea1-cd8174e99c4c","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Multistep quasimetric learning for scalable goal-conditioned reinforcement learning","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:7de571d332163523aa00a10ee7f77767ff059356ce18778ffbe5bbd8ce1a968f","observation_id":"36b9596f-93ac-4bf9-be4b-3ff355ebb2e9","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"direct ˆX0 injection is always superior","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:99d1f703e07e40e572a622e01d3867dcc141054b675b2a2d45a4e290df4022a9","observation_id":"a57d9e0c-85af-4a4b-9f40-065104667b76","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:6ee8c67a66b811bd83214d7817e9a534cc92667d3f9c4b41415013e018e51525","observation_id":"e0eaf89f-92ed-4cb5-8159-82fe48033aaa","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:386d9d76aebaa285fa3e1489c8b0ce468297c896fb3b22c4d66f2c04223d1149","observation_id":"155e89c3-21b0-49c1-9c95-40b2477a0c03","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"In particular, we show that the suboptimality bound for the joint route ofMagents scales with the factor(K+M)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:e5257ce99f7c337b359ba665ba321c054cc81f48ab5fac341a04f50741752fe3","observation_id":"5818a0c3-2ae0-4b6f-9902-b5e2c0622b6e","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"Importantly, the guarantee in this section concernsall-hop route computation, not the entire final assembly trajectory as a whole","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:9aa742c14263e4312807bc3a171ab5d529007977ad00f37f99988ff085d28935","observation_id":"c18dd4e9-ba9d-48fc-9c83-b3ee49d1836d","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:0a91433f1f206325edbbbe14883c1d245658732531a4db80e23309227ef3f627","observation_id":"945c5884-2859-4f41-966c-7c6649da498c","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"29 Figure 2: Quadratic temporal-distance calibration used in Appendix F","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:8da89eda7e2d2a8bd189463523d80cb38f55cdb49984775142f682d6d2c3c9da","observation_id":"52a5b958-b2a1-4d89-8ac6-6aeed7671e2c","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:52e94ddda9cd284061269883b219564b6f43e71ca7e9a7f087b3c6f65312a5e2","observation_id":"fe069519-99cd-49c2-82a7-75b5335e259c","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:4fda16be31afdbc75aaaedcc7a12f3adf3d2dcf84ca8bcfa7c4988787c1eb0ad","observation_id":"16e0ac70-6ba1-40fb-9aa4-689c9e6f60b5","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:6e034ac7e51198179ea935053f6e0481d1d253b94953bb2d5a5b753537ec6a5f","observation_id":"07835f86-8df9-4ea2-8eb0-847b3e695952","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":"then the loss definition directly gives L − Lfull ≤λ time τstop −τ full <0(45) which means that this method has the smaller loss","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:2952ff238ea223e71adfbe8e0b3741615c3913aaa9772a3756e208d15e7eaa3d","observation_id":"2d44645f-cafa-47af-8949-188830a00fcf","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:7d2240fbd384f2f3860c118dbbd5f6303fa702022f1fd5435ef5acdbadac900f","observation_id":"eded43d3-5bfb-461b-9435-df44d9305d60","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:0dac28e287c57e1f49ee7a0c4bff50be50cba0b87ac1abfabd70ce25a3cad40d","observation_id":"b7603d6a-8034-4d1f-acde-6c87af7105f1","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","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-06-28T01:08:39.494809Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-28T01:08:39.494809Z"},"links":{"citing_paper":"/paper/2606.06618"},"observation_digest":"sha256:d02fb09eaf8cc2a053cff8ff6f7038c2429786c4a65a67b64e28f63078bba31f","observation_id":"c6036033-9aab-4229-a255-a11ad626b100","resolution":{"observed_at":"2026-06-28T01:08:39.494809Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.06618","last_updated":"2026-06-04T18:09:02Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-13T17:07:04.370294Z","submitted_at":"2026-06-04T18:09:02Z","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":46},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2606.06618."}