{"as_of":"2026-08-09T07:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e8bb31817025c2014ce02f522df7be1b8240607c9223d93f99fd68f074263e6e","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:59:40.090855Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":171,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1912.01588","doi":"10.48550/arxiv.1912.01588","metadata_source":"arxiv_reference","pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning , July 2020","venue":"arXiv (Cornell University)","work_id":"7c8641fb-9be4-42cc-afcb-c8e94fb57c14","year":1912},"citing_paper":{"arxiv_id":"2309.16797","last_updated":"2023-09-28T19:01:07Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-28T19:01:07Z","title":"Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-05-16T08:12:30.984870Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2309.16797"},"observation_digest":"sha256:8018ee9e05d016939eb62f87f016e618c54cbaef7c0b0b4aa26a850c13ed6a68","observation_id":"253eddd0-5bf8-4c84-9f40-fa56f9e8ab76","resolution":{"observed_at":"2026-05-16T08:12:31.413770Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1912.01588","doi":"10.48550/arxiv.1912.01588","metadata_source":"arxiv_reference","pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning , July 2020","venue":"arXiv (Cornell University)","work_id":"7c8641fb-9be4-42cc-afcb-c8e94fb57c14","year":1912},"citing_paper":{"arxiv_id":"2407.15134","last_updated":"2025-06-06T13:37:30Z","snapshot_observed_at":"2026-08-07T21:47:56.938563Z","submitted_at":"2024-07-21T12:08:54Z","title":"Proximal Policy Distillation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-23T23:09:42.421333Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2407.15134"},"observation_digest":"sha256:38afb1b721f142e0eaa5c6444324e2127fd0a166e1ba0a5136d4a56b6acf8ebe","observation_id":"104aae9c-0c71-449a-9de8-c9c97c00416d","resolution":{"observed_at":"2026-05-23T23:13:36.980164Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-07T04:59:40.090855Z","title":"Collaboration, O","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2506.09172","last_updated":"2025-06-17T03:30:48Z","snapshot_observed_at":"2026-08-09T02:05:58.972748Z","submitted_at":"2025-06-10T18:38:19Z","title":"An Open-Source Software Toolkit & Benchmark Suite for the Evaluation and Adaptation of Multimodal Action Models","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T04:59:40.090855Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2506.09172"},"observation_digest":"sha256:324b7c35675373a9131d6e0867f179815594b30d61c8db5d882cdf527b83a535","observation_id":"b42d011d-d382-4b29-ae7a-c14f333f4633","resolution":{"observed_at":"2026-08-07T04:59:40.090855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-06T20:19:02.762041Z","title":"Leveraging procedural generation to benchmark reinforcement learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2507.03298","last_updated":"2025-07-04T05:06:15Z","snapshot_observed_at":"2026-08-07T09:19:12.071996Z","submitted_at":"2025-07-04T05:06:15Z","title":"Dyn-O: Building Structured World Models with Object-Centric Representations","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:19:02.762041Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2507.03298"},"observation_digest":"sha256:b3006db7e11f32ded6e6342e9486759bad4f622d2a6dfdc381d6a8724b09b6e8","observation_id":"2d7ab01c-84ce-482a-990a-51ff1f76c9ce","resolution":{"observed_at":"2026-08-06T20:19:02.762041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1912.01588","doi":"10.48550/arxiv.1912.01588","metadata_source":"arxiv_reference","pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning , July 2020","venue":"arXiv (Cornell University)","work_id":"7c8641fb-9be4-42cc-afcb-c8e94fb57c14","year":1912},"citing_paper":{"arxiv_id":"2507.05561","last_updated":"2026-05-04T20:02:44Z","snapshot_observed_at":"2026-08-06T10:59:05.890556Z","submitted_at":"2025-07-08T00:55:47Z","title":"Preemptive Solving of Future Problems: Multitask Preplay in Humans and Machines","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-19T06:38:33.969927Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2507.05561"},"observation_digest":"sha256:14b5f7fd94c729c821631a3fc8d442ac81d9be121f0dc6f461a701de3e35ff0c","observation_id":"6d28784e-5ce8-4fe5-8a07-7470b597d00c","resolution":{"observed_at":"2026-05-19T06:42:07.614826Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-06T12:38:46.903783Z","title":"Leveraging procedural generation to benchmark reinforcement learning.arXiv preprint arXiv:1912.01588,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2507.21638","last_updated":"2026-07-21T11:06:56Z","snapshot_observed_at":"2026-08-06T12:38:42.232623Z","submitted_at":"2025-07-29T09:49:11Z","title":"Assistax: A Multi-Agent Hardware-Accelerated Reinforcement Learning Benchmark for Assistive Robotics","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T12:38:46.903783Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2507.21638"},"observation_digest":"sha256:d4e7eee956a8ee8661456464cbafca77f1a3d586b54ffdbdbe971ae775ed7c24","observation_id":"be0497ab-3a38-4fa9-a49f-2eeb5dbd12c0","resolution":{"observed_at":"2026-08-06T12:38:46.903783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-06T10:34:35.473241Z","title":"Leveraging procedural genera- tion to benchmark reinforcement learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2508.00046","last_updated":"2025-07-31T16:11:37Z","snapshot_observed_at":"2026-08-06T10:34:15.798010Z","submitted_at":"2025-07-31T16:11:37Z","title":"Benchmarking Partial Observability in Reinforcement Learning with a Suite of Memory-Improvable Domains","version":1},"reference_index":1992,"source":"pdf_text","source_observed_at":"2026-08-06T10:34:35.473241Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2508.00046"},"observation_digest":"sha256:6ab3155a841747701d40e1daa21572777ca97b5823415d8ddfaf306b0e3fab73","observation_id":"e1284f15-6fcf-4e2e-89e0-e9ca4c5edb42","resolution":{"observed_at":"2026-08-06T10:34:35.473241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-03T05:21:35.522064Z","title":"Leveraging procedural generation to benchmark reinforcement learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2602.02762","last_updated":"2026-07-02T00:32:14Z","snapshot_observed_at":"2026-08-06T03:52:18.184889Z","submitted_at":"2026-02-02T20:13:43Z","title":"On the Sample Efficiency of Inverse Dynamics Models for Semi-Supervised Imitation Learning","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-03T05:21:35.522064Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2602.02762"},"observation_digest":"sha256:42a79483e0885e6fc22549167e9d42195211b9010cae211c403edd6629fc218f","observation_id":"41bf3f85-9e3b-4c37-bee0-20063b01e320","resolution":{"observed_at":"2026-08-03T05:21:35.522064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1912.01588","doi":"10.48550/arxiv.1912.01588","metadata_source":"arxiv_reference","pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning , July 2020","venue":"arXiv (Cornell University)","work_id":"7c8641fb-9be4-42cc-afcb-c8e94fb57c14","year":1912},"citing_paper":{"arxiv_id":"2605.23565","last_updated":"2026-05-22T12:31:18Z","snapshot_observed_at":"2026-07-06T23:33:44.335185Z","submitted_at":"2026-05-22T12:31:18Z","title":"Understanding Goal Generalisation in Sequential Reinforcement Learning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-25T04:49:50.034743Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2605.23565"},"observation_digest":"sha256:678bf78783497bba4f85ef5fc9a0b0fa1422279e99a20f07bb1635cf0b0f7b07","observation_id":"ff30be29-828b-4205-8356-f5a39941ec16","resolution":{"observed_at":"2026-05-25T04:50:20.671717Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1912.01588","doi":"10.48550/arxiv.1912.01588","metadata_source":"arxiv_reference","pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning , July 2020","venue":"arXiv (Cornell University)","work_id":"7c8641fb-9be4-42cc-afcb-c8e94fb57c14","year":1912},"citing_paper":{"arxiv_id":"2606.04130","last_updated":"2026-06-02T18:40:24Z","snapshot_observed_at":"2026-07-06T23:44:19.059079Z","submitted_at":"2026-06-02T18:40:24Z","title":"CLAW: Learning Continuous Latent Action World Models via Adversarial Latent Regularization","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-28T09:55:00.402411Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2606.04130"},"observation_digest":"sha256:4581616b1eaa19246201edd3ce7c75ee9a014008fd6cb3c1a04f6c10127be2fe","observation_id":"70afcc4e-51ae-4410-9c78-348c1d0cdaef","resolution":{"observed_at":"2026-07-02T03:36:29.552457Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1912.01588","doi":"10.48550/arxiv.1912.01588","metadata_source":"arxiv_reference","pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning , July 2020","venue":"arXiv (Cornell University)","work_id":"7c8641fb-9be4-42cc-afcb-c8e94fb57c14","year":1912},"citing_paper":{"arxiv_id":"2606.18812","last_updated":"2026-06-18T16:24:52Z","snapshot_observed_at":"2026-08-09T01:47:10.681363Z","submitted_at":"2026-06-17T08:27:27Z","title":"Reinforcement Learning Foundation Models Should Already Be A Thing","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T21:50:00.974590Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2606.18812"},"observation_digest":"sha256:e3af7dcacf6dc2469d4bbb6eaf7419f28a300606f2f6a1e98b559951d286bb06","observation_id":"d063ccc5-8c68-409d-b95c-a9aaa4d03dc4","resolution":{"observed_at":"2026-07-03T23:39:05.044993Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01588","snapshot_observed_at":"2026-08-06T04:19:48.168776Z","title":"Preprint, arXiv:1912.01588","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2608.05148","last_updated":"2026-08-05T17:59:44Z","snapshot_observed_at":"2026-08-09T03:34:44.765382Z","submitted_at":"2026-08-05T17:59:44Z","title":"Reasoning Core: Designing Broad Procedural Data for Completion-Supervised Reasoning Training","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T04:19:48.168776Z"},"links":{"cited_paper":"/paper/1912.01588","citing_paper":"/paper/2608.05148"},"observation_digest":"sha256:e59376583e1c229db16103db795a3aa30a002f91ea456751364387f9b8e2ea72","observation_id":"d81c660d-93d4-4273-92f3-c62ff223fc21","resolution":{"observed_at":"2026-08-06T04:19:48.168776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1912.01588/citation-record","integrity":"/paper/1912.01588/integrity","json":"/paper/1912.01588/citation-record.json","paper":"/paper/1912.01588"},"outbound":[],"paper":{"arxiv_id":"1912.01588","last_updated":"2020-07-26T18:39:26Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T18:05:01.923590Z","submitted_at":"2019-12-03T18:34:03Z","title":"Leveraging Procedural Generation to Benchmark Reinforcement 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:1912.01588."}