{"as_of":"2026-08-09T01:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:320c808a230f862fde4a004b3f9f20e4b278ab69dfb6ddae3037143967b8dae9","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":15,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:21:18.166804Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T06:49:37.806004Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-08-08T13:21:18.166804Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.07279","last_updated":"2025-05-16T17:18:02Z","snapshot_observed_at":"2026-08-08T13:12:33.630286Z","submitted_at":"2025-02-11T05:48:51Z","title":"Exploratory Diffusion Model for Unsupervised Reinforcement Learning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T13:21:18.166804Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2502.07279"},"observation_digest":"sha256:0183b90c00a919fe6fd3a51461654b558031c7c3d6f6825755bbbf6d1fde5175","observation_id":"193876ed-7802-427e-94db-c299f5ddd8df","resolution":{"observed_at":"2026-08-08T13:21:18.166804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-08-07T15:26:18.191384Z","title":"Simple hi- erarchical planning with diffusion,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15157","last_updated":"2025-05-21T06:21:50Z","snapshot_observed_at":"2026-08-07T15:20:45.055783Z","submitted_at":"2025-05-21T06:21:50Z","title":"Cascaded Diffusion Models for Neural Motion Planning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T15:26:18.191384Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2505.15157"},"observation_digest":"sha256:c692b66be3a353c67b2651995542f961d1bea5cb6f591458d0e22597d3d9dd9e","observation_id":"a4b6b761-256a-4919-9ec9-fd49d0c847c0","resolution":{"observed_at":"2026-08-07T15:26:18.191384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-08-07T14:20:36.384955Z","title":"Simple hierarchi- cal planning with diffusion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20350","last_updated":"2025-05-26T03:42:20Z","snapshot_observed_at":"2026-08-08T01:01:01.114971Z","submitted_at":"2025-05-26T03:42:20Z","title":"Decision Flow Policy Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:36.384955Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2505.20350"},"observation_digest":"sha256:fba5b0f6c69bd1f9f693f5a010b55f456930b8a67aa717a2658cf846af0c8f67","observation_id":"820a9767-3a44-4d6b-9503-ab3a35904761","resolution":{"observed_at":"2026-08-07T14:20:36.384955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-08-07T13:35:54.985359Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21750","last_updated":"2025-05-27T20:38:44Z","snapshot_observed_at":"2026-08-07T13:21:33.991926Z","submitted_at":"2025-05-27T20:38:44Z","title":"Hierarchical Reinforcement Learning with Uncertainty-Guided Diffusional Subgoals","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T13:35:54.985359Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2505.21750"},"observation_digest":"sha256:241ec9570cac9b926ea8c5390b6643dc5a9ef84959cf74f4b1d94a812ec259a6","observation_id":"048656bf-33c7-4862-8f7f-e1b1c0c5bf5c","resolution":{"observed_at":"2026-08-07T13:35:54.985359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":"2401.02644","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-07-04T06:49:37.806004Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":"ee441404-7bf8-4b2f-8c5c-ecab22ad63a3","year":2024},"citing_paper":{"arxiv_id":"2506.15799","last_updated":"2025-06-25T19:09:52Z","snapshot_observed_at":"2026-08-08T08:13:32.220639Z","submitted_at":"2025-06-18T18:35:57Z","title":"Steering Your Diffusion Policy with Latent Space Reinforcement Learning","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-17T21:55:46.183007Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2506.15799"},"observation_digest":"sha256:2fe8c76d8ae2f946433e9bf1955ffd95ffb20ef061ec16ed0887887e3aa8b3b9","observation_id":"d50b41d7-6e00-48eb-9c96-96804bb0b5f6","resolution":{"observed_at":"2026-05-17T21:55:46.410569Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-08-06T22:27:11.212891Z","title":"Diamond: Diffusion as a model of environment dreams","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.21552","last_updated":"2025-06-26T17:59:59Z","snapshot_observed_at":"2026-08-06T22:21:08.720500Z","submitted_at":"2025-06-26T17:59:59Z","title":"Whole-Body Conditioned Egocentric Video Prediction","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-06T22:27:11.212891Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2506.21552"},"observation_digest":"sha256:4b84967c8c9214b6d4939e45df53785d54cfb15714c1f8801d336f93dc48e288","observation_id":"219a00de-6606-4948-9502-fab9e58c88bb","resolution":{"observed_at":"2026-08-06T22:27:11.212891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-08-06T17:57:08.221828Z","title":"Simple hi- erarchical planning with diffusion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09495","last_updated":"2025-07-13T05:02:43Z","snapshot_observed_at":"2026-08-06T23:14:57.681420Z","submitted_at":"2025-07-13T05:02:43Z","title":"GenAI-based Multi-Agent Reinforcement Learning towards Distributed Agent Intelligence: A Generative-RL Agent Perspective","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:57:08.221828Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2507.09495"},"observation_digest":"sha256:bf8b5af69ea20b7d56f3d4a5e3c5802cf28ed28a5d4818fd7536f29dea5042c1","observation_id":"94a67fd3-e025-427f-8432-9bc648116c74","resolution":{"observed_at":"2026-08-06T17:57:08.221828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-08-06T15:47:41.128597Z","title":"Diffusion forcing: Next-token prediction meets full-sequence diffusion","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.15073","last_updated":"2025-07-20T18:15:18Z","snapshot_observed_at":"2026-08-07T23:04:10.690284Z","submitted_at":"2025-07-20T18:15:18Z","title":"Reinforcement Learning for Flow-Matching Policies","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T15:47:41.128597Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2507.15073"},"observation_digest":"sha256:c810d9bd48edc8961d447020d70c528e19e0e2164d99fc91eb921010b8523bc6","observation_id":"d2fc7afe-b7ad-4a44-b7ec-7a1ceb508c48","resolution":{"observed_at":"2026-08-06T15:47:41.128597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":"2401.02644","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-07-04T06:49:37.806004Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":"ee441404-7bf8-4b2f-8c5c-ecab22ad63a3","year":2024},"citing_paper":{"arxiv_id":"2605.03075","last_updated":"2026-05-04T18:44:19Z","snapshot_observed_at":"2026-07-06T23:16:05.372336Z","submitted_at":"2026-05-04T18:44:19Z","title":"Refining Compositional Diffusion for Reliable Long-Horizon Planning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T17:47:58.141126Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2605.03075"},"observation_digest":"sha256:20d584540cb04a20f63a9af961e1f863598593916bf697971c80394c963eb346","observation_id":"3a10adda-ed92-4d86-b05d-afbb507fefdb","resolution":{"observed_at":"2026-05-11T17:11:18.834646Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":"2401.02644","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-07-04T06:49:37.806004Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":"ee441404-7bf8-4b2f-8c5c-ecab22ad63a3","year":2024},"citing_paper":{"arxiv_id":"2605.30056","last_updated":"2026-05-28T15:07:50Z","snapshot_observed_at":"2026-08-07T01:38:25.069332Z","submitted_at":"2026-05-28T15:07:50Z","title":"Sample-Efficient Diffusion-based Reinforcement Learning with Critic Guidance","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T07:21:56.382343Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2605.30056"},"observation_digest":"sha256:9d668378458abb238de5d4ea7896059165409f188c79d9e816c80e71364fc3e4","observation_id":"5128a2f4-7633-4025-8951-4f9292fdf37d","resolution":{"observed_at":"2026-06-29T07:23:12.576821Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":"2401.02644","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-07-04T06:49:37.806004Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":"ee441404-7bf8-4b2f-8c5c-ecab22ad63a3","year":2024},"citing_paper":{"arxiv_id":"2605.31314","last_updated":"2026-05-29T13:45:33Z","snapshot_observed_at":"2026-08-06T06:59:12.890182Z","submitted_at":"2026-05-29T13:45:33Z","title":"AR Forcing: Towards Long-Horizon Robot Navigation World Model","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T21:56:04.190024Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2605.31314"},"observation_digest":"sha256:7008f3861518a0c5283a56bf6346a30f50b59e6d90a5d101d6bd44c3e1199a08","observation_id":"27b706c8-49c5-44f2-97b4-a2107e9fdb87","resolution":{"observed_at":"2026-07-01T19:56:10.929784Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":"2401.02644","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-07-04T06:49:37.806004Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":"ee441404-7bf8-4b2f-8c5c-ecab22ad63a3","year":2024},"citing_paper":{"arxiv_id":"2606.02209","last_updated":"2026-06-01T13:10:16Z","snapshot_observed_at":"2026-08-03T04:41:01.110839Z","submitted_at":"2026-06-01T13:10:16Z","title":"Conditional Graph Diffusion for Negotiation Support: Overcoming Discrete Infeasibility and Preference Elicitation Gaps","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T12:18:58.904218Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2606.02209"},"observation_digest":"sha256:112a269d98f779b882c6c0597e3f882e29fa7b893c71b75fb5ca5afc602b508e","observation_id":"9c3bea5a-4cec-403c-a60e-50b37b1d3988","resolution":{"observed_at":"2026-07-02T01:16:24.724889Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":"2401.02644","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-07-04T06:49:37.806004Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":"ee441404-7bf8-4b2f-8c5c-ecab22ad63a3","year":2024},"citing_paper":{"arxiv_id":"2606.08775","last_updated":"2026-06-07T18:39:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-06-07T18:39:45Z","title":"Unifying Object-Centric World Models and Diffusion Policy: A Hierarchical Framework for Multi-Stage Robotic Tasks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T18:08:00.023503Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2606.08775"},"observation_digest":"sha256:f2026cb4df32234176512b2f92bf5ac10b8b68b4038a5870f83269f780d274ab","observation_id":"c502b882-b63c-49be-9c1f-870827f27c5f","resolution":{"observed_at":"2026-07-02T23:37:27.382011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":"2401.02644","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-07-04T06:49:37.806004Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":"ee441404-7bf8-4b2f-8c5c-ecab22ad63a3","year":2024},"citing_paper":{"arxiv_id":"2606.19914","last_updated":"2026-06-18T08:08:16Z","snapshot_observed_at":"2026-08-02T09:36:41.062823Z","submitted_at":"2026-06-18T08:08:16Z","title":"Co-policy: Responsive Human-Robot Co-Creation for Musical Performances","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T17:09:35.375171Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2606.19914"},"observation_digest":"sha256:fd13cd266c5ec6b878a085abd7cdf40663fcfb39b91e372d487b938bbf634c6f","observation_id":"781ef55e-31c6-4ac3-9c5f-e6cb9650428c","resolution":{"observed_at":"2026-07-04T04:19:33.835168Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion","version":1},"cited_work":{"arxiv_id":"2401.02644","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.02644","snapshot_observed_at":"2026-07-04T06:49:37.806004Z","title":"Simple hierarchical planning with diffusion","venue":null,"work_id":"ee441404-7bf8-4b2f-8c5c-ecab22ad63a3","year":2024},"citing_paper":{"arxiv_id":"2606.21646","last_updated":"2026-06-19T17:57:09Z","snapshot_observed_at":"2026-08-01T11:35:10.251786Z","submitted_at":"2026-06-19T17:57:09Z","title":"Energy-based Compositional Diffusion Planning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T14:12:33.307261Z"},"links":{"cited_paper":"/paper/2401.02644","citing_paper":"/paper/2606.21646"},"observation_digest":"sha256:d2efb7027a07a4f35fbd74edce0caaf7e4684fb9abbcae9d858fa460daf13a66","observation_id":"6532f5e1-4f9f-49ea-8c67-3ab2dd66368d","resolution":{"observed_at":"2026-07-04T06:49:37.808122Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.02644/citation-record","integrity":"/paper/2401.02644/integrity","json":"/paper/2401.02644/citation-record.json","paper":"/paper/2401.02644"},"outbound":[],"paper":{"arxiv_id":"2401.02644","last_updated":"2024-01-05T05:28:40Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T15:37:47.750655Z","submitted_at":"2024-01-05T05:28:40Z","title":"Simple Hierarchical Planning with Diffusion"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 15 inbound Pith citation observations for arXiv:2401.02644."}