{"as_of":"2026-08-10T08:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c6470c7e2af15b6d5f65dfcdfca4049e1d7817fe149ff82539368260720b0a0b","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":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":24,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:21:25.585866Z","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.764826Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"citing_paper":{"arxiv_id":"2106.01345","last_updated":"2021-06-24T17:09:59Z","snapshot_observed_at":"2026-08-07T09:11:20.723647Z","submitted_at":"2021-06-02T17:53:39Z","title":"Decision Transformer: Reinforcement Learning via Sequence Modeling","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-18T15:11:11.056013Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2106.01345"},"observation_digest":"sha256:59d6146da0f4388d83caa70c515ec0fb50c9963d0c87b3cbaae6f08a94279418","observation_id":"bd565aa9-bc56-47dc-acfe-3f509a04729c","resolution":{"observed_at":"2026-05-18T15:11:11.146419Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-08-07T14:21:25.585866Z","title":"Learning to reach goals without reinforcement learning.ArXiv, abs/1912.06088, 2019","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2505.19337","last_updated":"2025-05-27T02:56:11Z","snapshot_observed_at":"2026-08-07T14:14:13.090409Z","submitted_at":"2025-05-25T22:00:38Z","title":"Prompting Decision Transformers for Zero-Shot Reach-Avoid Policies","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:21:25.585866Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2505.19337"},"observation_digest":"sha256:7ff05e4a362a6de137430fd2c0d9d9bd1a3fc5f82d5e80351583e046d6882c5c","observation_id":"a2365892-1fd6-4786-9f4b-ca7f9256155e","resolution":{"observed_at":"2026-08-07T14:21:25.585866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-08-07T12:49:57.280493Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.23527","last_updated":"2026-06-25T14:27:54Z","snapshot_observed_at":"2026-08-09T17:17:45.866844Z","submitted_at":"2025-05-29T15:06:22Z","title":"Normalizing Flows are Capable Models for Continuous Control","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T12:49:57.280493Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2505.23527"},"observation_digest":"sha256:df44973fcb1b8bcdeb8414e7533a9e7bc2a55def5d4e046f01baf240476562ef","observation_id":"501446ab-2c25-4b60-8f7b-9466e8128aff","resolution":{"observed_at":"2026-08-07T12:49:57.280493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-08-06T22:41:34.963486Z","title":"Learning to reach goals via iterated supervised learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2506.21044","last_updated":"2025-06-26T06:45:59Z","snapshot_observed_at":"2026-08-08T15:33:51.215391Z","submitted_at":"2025-06-26T06:45:59Z","title":"Efficient Skill Discovery via Regret-Aware Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T22:41:34.963486Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2506.21044"},"observation_digest":"sha256:646853fe0f74f793ad9247460738a35ec02e3b018e0a29a3b1075e3383356bdd","observation_id":"77335ca6-e087-4292-8657-b2892f585840","resolution":{"observed_at":"2026-08-06T22:41:34.963486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-08-06T18:15:44.449930Z","title":"Learning to reach goals via iterated supervised learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2507.09041","last_updated":"2025-07-11T21:36:19Z","snapshot_observed_at":"2026-08-09T05:31:23.348356Z","submitted_at":"2025-07-11T21:36:19Z","title":"Behavioral Exploration: Learning to Explore via In-Context Adaptation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:15:44.449930Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2507.09041"},"observation_digest":"sha256:4cfe9b0a6a1c21748275aa8ecdefc66e64d0c752205427db8bcc25eebdedcff6","observation_id":"5cf61d41-82c4-49f2-a1c1-391bcedd557c","resolution":{"observed_at":"2026-08-06T18:15:44.449930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-08-06T15:26:24.538792Z","title":"Ghosh, A","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2507.16139","last_updated":"2025-07-22T01:13:45Z","snapshot_observed_at":"2026-08-10T04:57:19.926416Z","submitted_at":"2025-07-22T01:13:45Z","title":"Equivariant Goal Conditioned Contrastive Reinforcement Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T15:26:24.538792Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2507.16139"},"observation_digest":"sha256:dcd2aeb389e451570a1969d0b5cdb70d39ab56e2969f1e29602cd83f4f9d9173","observation_id":"43cca234-29f1-4921-8ad4-e0236c4c209a","resolution":{"observed_at":"2026-08-06T15:26:24.538792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-08-05T11:39:57.847334Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.02458","last_updated":"2025-09-02T16:09:02Z","snapshot_observed_at":"2026-08-10T01:35:34.505804Z","submitted_at":"2025-09-02T16:09:02Z","title":"Generative Sequential Notification Optimization via Multi-Objective Decision Transformers","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T11:39:57.847334Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2509.02458"},"observation_digest":"sha256:3112b3f202f804b7afad06abab8d53b6698af7ba6d06c40a47e4e4e48788522a","observation_id":"6ad19f8a-a269-4666-9acf-cc9855668f46","resolution":{"observed_at":"2026-08-05T11:39:57.847334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-08-03T13:13:43.891012Z","title":"Learning to reach goals via iterated supervised learning.arXiv preprint arXiv:1912.06088, 2019","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2601.00126","last_updated":"2026-07-17T22:35:37Z","snapshot_observed_at":"2026-08-09T02:08:45.803046Z","submitted_at":"2025-12-31T22:03:19Z","title":"Compositional Diffusion with Guided Search for Long-Horizon Planning","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T13:13:43.891012Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2601.00126"},"observation_digest":"sha256:28ba871f87ea653cdf0a1dcee17dcb9f4e5e0015d2e21d8dcda3e6df6491dee1","observation_id":"f91be620-0707-400c-ad6c-ff4412ea2e29","resolution":{"observed_at":"2026-08-03T13:13:43.891012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"citing_paper":{"arxiv_id":"2603.19312","last_updated":"2026-06-03T18:50:40Z","snapshot_observed_at":"2026-08-06T05:42:53.129146Z","submitted_at":"2026-03-13T19:48:14Z","title":"LeWorldModel: Stable End-to-End Joint-Embedding Predictive Architecture from Pixels","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-15T04:09:22.328844Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2603.19312"},"observation_digest":"sha256:242013f905728614f4a9ccdcdb21a68938541ef36810ca5350040476ce9aac06","observation_id":"61541cb6-5ace-4b62-b49a-b960b8966cbe","resolution":{"observed_at":"2026-05-15T04:09:22.537167Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"citing_paper":{"arxiv_id":"2604.08960","last_updated":"2026-04-10T05:04:29Z","snapshot_observed_at":"2026-07-06T22:57:59.555972Z","submitted_at":"2026-04-10T05:04:29Z","title":"Efficient Hierarchical Implicit Flow Q-learning for Offline Goal-conditioned Reinforcement Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T18:12:32.839681Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2604.08960"},"observation_digest":"sha256:0347731dd5856c5f16f754caf27b9fabc940fd0f8882b1294fc416bfdbe476ad","observation_id":"6bf7c55e-445b-40e5-b3dd-c16b65b7fb51","resolution":{"observed_at":"2026-05-11T05:20:58.412122Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"citing_paper":{"arxiv_id":"2604.11137","last_updated":"2026-04-19T09:00:50Z","snapshot_observed_at":"2026-07-06T22:59:36.571641Z","submitted_at":"2026-04-13T07:49:39Z","title":"From Answers to Arguments: Toward Trustworthy Clinical Diagnostic Reasoning with Toulmin-Guided Curriculum Goal-Conditioned Learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T16:30:34.434984Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2604.11137"},"observation_digest":"sha256:c96359c4a0251a41d727cf12f3e2c30e69133693eaf00a89693418e355522b2e","observation_id":"5aa919d6-8f34-4df2-b8f5-833489def7b7","resolution":{"observed_at":"2026-05-11T08:45:59.479633Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"citing_paper":{"arxiv_id":"2604.22724","last_updated":"2026-04-24T17:23:34Z","snapshot_observed_at":"2026-07-06T23:09:05.682387Z","submitted_at":"2026-04-24T17:23:34Z","title":"GCImOpt: Learning efficient goal-conditioned policies by imitating optimal trajectories","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T11:26:22.149056Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2604.22724"},"observation_digest":"sha256:61d4c96466987e5a22698365101fd303df27c015f0647a9a96e96bb568e0e6a1","observation_id":"ebc466fa-a539-42e0-8872-1dece75ebddf","resolution":{"observed_at":"2026-05-11T19:36:14.937117Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"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":24,"source":"pdf_text","source_observed_at":"2026-05-08T17:47:58.141126Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2605.03075"},"observation_digest":"sha256:039116d5587484580c84008e34293aeb0c61e4c212ccf87c9750a836eb33eb3d","observation_id":"9cd5e1be-e9e7-426e-89cb-ac5bc540f741","resolution":{"observed_at":"2026-05-11T17:11:18.892607Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"citing_paper":{"arxiv_id":"2605.07278","last_updated":"2026-05-08T05:43:33Z","snapshot_observed_at":"2026-08-01T00:55:28.214005Z","submitted_at":"2026-05-08T05:43:33Z","title":"Predictive but Not Plannable: RC-aux for Latent World Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-11T02:11:26.526418Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2605.07278"},"observation_digest":"sha256:bf3f1ca62b315da0f86ff22fa132f70652fc21975e1d6a2d680337cca3663ed6","observation_id":"1f251c31-f01f-44ec-bb2d-a33d443c71a1","resolution":{"observed_at":"2026-05-11T03:50:57.291741Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"citing_paper":{"arxiv_id":"2605.09364","last_updated":"2026-05-10T06:27:20Z","snapshot_observed_at":"2026-07-31T06:28:20.350355Z","submitted_at":"2026-05-10T06:27:20Z","title":"Multi-scale Predictive Representations for Goal-conditioned Reinforcement Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-12T03:35:37.739085Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2605.09364"},"observation_digest":"sha256:32eee119205b9a99240066c5ae6f47e8a8b12a516519fbf3dedc900b81a36ec6","observation_id":"eedc35fc-db0c-491c-b15a-4d9bf6b32975","resolution":{"observed_at":"2026-05-12T07:16:26.289713Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"citing_paper":{"arxiv_id":"2605.21800","last_updated":"2026-05-20T22:58:15Z","snapshot_observed_at":"2026-07-06T23:32:10.472558Z","submitted_at":"2026-05-20T22:58:15Z","title":"stable-worldmodel: A Platform for Reproducible World Modeling Research and Evaluation","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-22T08:57:19.834179Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2605.21800"},"observation_digest":"sha256:f6ecef2eee5d0a84a7d0114a81c6da4ab5a5ca58f1a6042fbaa2d380ee61d15f","observation_id":"0c3561a8-9ed5-4b13-b510-7f5d4cfafe5b","resolution":{"observed_at":"2026-05-22T09:01:20.332386Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"citing_paper":{"arxiv_id":"2605.23551","last_updated":"2026-05-22T12:17:09Z","snapshot_observed_at":"2026-07-06T23:33:44.335185Z","submitted_at":"2026-05-22T12:17:09Z","title":"Goal-Conditioned Agents that Learn Everything All at Once","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-25T04:59:48.867927Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2605.23551"},"observation_digest":"sha256:c4e4fbbd6dad2a9c608ff7f51cb6e2927e2879d3668ca1797604447e31b6e636","observation_id":"eaa4089d-ea58-428a-b5cd-a7c926920358","resolution":{"observed_at":"2026-05-25T05:00:21.639083Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"citing_paper":{"arxiv_id":"2606.09476","last_updated":"2026-06-08T13:35:22Z","snapshot_observed_at":"2026-08-01T13:38:00.934917Z","submitted_at":"2026-06-08T13:35:22Z","title":"Goal Sets, Not Goal States: Queryable Robot Goals through Goal-Set Hindsight Relabeling","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T16:07:28.361043Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2606.09476"},"observation_digest":"sha256:8ada81c49cd655912f6f05c7eb8b115b69f600ea331456d5e17f585e5ca31d29","observation_id":"44fae367-5737-45ed-a48a-14de6a58cc3e","resolution":{"observed_at":"2026-07-03T02:07:34.180587Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":"1912.06088","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-04T06:49:37.764826Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":"6801049a-1c75-4e1b-8b08-a29a6178bfd8","year":1912},"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":9,"source":"pdf_text","source_observed_at":"2026-06-26T14:12:33.307261Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2606.21646"},"observation_digest":"sha256:9995b3904941276bb0c6f87ef862d40273dd3d50b6f73e77d855dfc038aa8e34","observation_id":"35711ff6-2e43-42c2-9206-285dde74bc2e","resolution":{"observed_at":"2026-07-04T06:49:37.767185Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-07-11T20:45:51.403759Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2607.04235","last_updated":"2026-07-05T11:21:26Z","snapshot_observed_at":"2026-08-07T22:33:01.101075Z","submitted_at":"2026-07-05T11:21:26Z","title":"Spinning Straw into Gold: Relabeling LLM Agent Trajectories in Hindsight for Successful Demonstrations","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-11T20:45:51.403759Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2607.04235"},"observation_digest":"sha256:3d582b61f3c490a64632ad7833760f83160118a1a60d59b8bfb1497d9728d428","observation_id":"f9624c5c-ee09-4152-827d-13cbb574d786","resolution":{"observed_at":"2026-07-11T20:45:51.403759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-08-01T17:45:13.164857Z","title":"arXiv preprint arXiv:1912.06088 , year=","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2607.17560","last_updated":"2026-07-20T05:09:36Z","snapshot_observed_at":"2026-08-05T13:38:45.921055Z","submitted_at":"2026-07-20T05:09:36Z","title":"Reinforcement Learning: From Algorithms To Foundation Models","version":1},"reference_index":163,"source":"arxiv_source","source_observed_at":"2026-08-01T17:45:13.164857Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2607.17560"},"observation_digest":"sha256:369e7bb515f29f5723e28ca7816d4ece6f44bcd7521db7596c31075049babced","observation_id":"9583241c-4031-4b02-b8df-99f34b72dffa","resolution":{"observed_at":"2026-08-01T17:45:13.164857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-08-01T03:05:32.177521Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.25236","last_updated":"2026-07-28T03:23:47Z","snapshot_observed_at":"2026-08-07T21:03:50.260810Z","submitted_at":"2026-07-28T03:23:47Z","title":"VisualPatchWorld: Code World Models as Latent Structured Representations for Planning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T03:05:32.177521Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2607.25236"},"observation_digest":"sha256:6dbb491c7f2c26b0bae389abe793a3ee6b4980f3557b8f8031ce2b241a4db993","observation_id":"d74aa734-1585-4a62-9ec3-50ea4030e825","resolution":{"observed_at":"2026-08-01T03:05:32.177521Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-08-01T02:48:10.458568Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.25337","last_updated":"2026-07-29T10:22:25Z","snapshot_observed_at":"2026-08-03T10:28:15.206904Z","submitted_at":"2026-07-28T06:38:16Z","title":"Temporal-Distance JEPA: Plan-Aware Representation Learning for Latent World Model Predictive Control","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T02:48:10.458568Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2607.25337"},"observation_digest":"sha256:efc1e1297d823770ddefacba45eeb1fcb76b6f5916761b6b78a2206236237867","observation_id":"21c83659-5f2d-4b0d-815c-58825c68a30d","resolution":{"observed_at":"2026-08-01T02:48:10.458568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06088","snapshot_observed_at":"2026-08-01T00:49:00.033074Z","title":"Learning to reach goals via iterated supervised learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2607.26056","last_updated":"2026-07-28T17:59:40Z","snapshot_observed_at":"2026-08-05T05:32:18.434442Z","submitted_at":"2026-07-28T17:59:40Z","title":"INTACT: Isomorphic Intent-to-Action Learning for Search-Free World Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T00:49:00.033074Z"},"links":{"cited_paper":"/paper/1912.06088","citing_paper":"/paper/2607.26056"},"observation_digest":"sha256:cee7be31523ca15208c0cea7a6acf72913b5398fd10b73a1c3251513fdaa77db","observation_id":"c44246e3-72aa-4150-9137-819f79b53e22","resolution":{"observed_at":"2026-08-01T00:49:00.033074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1912.06088/citation-record","integrity":"/paper/1912.06088/integrity","json":"/paper/1912.06088/citation-record.json","paper":"/paper/1912.06088"},"outbound":[],"paper":{"arxiv_id":"1912.06088","last_updated":"2020-10-02T19:49:10Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T14:57:05.363720Z","submitted_at":"2019-12-12T17:26:47Z","title":"Learning to Reach Goals via Iterated Supervised Learning"},"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-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 0 of 0 outbound references and 24 inbound Pith citation observations for arXiv:1912.06088."}