{"as_of":"2026-08-11T19:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:56c694dabf8ab3bbc9867df9e3c53adb5fddf9950f04500c25f3c45eb797924c","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:21:23.104750Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.02330/citation-record","integrity":"/paper/2501.02330/integrity","json":"/paper/2501.02330/citation-record.json","paper":"/paper/2501.02330"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.869868Z","title":null,"venue":null,"work_id":"42ab7cea-f07b-4b82-bccd-1e1625ef9974","year":2004},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.905224Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:e47ea605560033a07a83805161313ffd4f9b376f1b8c0f5343652892d16b99f3","observation_id":"4b67c23e-9c47-49c7-b547-a4314e23899c","resolution":{"observed_at":"2026-08-10T22:21:23.873760Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.06463","last_updated":"2022-10-12T17:59:02Z","snapshot_observed_at":"2026-08-11T14:39:18.715144Z","submitted_at":"2022-10-12T17:59:02Z","title":"Holo-Dex: Teaching Dexterity with Immersive Mixed Reality","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.06463","snapshot_observed_at":"2026-08-10T22:21:22.909253Z","title":"Holo-dex: Teaching dexterity with immersive mixed reality","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.909253Z"},"links":{"cited_paper":"/paper/2210.06463","citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:724732ce975845ef631d15096eb060abe16f032b7cb7aad697a491ae8fca3f84","observation_id":"45d5f5d2-17b0-41d4-b5d2-1f7abf21edcc","resolution":{"observed_at":"2026-08-10T22:21:22.909253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.856957Z","title":"Ball, Laura Smith, Ilya Kostrikov, and Sergey Levine","venue":null,"work_id":"359363b8-a8fa-40ba-97a0-759965363be3","year":2023},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.913041Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:e7e47cabeeb704a164c247b793d5f5ae7f23a963306299a2df1619a2ba4bafa4","observation_id":"9f446d9b-6532-41f4-8b6f-d4dfe2c7474c","resolution":{"observed_at":"2026-08-10T22:21:23.861331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.843970Z","title":"Successor features for transfer in reinforcement learning","venue":null,"work_id":"638024c1-6acd-4239-ac13-5bc98fedb4e4","year":2017},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.917077Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:6e9b3c2395aabc4b5d481578275f205a7b94bb04088c82fd1001b1afa450b379","observation_id":"3b7a34cf-ab4a-4c77-94ff-d057352f0d79","resolution":{"observed_at":"2026-08-10T22:21:23.848412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.831987Z","title":"Mankowitz, Hado van Hasselt, R \\' e mi Munos, David Silver, and Tom Schaul","venue":null,"work_id":"4e527ebe-9746-43ef-af64-85812c61f2e9","year":2019},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.920685Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:e5d99350767ad0ab4777501082189a18971964104ef7e391def405c1b45b64e6","observation_id":"a7c0a29f-cc80-4f15-871b-1ead3ef0b752","resolution":{"observed_at":"2026-08-10T22:21:23.836204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:22.924202Z","title":null,"venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.924202Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:17cdf0f906cf291955196a228241ab123ac1c55698b39821298006559e8f9ec7","observation_id":"53128db3-72b6-48c0-a928-6b2bbb6b5244","resolution":{"observed_at":"2026-08-10T22:21:22.924202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.819055Z","title":"Successor feature sets: Generalizing successor representations across policies","venue":null,"work_id":"a6525738-e45b-49d4-8448-873894903b99","year":2021},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.928212Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:de1139ba68fc69eece5428b199478f50b50b17d763ef9ec6ff11eaebad939a8c","observation_id":"ddb19ae1-8db5-4144-90dd-99d09d2097cf","resolution":{"observed_at":"2026-08-10T22:21:23.823412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03741","last_updated":"2023-02-17T17:00:34Z","snapshot_observed_at":"2026-08-03T14:31:51.401500Z","submitted_at":"2017-06-12T17:23:59Z","title":"Deep reinforcement learning from human preferences","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03741","snapshot_observed_at":"2026-08-10T22:21:22.931667Z","title":"Brown, Miljan Martic, Shane Legg, and Dario Amodei","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.931667Z"},"links":{"cited_paper":"/paper/1706.03741","citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:acce023e8241fedec5ace25cb78607cd68e2e6e5b33d23995689044f829ca07c","observation_id":"a06bce04-d870-4e87-9cfb-a7701e64f92b","resolution":{"observed_at":"2026-08-10T22:21:22.931667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.807057Z","title":"Improving generalization for temporal difference learning: The successor representation","venue":null,"work_id":"184194e9-59bd-4d90-9edd-889358625d83","year":1993},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.935625Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:8fcb6589febb5c64adb9fe347005d154d24742819fe80cfd28b0bc170db5744e","observation_id":"ccafeb6d-ad73-414e-928c-1ca7945b7ecb","resolution":{"observed_at":"2026-08-10T22:21:23.811217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.794631Z","title":"Model alignment as prospect theoretic optimization","venue":null,"work_id":"57aad31a-eddc-47db-99a8-521c675b0fe6","year":2024},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.939240Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:421d1cbc0395b5ed7c0df145429d41a5ecb54330065246d5349d3b70e584aca4","observation_id":"6fef980f-accc-4aa1-85d1-54d43be59acb","resolution":{"observed_at":"2026-08-10T22:21:23.798882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.781430Z","title":"Psiphi-learning: Reinforcement learning with demonstrations using successor features and inverse temporal difference learning","venue":null,"work_id":"44ff9f33-2b06-454b-bc83-4939caef3a41","year":2021},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.942905Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:9ce323e2e2c7d7a7cc1849d7d14c68c50fe4d0951a0d33060f2b7291a1ad1b07","observation_id":"bb78bb06-bbcf-4b1d-b8dd-9e76232d41a9","resolution":{"observed_at":"2026-08-10T22:21:23.785507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.768564Z","title":"Learning robust rewards with adverserial inverse reinforcement learning","venue":null,"work_id":"e822e66f-bfb5-4c13-b364-090b6b53becf","year":2018},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.946811Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:daf1b8d47b0089de25e78e3dfdc657423848f2f7c5f4f4992a5c283e9d93258b","observation_id":"5b84edfd-463f-457d-8b94-7a7ee6b92a03","resolution":{"observed_at":"2026-08-10T22:21:23.772900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:22.950147Z","title":"D4rl: Datasets for deep data-driven reinforcement learning, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.950147Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:7ee4938289e4f0bfefb9a08082236210476f1f63935adafc388ba5f35d0cd455","observation_id":"a38220d3-3d03-43c0-93af-1d0600590a04","resolution":{"observed_at":"2026-08-10T22:21:22.950147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.749857Z","title":"Addressing function approximation error in actor-critic methods","venue":null,"work_id":"09f3f00c-8d97-40b0-bcb0-6dc62d0bdcb6","year":2018},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.953505Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:6833d51aad04ed51de263ea1b164a61484923c0c5e10731e0b7245911eba40ec","observation_id":"b032dc46-b8d2-47ed-ac25-587239e7229f","resolution":{"observed_at":"2026-08-10T22:21:23.753908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.738697Z","title":"Off-policy deep reinforcement learning without exploration","venue":null,"work_id":"ab0b14d4-0385-4019-8160-df34a251ca72","year":2019},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.957005Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:8f442f37f91e796f0cd948e3490cb91827310e8a19a6225603e28839a58d2ce8","observation_id":"c21cba52-019b-4603-8f2b-5b543a75985c","resolution":{"observed_at":"2026-08-10T22:21:23.742706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.725888Z","title":"For sale: State-action representation learning for deep reinforcement learning","venue":null,"work_id":"1f6bfa17-338c-48bd-b80e-5a02254b2ec9","year":2024},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.960390Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:cdf0d1a89dd2840e53ea79f6615aa57d5dbe456cb3f6cb97188b602c0c05b09e","observation_id":"0473402f-a42b-4a25-8cc5-9fb1d6d03623","resolution":{"observed_at":"2026-08-10T22:21:23.731061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.714548Z","title":"Iq-learn: Inverse soft-q learning for imitation","venue":null,"work_id":"8a965d0e-0f5c-4975-9778-4bd4da8c1568","year":2021},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.963975Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:a661009b0387a046b85bc1eba2c7223f46fed0b941d566852de6bcd22a518bbb","observation_id":"e5b6a7b7-ba45-4839-b6a0-fbc48437ce4d","resolution":{"observed_at":"2026-08-10T22:21:23.718243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.703191Z","title":"Extreme q-learning: Maxent RL without entropy","venue":null,"work_id":"7ffcfa1d-b5b8-4e2b-b310-60aa8984056c","year":2023},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.967608Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:dc41c2cbf0c40b53c55dd48bff10ad3825d634dda38ead23755f9352444e0709","observation_id":"ec67118d-7084-4e4e-9012-c5b25488bf0a","resolution":{"observed_at":"2026-08-10T22:21:23.707137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.690816Z","title":"A divergence minimization perspective on imitation learning methods, 2019","venue":null,"work_id":"0bcffb68-bfd2-4b7e-a700-8dd618be76fa","year":2019},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.970922Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:95cdf52bfd9a4521cece66a29d183604288cbc63256fd6a95a535d7ffde35d37","observation_id":"e466d414-70cd-49ac-8deb-ff3198d53b83","resolution":{"observed_at":"2026-08-10T22:21:23.694803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1406.2661","last_updated":"2014-06-10T18:58:17Z","snapshot_observed_at":"2026-07-06T03:46:00.791740Z","submitted_at":"2014-06-10T18:58:17Z","title":"Generative Adversarial Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.2661","snapshot_observed_at":"2026-08-10T22:21:22.974806Z","title":"Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.974806Z"},"links":{"cited_paper":"/paper/1406.2661","citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:859c5595c40334926d434d5432de25e4fb9c91145ee92e69f4c7fff0ec1013d8","observation_id":"46076099-306e-4647-a5f8-2df7d07e80b5","resolution":{"observed_at":"2026-08-10T22:21:22.974806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.678350Z","title":"Maniskill2: A unified benchmark for generalizable manipulation skills","venue":null,"work_id":"a379c984-6f06-4613-b1b8-fad3cd62c202","year":2023},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.978934Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:8c60161be64c915c724383f6d25a33658a3140268b26f9602433444380b1f893","observation_id":"fb4d58a3-5be3-460b-9b16-11712bd38b1f","resolution":{"observed_at":"2026-08-10T22:21:23.682125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.665993Z","title":"Generative adversarial imitation learning","venue":null,"work_id":"27d708bd-be22-4cc5-b50a-d94d2e2d2af7","year":2016},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.982372Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:7c90d711a3340c627eeb95d53774d8d3f88c2460f73bbb617b2afc9290afffe8","observation_id":"5125191d-55c1-4633-aa9a-5761f45d6a23","resolution":{"observed_at":"2026-08-10T22:21:23.670608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.651138Z","title":"Revisiting successor features for inverse reinforcement learning","venue":null,"work_id":"d0efe19c-df6d-48e2-a080-ca558de60aae","year":2024},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.986249Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:9a719af3fcee4077e431ffd4e25677bd5287a41d29565630e2033e49504b1e1c","observation_id":"824744c3-32a9-4835-a5e6-916791ccd87a","resolution":{"observed_at":"2026-08-10T22:21:23.655636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.637318Z","title":"Deep inverse q-learning with constraints","venue":null,"work_id":"865f7050-3944-48d5-a047-b9d78745b903","year":2020},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.989954Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:dc37b99c368064c33aead6d1c736f0857da06231afed9c7d6afdc579c26579b7","observation_id":"5c12df2f-4ff4-44f1-a3ad-67a9b76dc95d","resolution":{"observed_at":"2026-08-10T22:21:23.642876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.622878Z","title":"Imitation learning as f -divergence minimization, 2020","venue":null,"work_id":"bbed81fb-9b88-4f8c-b62c-f9dd30829de0","year":2020},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.993525Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:7035cab6e49052e2d919170b527fef56fbb01c7276180695c3e441e4e2e17824","observation_id":"e9a365a7-5379-48fd-83c1-7445ac51e84b","resolution":{"observed_at":"2026-08-10T22:21:23.627879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.610839Z","title":"Discriminator-actor-critic: Addressing sample inefficiency and reward bias in adversarial imitation learning","venue":null,"work_id":"25ab1b01-03ae-4569-9657-55196f32b6de","year":2019},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:22.996926Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:a740d730c399d1072e58a528a8306e1e753aa5f5edc9993d8fa031937cf86d66","observation_id":"51b6f6ec-49d9-46ed-afd8-cfba2e80545e","resolution":{"observed_at":"2026-08-10T22:21:23.614989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.599220Z","title":"Imitation learning via off-policy distribution matching","venue":null,"work_id":"73b98fc4-d4aa-40cf-ba0e-9c85ec3ceb99","year":2020},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.000416Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:ac21caafcb64f49ec79c525e0dd7bcd090f3b193d005ffa1271fe01f5dfa61f4","observation_id":"f40d1fbc-6f00-4ca6-9c75-cf8a8a4fd187","resolution":{"observed_at":"2026-08-10T22:21:23.603124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.004356Z","title":"Offline reinforcement learning with implicit q-learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.004356Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:b7763d9fa292d84b73c14e0cdbd0ce0bd18139c5c26d34deb220a5dd87fe2cb9","observation_id":"d38b1494-317b-4fb6-9020-d3801ac98c92","resolution":{"observed_at":"2026-08-10T22:21:23.004356Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.02396","last_updated":"2016-06-08T04:48:49Z","snapshot_observed_at":"2026-07-06T04:59:11.325942Z","submitted_at":"2016-06-08T04:48:49Z","title":"Deep Successor Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.02396","snapshot_observed_at":"2026-08-10T22:21:23.007879Z","title":"Kulkarni, Ardavan Saeedi, Simanta Gautam, and Samuel J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.007879Z"},"links":{"cited_paper":"/paper/1606.02396","citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:5d826ccfaccabd2bdb17b07e1b8c22a58708b222ecb5851d64277f03df8f49fc","observation_id":"492e82f3-6417-4ea7-8bec-4a96a47cb649","resolution":{"observed_at":"2026-08-10T22:21:23.007879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.580295Z","title":"Conservative q-learning for offline reinforcement learning","venue":null,"work_id":"6769e865-aaaa-4231-8d46-9b5dca85c53f","year":2020},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.011851Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:d5301932936ebf73034d5306eea8f6a30243954d3ba11209e498552b4b265f74","observation_id":"baaab7a1-1292-4b63-995c-c19ef609b95e","resolution":{"observed_at":"2026-08-10T22:21:23.584257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.015503Z","title":"Batch Reinforcement Learning, pp.\\ 45--73","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.015503Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:c9457cdf4602e301ad5c714479763df6198d4dfe518ec759c5503aec527e1b4f","observation_id":"2c855f70-6c92-4a1e-bf3a-4bbb17246f83","resolution":{"observed_at":"2026-08-10T22:21:23.015503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.568407Z","title":"Energy-based imitation learning","venue":null,"work_id":"87e24ca8-069c-4d33-89ce-a6b90bfe698d","year":2021},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.019228Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:d4745ab54aa9a4e6c956e18bee811ea95b7bd75d334084c32f70a13e0dba506b","observation_id":"cfdfbf27-39bf-4cad-b1e2-d51bb413f8c2","resolution":{"observed_at":"2026-08-10T22:21:23.572467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.556892Z","title":"Learning self-correctable policies and value functions from demonstrations with negative sampling","venue":null,"work_id":"f38c3fb9-e410-4c98-b9b2-ced378ba28bf","year":2020},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.022851Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:c8c2b2150956348c4d9c5bbbf13577bbd10b34b365c7dc68503be4da8cf9f2a0","observation_id":"82b1b85c-db3f-4e4f-bcbc-7d1f4e203a34","resolution":{"observed_at":"2026-08-10T22:21:23.560852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.026552Z","title":"Count-based exploration with the successor representation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.026552Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:fed341423aad126108abc7a5672656afae98fec931842bce7f043f40bf843dec","observation_id":"fb73b68b-b885-4d72-b167-9fca4ae69a4b","resolution":{"observed_at":"2026-08-10T22:21:23.026552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.030323Z","title":"Rusu, Joel Veness, Marc G","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.030323Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:fe6bd8dbd954c36d79c3781fc775b7594a41b8463c08a851ea12b74afa286945","observation_id":"7c904107-37ba-4b24-875a-57b4b6dc007b","resolution":{"observed_at":"2026-08-10T22:21:23.030323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.537675Z","title":"A first-occupancy representation for reinforcement learning","venue":null,"work_id":"5cfe9937-1c84-4d56-b79e-5a96e2e9b6b2","year":2022},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.034464Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:9bc5a8f4c341446128e5661b14508115780c669784d8706759005cf75a9cc243","observation_id":"95d98138-d117-444a-a2db-4837b87d4b78","resolution":{"observed_at":"2026-08-10T22:21:23.542158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.526175Z","title":"Dualdice: Behavior-agnostic estimation of discounted stationary distribution corrections, 2019","venue":null,"work_id":"2ca21ccf-18a8-4a7e-b33d-b9e4edf62310","year":2019},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.037537Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:23c2ed4de96ed7d8a2d99382d82d5866d27646cdf9bd95587e96c7217361b19f","observation_id":"385f08cf-0c36-4d1d-82dc-29d1e280304d","resolution":{"observed_at":"2026-08-10T22:21:23.530228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.515275Z","title":"Ng and Stuart Russell","venue":null,"work_id":"117b4386-b7cc-49ad-950b-86fea03e8eca","year":2000},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.040286Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:31b44f5034e6cd4cb5d2a0cbfee42dd44ac365c10684d42e622b16b8ad9503b7","observation_id":"ed1cd8c7-c50a-4591-b519-1eaf0f81858e","resolution":{"observed_at":"2026-08-10T22:21:23.518989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.503809Z","title":"Bridging state and history representations: Understanding self-predictive rl, 2024","venue":null,"work_id":"d25d872b-eec8-4341-b11c-7e0f1f9bc3d5","year":2024},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.043526Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:dfb7fc197092d4ccf3db8c73ea79d58a5ab9172aed4b7a7c6d4f6d749705b55d","observation_id":"920dbc8a-5536-4cb4-8ad1-5217836fdb9a","resolution":{"observed_at":"2026-08-10T22:21:23.507422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.046666Z","title":"Efficient training of artificial neural networks for autonomous navigation","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.046666Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:3970ecdcd1aef9b5f9b1d74725c1740ba88738137a832c763a370141f83e1ef0","observation_id":"270bce38-e486-4197-8d02-1701a146b962","resolution":{"observed_at":"2026-08-10T22:21:23.046666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.050183Z","title":"Puterman","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.050183Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:76a69a6b2b3e4a4ba8ac60f5ed5a2fa5aa887624e9d767ee81ce463d397e25be","observation_id":"ffc88be0-7288-4e31-8794-233f4ad09433","resolution":{"observed_at":"2026-08-10T22:21:23.050183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18290","last_updated":"2024-07-29T22:26:36Z","snapshot_observed_at":"2026-08-01T16:34:38.795326Z","submitted_at":"2023-05-29T17:57:46Z","title":"Direct Preference Optimization: Your Language Model is Secretly a Reward Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18290","snapshot_observed_at":"2026-08-10T22:21:23.053264Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.053264Z"},"links":{"cited_paper":"/paper/2305.18290","citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:7b06f9163830ef36e7b8375df1c9e496001e4decd5c1196a4bf3bcf1f4fe58b8","observation_id":"cbc410ba-2fc0-4486-ad18-38a88682a827","resolution":{"observed_at":"2026-08-10T22:21:23.053264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.056451Z","title":"Learning Complex Dexterous Manipulation with Deep Reinforcement Learning and Demonstrations","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.056451Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:80221e557f6970efb48d2fd50020e846503b14e91187f9b270e8919f5e8ec47d","observation_id":"638f87b3-4306-490b-a380-387fc0236d02","resolution":{"observed_at":"2026-08-10T22:21:23.056451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.477738Z","title":"A motion retargeting method for effective mimicry-based teleoperation of robot arms","venue":null,"work_id":"0030569f-f6b6-406e-a0ef-e5e4266eb84e","year":2017},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.059814Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:e336731413a639ebcac2d37b722ce5450fb93b18c648479f2ce2d2b46f632a99","observation_id":"302cd67a-e909-4572-b325-0ddc319b4d27","resolution":{"observed_at":"2026-08-10T22:21:23.481317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.466882Z","title":"Dragan, and Sergey Levine","venue":null,"work_id":"9dfe08ad-a872-48a5-9b10-80dff4975c81","year":2020},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.062855Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:31d1902666c9cdc134c7c1ad173f311cb21fe8ceb6afc30ec2afe94547b41e6c","observation_id":"e0b5629e-d842-44e3-b7a8-11593c3bcab7","resolution":{"observed_at":"2026-08-10T22:21:23.470428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1011.0686","last_updated":"2011-03-16T18:51:21Z","snapshot_observed_at":"2026-08-03T22:17:51.826967Z","submitted_at":"2010-11-02T17:55:55Z","title":"A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1011.0686","snapshot_observed_at":"2026-08-10T22:21:23.066567Z","title":"Gordon, and J","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.066567Z"},"links":{"cited_paper":"/paper/1011.0686","citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:c7452d378df585c427abcdd09d66a0178db7d8d0d83141e68435adf212fba6c8","observation_id":"5f7a51b9-4a93-49ee-bd76-ff0481931ac2","resolution":{"observed_at":"2026-08-10T22:21:23.066567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.454600Z","title":"Dual rl: Unification and new methods for reinforcement and imitation learning, 2023","venue":null,"work_id":"4c01ad66-d18f-4e04-872f-598724dbbcea","year":2023},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.070585Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:3f867ef97b56ba2f2e97a86f4b4c19433c9d92847edf3a9e3600ec749c005db2","observation_id":"6826ce05-3b2d-4427-a5dd-9fa7d11300d1","resolution":{"observed_at":"2026-08-10T22:21:23.458920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.443468Z","title":"Lewis, and A","venue":null,"work_id":"6543d31e-86a9-4706-83f1-1309e00be9c2","year":2009},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.074251Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:963844c9f9e3aaec63db9f853dbf7fa708a9daa6de4e30dd5ba1d4ee14d21d14","observation_id":"313881f8-6826-4a4d-8e63-71e03ff540b7","resolution":{"observed_at":"2026-08-10T22:21:23.447364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.431212Z","title":"Issues in using function approximation for reinforcement learning","venue":null,"work_id":"84f37b43-7a79-4dc5-a8f3-338d87b9022b","year":1999},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.078004Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:8a96bd6dcaacbf9c78c4cf8561f235b2fe021819f98bb2c1e7def97b6a244d31","observation_id":"9b231494-24e3-4c0f-b569-5c8a1594e147","resolution":{"observed_at":"2026-08-10T22:21:23.436180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.081882Z","title":"Mujoco: A physics engine for model-based control","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.081882Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:5eb794d6601471688072b0e21e1baa856cb5dcfc0a759e23200c37c39bfbd458","observation_id":"3722a0c4-167e-44aa-b916-c7e4f949d9e0","resolution":{"observed_at":"2026-08-10T22:21:23.081882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.085538Z","title":"Munchausen reinforcement learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.085538Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:d63b0012ad8ee85275374a1d493e232cd97f612ec203a6ee71242a590d95f0ea","observation_id":"d7423c8d-55a4-4073-ad02-9f5fe3e79d43","resolution":{"observed_at":"2026-08-10T22:21:23.085538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.089529Z","title":"Daydreamer: World models for physical robot learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.089529Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:bb90de1a896d1ef262d34367df7a47bfaaac661f8af200d8923302b9ae05b1c6","observation_id":"20523608-9296-4a7f-8d1f-f9188dde7aa6","resolution":{"observed_at":"2026-08-10T22:21:23.089529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.093332Z","title":"Gello: A general, low-cost, and intuitive teleoperation framework for robot manipulators, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.093332Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:8e036f68b531295e20c5a676373745da67f0ba7fbcd10166f3ba0121c3e12253","observation_id":"47c83658-6a74-4aee-9caf-8e85680b5d09","resolution":{"observed_at":"2026-08-10T22:21:23.093332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.398503Z","title":"Offline rl with no ood actions: In-sample learning via implicit value regularization","venue":null,"work_id":"2e3a6e17-91c6-426e-88df-0b9b34e4ac8d","year":2023},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.097383Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:cdbb076aabd919b0367a24b3934584e0f58d876b1ebb41272715839e8afe1084","observation_id":"c06728c8-6e80-444e-9aae-d8bba8838704","resolution":{"observed_at":"2026-08-10T22:21:23.402805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.383954Z","title":"Deep reinforcement learning with successor features for navigation across similar environments","venue":null,"work_id":"dc18eb28-e0ff-4a3f-a2de-e7678b6740a3","year":2017},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.100930Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:82a2fd4aa9bef73b4f834b7033c5eb5d87f7123a99a15ac229b9b4abd9095f8c","observation_id":"054f9da7-b1eb-4f61-9bb6-18f39e83b3e3","resolution":{"observed_at":"2026-08-10T22:21:23.390055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:21:23.104750Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled","version":3},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-10T22:21:23.104750Z"},"links":{"citing_paper":"/paper/2501.02330"},"observation_digest":"sha256:f54efe8b1c5c856cbbb416ad3f879ffd894ca69ad197ef8d9dfaae873cd279c5","observation_id":"93c77db1-874a-465f-8d44-05beaddeadc4","resolution":{"observed_at":"2026-08-10T22:21:23.104750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.02330","last_updated":"2025-06-12T13:18:51Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T05:17:04.564198Z","submitted_at":"2025-01-04T16:21:10Z","title":"SR-Reward: Taking The Path More Traveled"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":35},"total_outbound_references":56},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2501.02330."}