{"as_of":"2026-08-09T12:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6290b0f96ec81e499de58d23d40239e79f0bfcc4cc5a5974a0f63d137cfb9352","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":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":27,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:26:23.984633Z","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-04T15:29:55.587215Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"1906.11075","last_updated":"2019-06-25T10:21:02Z","snapshot_observed_at":"2026-08-01T14:33:56.185484Z","submitted_at":"2019-06-25T10:21:02Z","title":"Optimistic Proximal Policy Optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-25T16:29:45.847569Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/1906.11075"},"observation_digest":"sha256:ac3d3856f3defe7b6d495e4225d3c305d7bbcf0d6a3258e29a7891b93a5f11a9","observation_id":"9f34eb5f-2973-4721-8ab0-e6706a604dab","resolution":{"observed_at":"2026-05-25T16:31:01.523293Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"1907.00664","last_updated":"2019-07-01T11:22:52Z","snapshot_observed_at":"2026-07-06T08:04:02.269421Z","submitted_at":"2019-07-01T11:22:52Z","title":"Learning World Graphs to Accelerate Hierarchical Reinforcement Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-25T12:31:38.848720Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/1907.00664"},"observation_digest":"sha256:b68e943ed4377e2ebc8baacf4516cadf9267c462a41e34aa24ad5a1ab94632d8","observation_id":"ec06e9af-2a0c-41c3-8b6c-a78d40a23a4f","resolution":{"observed_at":"2026-05-25T12:35:49.184554Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"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":28,"source":"pdf_text","source_observed_at":"2026-05-18T15:11:11.056013Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2106.01345"},"observation_digest":"sha256:8c0195903b6b1022c77972ee9a8ca5cf7ff3d18b3b31b258607afd26eb48045a","observation_id":"81a7317a-6e7b-49e7-ad02-e1b1e61a4db8","resolution":{"observed_at":"2026-05-18T15:11:11.205996Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2305.16291","last_updated":"2023-10-19T16:27:03Z","snapshot_observed_at":"2026-08-07T08:29:46.650400Z","submitted_at":"2023-05-25T17:46:38Z","title":"Voyager: An Open-Ended Embodied Agent with Large Language Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T13:11:40.995345Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2305.16291"},"observation_digest":"sha256:998956956e6363da54704501daf6e8b612f4effe25e7d4c7398027595ee88700","observation_id":"3f8d8688-9a36-49d7-9886-bf2f971e4d62","resolution":{"observed_at":"2026-05-10T13:11:41.131498Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2309.02427","last_updated":"2024-03-15T15:44:11Z","snapshot_observed_at":"2026-08-03T00:38:27.580701Z","submitted_at":"2023-09-05T17:56:20Z","title":"Cognitive Architectures for Language Agents","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-16T19:33:44.146134Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2309.02427"},"observation_digest":"sha256:ad11441212c05c5d05a33dfb74b9762db642ea3f5be0c1615f88d8055e38b707","observation_id":"4a1fdbb8-2297-407e-b715-b4a29d5fe35a","resolution":{"observed_at":"2026-05-16T19:33:44.325501Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"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":102,"source":"arxiv_source","source_observed_at":"2026-05-16T08:12:30.984870Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2309.16797"},"observation_digest":"sha256:2195f920022a367168fae285078fa674207127780283c2715277c28602df526e","observation_id":"7d72ca4f-bdf4-4b44-b233-6a1ae9522f47","resolution":{"observed_at":"2026-05-16T08:12:35.387667Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-08-07T14:26:23.984633Z","title":"Hao-Shu Fang, Chenxi Wang, Minghao Gou, and Cewu Lu","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18994","last_updated":"2025-05-25T06:32:56Z","snapshot_observed_at":"2026-08-08T02:48:18.897582Z","submitted_at":"2025-05-25T06:32:56Z","title":"Designing Pin-pression Gripper and Learning its Dexterous Grasping with Online In-hand Adjustment","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:23.984633Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2505.18994"},"observation_digest":"sha256:f662f905ca36a59b5b6ff74623bb889b417e44eb7352b12370cca870af8eeba1","observation_id":"0e4a0991-a9d0-437f-a07d-ce67ced47840","resolution":{"observed_at":"2026-08-07T14:26:23.984633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-08-07T10:51:57.859852Z","title":"O., and Clune, J","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2506.04098","last_updated":"2025-06-10T13:14:14Z","snapshot_observed_at":"2026-08-07T16:06:45.124727Z","submitted_at":"2025-06-04T15:55:27Z","title":"TextAtari: 100K Frames Game Playing with Language Agents","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:51:57.859852Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2506.04098"},"observation_digest":"sha256:3bd5f01f1c4bd01efa9450138032e6ceaa7f84298defd583c84afa890d449055","observation_id":"76461444-87e5-4d47-848f-93334478ac38","resolution":{"observed_at":"2026-08-07T10:51:57.859852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-08-07T05:37:46.323819Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2506.07505","last_updated":"2025-06-09T07:32:52Z","snapshot_observed_at":"2026-08-09T00:13:18.509711Z","submitted_at":"2025-06-09T07:32:52Z","title":"Reinforcement Learning via Implicit Imitation Guidance","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T05:37:46.323819Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2506.07505"},"observation_digest":"sha256:be85b1f87d4723eb2b0c4c50529b275989ca577168859c1a35b38558decb69a9","observation_id":"18e26509-53b6-4ac0-a579-ec7add5f2be0","resolution":{"observed_at":"2026-08-07T05:37:46.323819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-08-06T21:33:34.943251Z","title":"Go-explore: A new approach for hard-exploration problems,","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2507.00358","last_updated":"2025-07-23T14:00:39Z","snapshot_observed_at":"2026-08-09T09:01:08.945491Z","submitted_at":"2025-07-01T01:09:06Z","title":"Data-Driven Exploration for a Class of Continuous-Time Indefinite Linear--Quadratic Reinforcement Learning Problems","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T21:33:34.943251Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2507.00358"},"observation_digest":"sha256:6bff1bc0759700cb119cec8373e2908ebc0b8269380548c84198f32506cbb736","observation_id":"16a5722b-ccca-4208-bb58-b7412a6a7e36","resolution":{"observed_at":"2026-08-06T21:33:34.943251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-08-06T18:53:12.229578Z","title":"Go-explore: a new approach for hard-exploration problems.arXiv preprint arXiv:1901.10995, 2019","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2507.07017","last_updated":"2025-07-09T16:45:48Z","snapshot_observed_at":"2026-08-07T21:24:46.836836Z","submitted_at":"2025-07-09T16:45:48Z","title":"First Return, Entropy-Eliciting Explore","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:53:12.229578Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2507.07017"},"observation_digest":"sha256:e3fa2fd457200ab30496130ace6ddfb7a63d7ef1a6abf28384d999820ff13c22","observation_id":"b2a8d39d-42a5-4abe-bf7d-575a39e8159f","resolution":{"observed_at":"2026-08-06T18:53:12.229578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-08-06T18:15:43.839731Z","title":"O., and Clune, J","venue":null,"work_id":null,"year":1901},"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":2017,"source":"pdf_text","source_observed_at":"2026-08-06T18:15:43.839731Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2507.09041"},"observation_digest":"sha256:e8ea04f36da0c71fd490dbab29c491ac753869d532f5e88c4691dacd2f2c4e8f","observation_id":"8dece67f-c87a-4143-9c04-e5050612bac0","resolution":{"observed_at":"2026-08-06T18:15:43.839731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-08-04T10:53:07.774986Z","title":"arXiv preprint arXiv:1901.10995 (2019)","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2510.08048","last_updated":"2026-07-03T14:18:07Z","snapshot_observed_at":"2026-08-05T20:53:04.046643Z","submitted_at":"2025-10-09T10:34:39Z","title":"TaoSR-AGRL: Adaptive Guided Reinforcement Learning Framework for E-commerce Search Relevance","version":4},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-04T10:53:07.774986Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2510.08048"},"observation_digest":"sha256:ff012d12cc0c0e34acd4d6d1bf6fb4b584cdaa31a4b1e0b95c111330a4b03a72","observation_id":"05404bdc-9d67-4074-b0fe-25f965c19a8b","resolution":{"observed_at":"2026-08-04T10:53:07.774986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2604.05595","last_updated":"2026-04-07T08:43:36Z","snapshot_observed_at":"2026-07-06T22:54:16.913706Z","submitted_at":"2026-04-07T08:43:36Z","title":"Uncovering Linguistic Fragility in Vision-Language-Action Models via Diversity-Aware Red Teaming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T19:53:03.177349Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2604.05595"},"observation_digest":"sha256:60dcfdcfdc6958ea6a13dcfe7b8ab0e9247ccf6563eb3966037a0d68d7329ca2","observation_id":"b84bfd9d-e694-48cc-8093-a6b07bbae84d","resolution":{"observed_at":"2026-05-10T22:25:51.541835Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2604.10812","last_updated":"2026-04-12T20:46:47Z","snapshot_observed_at":"2026-07-06T22:59:23.126963Z","submitted_at":"2026-04-12T20:46:47Z","title":"PokeRL: Reinforcement Learning for Pokemon Red","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T15:38:17.474509Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2604.10812"},"observation_digest":"sha256:5fd1193eabe7ba91b1c1310434f845747d265a23f4d0e2cd8b780f2fa1a7c808","observation_id":"d617b402-533e-4565-bbe1-64537fbb271d","resolution":{"observed_at":"2026-05-11T10:06:04.951429Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2605.16030","last_updated":"2026-05-27T13:07:05Z","snapshot_observed_at":"2026-08-03T22:13:32.480010Z","submitted_at":"2026-05-15T15:05:58Z","title":"Mind Dreamer: Untethering Imagination via Active Causal Intervention on Latent Manifolds","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-20T21:05:25.270040Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2605.16030"},"observation_digest":"sha256:125e7f8867d79e7a609b106c8e5009edd79caf1a1f13e1df1752ac7e9264d428","observation_id":"004a8e9c-b238-4718-bd55-0e1fbb61e780","resolution":{"observed_at":"2026-05-20T21:09:02.732016Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2605.16030","last_updated":"2026-05-27T13:07:05Z","snapshot_observed_at":"2026-08-03T22:13:32.480010Z","submitted_at":"2026-05-15T15:05:58Z","title":"Mind Dreamer: Untethering Imagination via Active Causal Intervention on Latent Manifolds","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T19:12:50.479241Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2605.16030"},"observation_digest":"sha256:8ab74efe8195f15adaaf43857999ff498c266f5dc417e2b23c50a8d9ecb9cf1a","observation_id":"6b3450c5-2622-43b9-ae66-93331973bc51","resolution":{"observed_at":"2026-06-30T19:15:00.360948Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2605.16725","last_updated":"2026-05-16T00:18:22Z","snapshot_observed_at":"2026-07-06T23:27:48.303599Z","submitted_at":"2026-05-16T00:18:22Z","title":"Baba in Wonderland: Online Self-Supervised Dynamics Discovery for Executable World Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-19T21:47:11.983066Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2605.16725"},"observation_digest":"sha256:a896b4dc2d5766a4f8c061287e857ab9a568ac396cf8eaa8545c1c6b762a945d","observation_id":"5ae92e95-fec7-4c31-9a07-229b1969dbf4","resolution":{"observed_at":"2026-05-19T21:47:48.372712Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2605.17486","last_updated":"2026-05-17T14:55:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-17T14:55:32Z","title":"DyGRO-VLA: Cross-Task Scaling of Vision-Language-Action Models via Dynamic Grouped Residual Optimization","version":1},"reference_index":147,"source":"arxiv_source","source_observed_at":"2026-05-20T12:39:50.004269Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2605.17486"},"observation_digest":"sha256:c52ae2969cd230ec7f04be20717cc2bfe393d3aa097812184360e2b500ce94bc","observation_id":"d746323c-b89a-4ddf-a4fe-e3896b8ca00c","resolution":{"observed_at":"2026-05-20T12:43:17.014465Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2605.20654","last_updated":"2026-06-03T08:00:52Z","snapshot_observed_at":"2026-08-02T18:56:31.274465Z","submitted_at":"2026-05-20T03:16:15Z","title":"REFLECTOR: Internalizing Step-wise Reflection against Indirect Jailbreak","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-21T06:16:01.040236Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2605.20654"},"observation_digest":"sha256:133b135b1a36623595c02bd25205a8031b51ba9388ea05e0730a759df825b261","observation_id":"b6ab44df-a973-412d-b211-e743e218b7c1","resolution":{"observed_at":"2026-05-21T06:19:42.017967Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:628e220cbc1e6633f70c069f35f918dae6aa48b879631d5af663d28098fea629","observation_id":"2759fabd-86b8-46a4-ae4b-5750368d85a7","resolution":{"observed_at":"2026-06-29T08:53:15.569692Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2606.03177","last_updated":"2026-06-15T21:39:17Z","snapshot_observed_at":"2026-08-05T07:38:09.225754Z","submitted_at":"2026-06-02T05:31:32Z","title":"ConTrack: Constrained Hand Motion Tracking with Adaptive Trade-off Control","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T10:13:29.399114Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2606.03177"},"observation_digest":"sha256:3bf15e5c0ddd8f7ab205ac983fdab13717e7475792b08cdfd44ae828ab0a0ed5","observation_id":"75937c7e-9c47-4dfd-a7ee-7229a3138c8a","resolution":{"observed_at":"2026-07-02T03:16:33.872703Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2606.26294","last_updated":"2026-06-29T17:13:25Z","snapshot_observed_at":"2026-07-07T00:00:36.766142Z","submitted_at":"2026-06-24T18:38:26Z","title":"The Red Queen G\\\"odel Machine: Co-Evolving Agents and Their Evaluators","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-26T01:44:21.189095Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2606.26294"},"observation_digest":"sha256:1c6f03ecfc8290b87d1692b3a51f242a9b2ddcd0dc5e89a7c162bcff0f44103d","observation_id":"70c5dc13-8388-47fe-9647-63a371b7d344","resolution":{"observed_at":"2026-07-04T15:19:56.486958Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2606.26294","last_updated":"2026-06-29T17:13:25Z","snapshot_observed_at":"2026-07-07T00:00:36.766142Z","submitted_at":"2026-06-24T18:38:26Z","title":"The Red Queen G\\\"odel Machine: Co-Evolving Agents and Their Evaluators","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-30T09:30:39.106838Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2606.26294"},"observation_digest":"sha256:cb56725c81da56c7c8bd72e2e7b0bde71324e2fe02a812d7f9486c74677006b6","observation_id":"97995bec-4cce-4319-94e8-66108d5c6b55","resolution":{"observed_at":"2026-06-30T09:34:34.706624Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2606.26333","last_updated":"2026-06-24T19:16:34Z","snapshot_observed_at":"2026-08-08T17:20:16.758054Z","submitted_at":"2026-06-24T19:16:34Z","title":"Mesh-RL: Coupled subgrid reinforcement learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T01:37:31.834106Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2606.26333"},"observation_digest":"sha256:0d21b43de538e4e78f66e7ec6ee05036597abb7c7dfcac1b67f1df15541436e8","observation_id":"8b571451-306a-446d-9365-0c52851e27b2","resolution":{"observed_at":"2026-07-04T15:29:55.590065Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2606.28433","last_updated":"2026-06-26T03:19:27Z","snapshot_observed_at":"2026-08-02T05:01:56.168457Z","submitted_at":"2026-06-26T03:19:27Z","title":"Position: RL Researchers Need to Distinguish Between Solving Simulators and Using Simulators as a Proxy","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T01:28:44.074862Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2606.28433"},"observation_digest":"sha256:2fa0bc9a0d70a028025d6da4120ecd9dc9faf4f6ea0c1ec0496351e56545e166","observation_id":"4a3d1d1b-a308-45fe-8c5c-5662f1416943","resolution":{"observed_at":"2026-07-01T15:25:48.454088Z","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":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-14T14:14:16.578488Z","title":"Ecoffet, J","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2607.09971","last_updated":"2026-07-10T20:55:01Z","snapshot_observed_at":"2026-07-16T23:18:07.324369Z","submitted_at":"2026-07-10T20:55:01Z","title":"TopoExplore: Topological Discrimination for Archive-Based Exploration","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T14:14:16.578488Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2607.09971"},"observation_digest":"sha256:4b8205191f4a7099951121c174ceb8bc67dce9a3f3d8f0c98cdef2b089cdf313","observation_id":"aee746cb-ce86-4970-89e9-4979ed0a3bac","resolution":{"observed_at":"2026-07-14T14:14:16.578488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1901.10995/citation-record","integrity":"/paper/1901.10995/integrity","json":"/paper/1901.10995/citation-record.json","paper":"/paper/1901.10995"},"outbound":[],"paper":{"arxiv_id":"1901.10995","last_updated":"2021-02-26T21:21:11Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems"},"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 27 inbound Pith citation observations for arXiv:1901.10995."}