{"as_of":"2026-08-19T06:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fec5ac346e62b260cfb111b8c46cffc2b4782b3a95eda5adcae02e59d834d1c7","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:14:53.767889Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2506.17155/citation-record","integrity":"/paper/2506.17155/integrity","json":"/paper/2506.17155/citation-record.json","paper":"/paper/2506.17155"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.04543","last_updated":"2020-06-22T04:32:50Z","snapshot_observed_at":"2026-08-18T19:30:48.126691Z","submitted_at":"2019-07-10T07:23:27Z","title":"An Optimistic Perspective on Offline Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04543","snapshot_observed_at":"2026-08-15T19:14:53.269705Z","title":"Striving for simplicity in off-policy deep reinforcement learning","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.269705Z"},"links":{"cited_paper":"/paper/1907.04543","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:0834cb38635be5c2b47553ae4fad9846ae52899845687caa8b835c2fe7f7fee2","observation_id":"187a23e9-57eb-4fae-891d-5d52f0aa68c0","resolution":{"observed_at":"2026-08-15T19:14:53.269705Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.15578","last_updated":"2021-12-31T18:05:33Z","snapshot_observed_at":"2026-08-18T08:30:18.918086Z","submitted_at":"2021-12-31T18:05:33Z","title":"Importance of Empirical Sample Complexity Analysis for Offline Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2112.15578","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.15578","snapshot_observed_at":"2026-08-15T19:14:54.063057Z","title":"Importance of Empirical Sample Complexity Analysis for Offline Reinforcement Learning","venue":"cs.LG","work_id":"25919a09-907e-4b6d-a006-21745b710853","year":2021},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.313053Z"},"links":{"cited_paper":"/paper/2112.15578","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:1e2f7e4aa4a8f5212deb5e8d50ee6ff3aaabe380ea22a4deb49fb4b936fdc13b","observation_id":"e9e92f33-433c-4811-96ca-44c86fdb7111","resolution":{"observed_at":"2026-08-15T19:14:54.069310Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.15579","last_updated":"2021-12-31T18:10:02Z","snapshot_observed_at":"2026-08-16T17:30:53.306069Z","submitted_at":"2021-12-31T18:10:02Z","title":"Single-Shot Pruning for Offline Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.15579","snapshot_observed_at":"2026-08-15T19:14:53.336007Z","title":"Single-shot pruning for offline reinforcement learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.336007Z"},"links":{"cited_paper":"/paper/2112.15579","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:6bf3fc9bb7cbdf8e8e5c809742ac7b6c2781bc99aecad154fd09500c73f01f38","observation_id":"5d17773e-dde5-4b96-925d-0897b0573e2e","resolution":{"observed_at":"2026-08-15T19:14:53.336007Z","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-15T19:14:54.322769Z","title":"Efficient reinforcement learning by discovering neural pathways","venue":null,"work_id":"81f8b7cd-7ea4-48ea-b159-f99a033f1541","year":2025},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.340388Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:034c98f3fb9f71ae0c98b84d493d6929a670ca29e3dcb634ff7c82819b915353","observation_id":"fd086a6d-666c-4359-8da1-192873985c8e","resolution":{"observed_at":"2026-08-15T19:14:54.327918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.06450","last_updated":"2016-07-21T19:57:52Z","snapshot_observed_at":"2026-08-15T04:53:45.483331Z","submitted_at":"2016-07-21T19:57:52Z","title":"Layer Normalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.06450","snapshot_observed_at":"2026-08-15T19:14:53.344444Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.344444Z"},"links":{"cited_paper":"/paper/1607.06450","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:ae4252b0e9878eac423872e0d0093f5516e5138f66393a1b9e9dc8cd62be7e7e","observation_id":"596cd0c1-c9c8-4a91-9c94-0cf1b56dc04f","resolution":{"observed_at":"2026-08-15T19:14:53.344444Z","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-15T19:14:53.348777Z","title":"Pattern Recognition and Machine Learning","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.348777Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:7617254c8249e454a592c1f95cc68bdcda2ad8284f98aeb04290f9d68eb67d8a","observation_id":"cfc3f37d-d932-4356-9fca-df860ca50c1c","resolution":{"observed_at":"2026-08-15T19:14:53.348777Z","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-15T19:14:53.352944Z","title":"What is the state of neural network pruning? Proceedings of machine learning and systems, 2: 0 129--146, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.352944Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:ccd7eb531dd760075683d18b4c2f20e4b8472aaae14667c469f83c0ccf47dd5e","observation_id":"9d2b365f-6b7c-4129-934d-3bb3f34cd60c","resolution":{"observed_at":"2026-08-15T19:14:53.352944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.07565","last_updated":"2017-11-09T23:50:55Z","snapshot_observed_at":"2026-08-18T12:15:15.141114Z","submitted_at":"2017-05-22T05:54:37Z","title":"Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeon","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.07565","snapshot_observed_at":"2026-08-15T19:14:53.356884Z","title":"Learning to prune deep neural networks via layer-wise optimal brain surgeon","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.356884Z"},"links":{"cited_paper":"/paper/1705.07565","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:ac37485cab6abd165ef0e2cf17640f5adf6a2752aba37e09acb5ef559379e2fd","observation_id":"609dd8ce-6635-4d76-9c08-8cb31542fd51","resolution":{"observed_at":"2026-08-15T19:14:53.356884Z","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-15T19:14:54.294968Z","title":"Schizophrenia: caused by a fault in programmed synaptic elimination during adolescence? Journal of psychiatric research, 17 0 (4): 0 319--334, 1982","venue":null,"work_id":"9294b4e0-3c75-4517-b628-e793a8566781","year":1982},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.361789Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:81d319f82da8dc0d1de2a1bc5de2ac081982ec7e893e43c5dc024316804fde67","observation_id":"a97405a8-b93e-4cab-8276-5a3ac92c9426","resolution":{"observed_at":"2026-08-15T19:14:54.299226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T19:14:53.365695Z","title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.365695Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:1c071499736689c63286211f3b9005a0f835e30c109cf4cac0fb82458a4575c3","observation_id":"a24f4d5f-2555-4177-aac5-7c1e9f17b489","resolution":{"observed_at":"2026-08-15T19:14:53.365695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07219","last_updated":"2021-02-06T01:57:28Z","snapshot_observed_at":"2026-08-16T08:32:46.407746Z","submitted_at":"2020-04-15T17:18:19Z","title":"D4RL: Datasets for Deep Data-Driven Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.07219","snapshot_observed_at":"2026-08-15T19:14:53.369459Z","title":"D4RL: datasets for deep data-driven reinforcement learning","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.369459Z"},"links":{"cited_paper":"/paper/2004.07219","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:110d1b50b9882049f892ee4a906af91a2d5380212c4b1129df8c80af248b95c6","observation_id":"e8a3f12c-5840-4509-b4a7-60983c2b4974","resolution":{"observed_at":"2026-08-15T19:14:53.369459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06860","last_updated":"2021-12-03T18:58:09Z","snapshot_observed_at":"2026-08-16T18:17:35.064496Z","submitted_at":"2021-06-12T20:38:59Z","title":"A Minimalist Approach to Offline Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.06860","snapshot_observed_at":"2026-08-15T19:14:53.435713Z","title":"A minimalist approach to offline reinforcement learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.435713Z"},"links":{"cited_paper":"/paper/2106.06860","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:78e3fc4dc531e628917f838599c09e0b5926e9c21a4b1c51dff3a50b78aa9c5d","observation_id":"44b8e69e-d2fc-4067-9f05-45e420ee3638","resolution":{"observed_at":"2026-08-15T19:14:53.435713Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.02900","last_updated":"2019-08-10T03:36:31Z","snapshot_observed_at":"2026-08-14T17:47:09.064751Z","submitted_at":"2018-12-07T04:03:25Z","title":"Off-Policy Deep Reinforcement Learning without Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.02900","snapshot_observed_at":"2026-08-15T19:14:53.499845Z","title":"Off-policy deep reinforcement learning without exploration","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.499845Z"},"links":{"cited_paper":"/paper/1812.02900","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:80780c37957dc1d47d540db0c86f950bbfbecef787adc23e754373fd555f44c4","observation_id":"838b30cd-6327-4b5e-b370-03f69d8b8d73","resolution":{"observed_at":"2026-08-15T19:14:53.499845Z","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-15T19:14:54.275279Z","title":"For sale: State-action representation learning for deep reinforcement learning","venue":null,"work_id":"177195e4-c815-43f1-8d54-3181f4f47383","year":2023},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.518689Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:8a3962b3eae8085e73e6f13b86090211e0de0172d8dc9851e7c0cf08893bffb3","observation_id":"8a61d0e1-3ddb-438a-bcb5-3f9aab9f66fd","resolution":{"observed_at":"2026-08-15T19:14:54.279288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.09574","last_updated":"2019-02-25T19:18:40Z","snapshot_observed_at":"2026-08-15T00:50:07.769538Z","submitted_at":"2019-02-25T19:18:40Z","title":"The State of Sparsity in Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.09574","snapshot_observed_at":"2026-08-15T19:14:53.522750Z","title":"The state of sparsity in deep neural networks","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.522750Z"},"links":{"cited_paper":"/paper/1902.09574","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:5ec30bd74a0cdeab89de21f8f4ac9dec502e4d7234763d499ebe6b1e2401f73c","observation_id":"336b8e6b-bf68-4b5b-97b7-15a8f6d89d31","resolution":{"observed_at":"2026-08-15T19:14:53.522750Z","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-15T19:14:54.263959Z","title":"Extreme q-learning: Maxent rl without entropy","venue":null,"work_id":"ae8c2d72-04e9-4f09-a9be-61b6abb5f313","year":2022},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.528457Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:3f2504ed686735b7c6081404c0afb333eb492623cf8b4102dac082842679951e","observation_id":"9eb591a0-a997-4f47-a751-11f28e761d16","resolution":{"observed_at":"2026-08-15T19:14:54.267840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T19:14:54.251750Z","title":"The state of sparse training in deep reinforcement learning, 2022","venue":null,"work_id":"6e9bf7f3-2c17-4b46-8497-08cca6225d5c","year":2022},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.532946Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:145aedce84b36e4641a2e29ff06d6f7b3e9dc612562978f9d97fa538143784f2","observation_id":"db05a267-4a42-4b7d-b6b5-b0e09c8321b4","resolution":{"observed_at":"2026-08-15T19:14:54.256149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T19:14:54.239876Z","title":"Rl unplugged: A suite of benchmarks for offline reinforcement learning","venue":null,"work_id":"d52d67ce-0ea9-4784-855d-370b2debcbb5","year":2020},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.537449Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:ecb09e202299fcaebdb2962dbf1c026393e4e5ec7c51cde42f17b6db7e43f838","observation_id":"4cd6322f-a9eb-4c85-a768-cce60f7cbd23","resolution":{"observed_at":"2026-08-15T19:14:54.243871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T19:14:54.227977Z","title":"Dynamic network surgery for efficient dnns","venue":null,"work_id":"854299f6-9dbc-4513-a7c0-8111afbd608a","year":2016},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.541121Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:3a281207a5316f9d3dc9511932b60067dff9204073fa4247511976cbf92b867c","observation_id":"50b3793d-02f2-4258-9eb7-0d5b84f7edc9","resolution":{"observed_at":"2026-08-15T19:14:54.232233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02626","last_updated":"2015-10-30T23:29:27Z","snapshot_observed_at":"2026-08-15T13:34:24.234242Z","submitted_at":"2015-06-08T19:28:43Z","title":"Learning both Weights and Connections for Efficient Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.02626","snapshot_observed_at":"2026-08-15T19:14:53.548488Z","title":"Learning both weights and connections for efficient neural networks","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.548488Z"},"links":{"cited_paper":"/paper/1506.02626","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:a9ea571caadc6c2e6a407ac6bd7b09710f38a79a24e62d734810c825ffe7acfb","observation_id":"878a074b-597f-489b-82ac-03779d72846a","resolution":{"observed_at":"2026-08-15T19:14:53.548488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.10573","last_updated":"2023-05-19T18:31:04Z","snapshot_observed_at":"2026-08-14T17:40:51.391072Z","submitted_at":"2023-04-20T18:04:09Z","title":"IDQL: Implicit Q-Learning as an Actor-Critic Method with Diffusion Policies","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.10573","snapshot_observed_at":"2026-08-15T19:14:53.552162Z","title":"Idql: Implicit q-learning as an actor-critic method with diffusion policies","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.552162Z"},"links":{"cited_paper":"/paper/2304.10573","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:9dfd0ce05d94c9750abf1f6e80aba51fce468e860560217ca5846fcf49d7134e","observation_id":"bdbe81d1-4a55-4a3a-b891-aa66697166e2","resolution":{"observed_at":"2026-08-15T19:14:53.552162Z","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-15T19:14:53.588781Z","title":"Optimal brain surgeon and general network pruning","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.588781Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:bf6f8467ed8d42e1a92c1244754828d92049a993da88ab497c84214c231f5c2b","observation_id":"0d5203f7-8377-4a2d-b647-9b834a997853","resolution":{"observed_at":"2026-08-15T19:14:53.588781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.06169","last_updated":"2021-10-12T17:05:05Z","snapshot_observed_at":"2026-08-13T07:57:56.087944Z","submitted_at":"2021-10-12T17:05:05Z","title":"Offline Reinforcement Learning with Implicit Q-Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.06169","snapshot_observed_at":"2026-08-15T19:14:53.630411Z","title":"Offline reinforcement learning with implicit q-learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.630411Z"},"links":{"cited_paper":"/paper/2110.06169","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:6bf3a36d814fb9ca1f4212385bec6af22797327f2242223eec1128c0ef99c5ef","observation_id":"e1ec8000-e731-41b0-892b-5cf97542e29e","resolution":{"observed_at":"2026-08-15T19:14:53.630411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.08050","last_updated":"2021-03-14T22:11:40Z","snapshot_observed_at":"2026-08-16T18:38:59.490164Z","submitted_at":"2021-03-14T22:11:40Z","title":"Offline Reinforcement Learning with Fisher Divergence Critic Regularization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.08050","snapshot_observed_at":"2026-08-15T19:14:53.659424Z","title":"Offline reinforcement learning with fisher divergence critic regularization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.659424Z"},"links":{"cited_paper":"/paper/2103.08050","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:128db0eee0e58163065b3fa2c444abc9488953926af8e349b72bb490851f8c12","observation_id":"1aebafff-3a64-41ba-9d29-5cad3c69b9af","resolution":{"observed_at":"2026-08-15T19:14:53.659424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04779","last_updated":"2020-08-19T17:07:05Z","snapshot_observed_at":"2026-08-17T05:44:04.325551Z","submitted_at":"2020-06-08T17:53:42Z","title":"Conservative Q-Learning for Offline Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04779","snapshot_observed_at":"2026-08-15T19:14:53.664845Z","title":"Conservative q-learning for offline reinforcement learning","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.664845Z"},"links":{"cited_paper":"/paper/2006.04779","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:71297bfc53032d694578db7ff6644dae5802cc0d67040f23c5bcac03fa1b08e4","observation_id":"b4e61181-2ad9-4014-b57b-99db56279697","resolution":{"observed_at":"2026-08-15T19:14:53.664845Z","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-15T19:14:54.208153Z","title":"A workflow for offline model-free robotic reinforcement learning, 2021","venue":null,"work_id":"e2165ca1-2db3-492d-9549-55d04139dfd1","year":2021},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.668731Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:a59ca4f31732c8247b6263ab8e70138e6dd68526b519b3c73f2cabb06d1bfab3","observation_id":"c7a05432-910b-4827-bead-40d4861f44cf","resolution":{"observed_at":"2026-08-15T19:14:54.212242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.11861","last_updated":"2022-02-19T01:12:25Z","snapshot_observed_at":"2026-08-16T17:25:23.037869Z","submitted_at":"2022-01-27T23:59:56Z","title":"The Challenges of Exploration for Offline Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.11861","snapshot_observed_at":"2026-08-15T19:14:53.673901Z","title":"The challenges of exploration for offline reinforcement learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.673901Z"},"links":{"cited_paper":"/paper/2201.11861","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:fb659a2de07fab0970cef27129b4eedf3ffe48d36c3d88cd6b9ba79e4ff41683","observation_id":"8a03cccb-ef8c-4ab1-b27c-4eed5d63a55d","resolution":{"observed_at":"2026-08-15T19:14:53.673901Z","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-15T19:14:53.678134Z","title":"Optimal brain damage","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.678134Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:4efa1483a404f3caca03cfe7f5ee3eca9f1ed59bd34c9cd3cfe4cf96f07ac64d","observation_id":"4b2b76eb-e0b9-4624-a077-77a90a1fc342","resolution":{"observed_at":"2026-08-15T19:14:53.678134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.02340","last_updated":"2019-02-23T07:45:29Z","snapshot_observed_at":"2026-08-16T06:51:50.505762Z","submitted_at":"2018-10-04T17:39:58Z","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.02340","snapshot_observed_at":"2026-08-15T19:14:53.681938Z","title":"Snip: Single-shot network pruning based on connection sensitivity","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.681938Z"},"links":{"cited_paper":"/paper/1810.02340","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:8f51ed635ab2233de94b350fae8e09950157932e5517187de50dc6e03d75450b","observation_id":"761b8950-be4d-41d8-b0b1-0d8d4df2ac21","resolution":{"observed_at":"2026-08-15T19:14:53.681938Z","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-15T19:14:54.188559Z","title":"Sparse convolutional neural networks","venue":null,"work_id":"d45958a0-7b9f-431e-9677-a6aecfddd397","year":2015},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.686668Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:0acff3d282fb559c36f3df081e1434f6901954ca91ed5783b0360f464d7c108c","observation_id":"bf21d511-fc0b-4275-9e99-aa8bd8a913cb","resolution":{"observed_at":"2026-08-15T19:14:54.192482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-14T20:13:52.872565Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-15T19:14:53.694765Z","title":"Decoupled weight decay regularization, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.694765Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:2b123ac4b12adca1f7c157e99aa6b0e153d3a547969a44474dc78d8c17d21015","observation_id":"67bf4065-1d10-456b-8d6d-57e33682c379","resolution":{"observed_at":"2026-08-15T19:14:53.694765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.05957","last_updated":"2018-02-16T14:41:39Z","snapshot_observed_at":"2026-08-15T15:47:46.409113Z","submitted_at":"2018-02-16T14:41:39Z","title":"Spectral Normalization for Generative Adversarial Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.05957","snapshot_observed_at":"2026-08-15T19:14:53.699517Z","title":"Spectral normalization for generative adversarial networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.699517Z"},"links":{"cited_paper":"/paper/1802.05957","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:477103c332252ddd193d07a34ef98e666bce74f92aa86a337a96c728bf353c8b","observation_id":"c7fb748e-66f9-4fbc-b6a4-36f8f2288ffd","resolution":{"observed_at":"2026-08-15T19:14:53.699517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.06440","last_updated":"2017-06-08T19:53:26Z","snapshot_observed_at":"2026-08-14T21:29:36.502364Z","submitted_at":"2016-11-19T22:48:30Z","title":"Pruning Convolutional Neural Networks for Resource Efficient Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.06440","snapshot_observed_at":"2026-08-15T19:14:53.703572Z","title":"Pruning convolutional neural networks for resource efficient transfer learning","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.703572Z"},"links":{"cited_paper":"/paper/1611.06440","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:8f4c6212f74afca5b391f1aa2b7028400318e11cae37ef037ac10cb989d1a2c2","observation_id":"e1432f42-5ee0-4458-a111-bb0e99755e5a","resolution":{"observed_at":"2026-08-15T19:14:53.703572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.09359","last_updated":"2021-04-24T22:39:30Z","snapshot_observed_at":"2026-08-15T03:52:49.245753Z","submitted_at":"2020-06-16T17:54:41Z","title":"AWAC: Accelerating Online Reinforcement Learning with Offline Datasets","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.09359","snapshot_observed_at":"2026-08-15T19:14:53.708158Z","title":"Accelerating online reinforcement learning with offline datasets","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.708158Z"},"links":{"cited_paper":"/paper/2006.09359","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:6f29db4964f8577c2fa1137c3713f815d873edd67f40cc3d6e007a6793d6455f","observation_id":"40c3eab6-153b-4bbf-aa26-1af20d185f1d","resolution":{"observed_at":"2026-08-15T19:14:53.708158Z","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-15T19:14:54.177491Z","title":"Potluru, and Sergey Plis","venue":null,"work_id":"19142078-a2a4-4166-9ef1-fd8bf06b924d","year":2022},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.712099Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:dc17f479d82f223bb4318feb533a99901c88d8acfd9ea5f846ee1bce9394c67f","observation_id":"28be11aa-92aa-4515-b763-77b18a0981af","resolution":{"observed_at":"2026-08-15T19:14:54.181136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T19:14:53.715595Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.715595Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:abb5496e38a8e346af41bd5978bd6915d6352bb2a8adc8f7aad7f02a1869cb2c","observation_id":"22d42bdb-266c-42f1-b095-d765fd9b1175","resolution":{"observed_at":"2026-08-15T19:14:53.715595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.04714","last_updated":"2022-07-12T14:34:31Z","snapshot_observed_at":"2026-08-16T17:43:11.514108Z","submitted_at":"2021-11-08T18:48:43Z","title":"A Dataset Perspective on Offline Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.04714","snapshot_observed_at":"2026-08-15T19:14:53.719151Z","title":"Understanding the effects of dataset characteristics on offline reinforcement learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.719151Z"},"links":{"cited_paper":"/paper/2111.04714","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:fa42a67aecb01af5b5b69b3545d5da50d386302259c8004d9ceded2c9989c5ca","observation_id":"39939b01-08b3-4dcd-bf27-9ceb5b242e1a","resolution":{"observed_at":"2026-08-15T19:14:53.719151Z","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-15T19:14:53.723185Z","title":"A dataset perspective on offline reinforcement learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.723185Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:ae0ecd437b5ca9dbdaef16b28b2a37cbb09fa6400f68165ba37c511324a182d1","observation_id":"968edf3c-15d1-4d05-98aa-556bdd97bae0","resolution":{"observed_at":"2026-08-15T19:14:53.723185Z","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-15T19:14:53.726373Z","title":"Dropout: A simple way to prevent neural networks from overfitting","venue":null,"work_id":null,"year":1929},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.726373Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:fe14ed6816081f353eb653542b6ccd010dbc75eacf9b25dca624c953be2a7395","observation_id":"def2a9d6-3691-4e4f-8d7b-0bb365675ffc","resolution":{"observed_at":"2026-08-15T19:14:53.726373Z","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-15T19:14:54.144453Z","title":"Rlx2: Training a sparse deep reinforcement learning model from scratch, 2023","venue":null,"work_id":"19a57651-8282-4419-a760-205ba7ade420","year":2023},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.729908Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:79fdf03c5e72370ce0e1926e0e5b534778efed32ec59d168278cd4c80f73049f","observation_id":"3b17875b-3a2f-4ff4-ba83-9f626bb428d6","resolution":{"observed_at":"2026-08-15T19:14:54.148581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05467","last_updated":"2020-11-19T03:54:34Z","snapshot_observed_at":"2026-08-10T06:22:32.913383Z","submitted_at":"2020-06-09T19:21:57Z","title":"Pruning neural networks without any data by iteratively conserving synaptic flow","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.05467","snapshot_observed_at":"2026-08-15T19:14:53.734141Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.734141Z"},"links":{"cited_paper":"/paper/2006.05467","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:8d3bdac3ad203ef6b0b0e0fd9e61a923c8d0a8c305eedf9bd125423b3ea36dfe","observation_id":"e736b3ed-6d3e-4718-914c-36b994c3c68c","resolution":{"observed_at":"2026-08-15T19:14:53.734141Z","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-15T19:14:54.132423Z","title":"CORL : Research-oriented deep offline reinforcement learning library","venue":null,"work_id":"a3a47531-fb2a-41ca-97e2-0878ed9569ef","year":2022},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.738197Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:f55ece8deb92d6c3a7f08f361f59abeceea1ef2ade60ac99b39e8e47a4b6f31c","observation_id":"1e81d0cf-ac33-47ae-8a23-29778501a503","resolution":{"observed_at":"2026-08-15T19:14:54.136563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T19:14:54.118433Z","title":"Implicit q-learning (iql) in pytorch","venue":null,"work_id":"4f56a48c-5601-45b9-9fbc-e4b0dec99dd3","year":2021},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.741573Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:f112095e808913092b6b1bf606d27ad5e9a5d7f04e6b65850196f00f5435a343","observation_id":"0e8f5fed-201c-4aec-81c5-f600f005459f","resolution":{"observed_at":"2026-08-15T19:14:54.123440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T19:14:54.105706Z","title":"Regression shrinkage and selection via the lasso","venue":null,"work_id":"08f2d55e-90b5-419a-96c5-61b6f1c8fabf","year":1996},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.744630Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:ebdca53de533adc59cfb8e7ca6e62c15d0b2b3777d242537bee783b8771fbd8f","observation_id":"d5084db8-5251-4af8-bb58-43857beb8e02","resolution":{"observed_at":"2026-08-15T19:14:54.109640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T19:14:53.747883Z","title":"Mujoco: A physics engine for model-based control","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.747883Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:39376a33c8c23c26850498483e7894deb901f7d2ae977b44b56a2dae03469e54","observation_id":"d355ef5c-edc5-4c78-94e4-667fc0550126","resolution":{"observed_at":"2026-08-15T19:14:53.747883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.07376","last_updated":"2020-08-07T00:02:33Z","snapshot_observed_at":"2026-08-10T04:53:00.900945Z","submitted_at":"2020-02-18T05:14:47Z","title":"Picking Winning Tickets Before Training by Preserving Gradient Flow","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.07376","snapshot_observed_at":"2026-08-15T19:14:53.750998Z","title":"Picking winning tickets before training by preserving gradient flow","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.750998Z"},"links":{"cited_paper":"/paper/2002.07376","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:a3e7f28b60d735cda59300e1b704ad47269fa270feaf4e1fa780a3c045f1bdd3","observation_id":"eabc2e1c-10ff-4028-8101-87f37864c167","resolution":{"observed_at":"2026-08-15T19:14:53.750998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.11361","last_updated":"2019-11-26T06:11:34Z","snapshot_observed_at":"2026-08-12T13:17:36.653110Z","submitted_at":"2019-11-26T06:11:34Z","title":"Behavior Regularized Offline Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.11361","snapshot_observed_at":"2026-08-15T19:14:53.754965Z","title":"Behavior regularized offline reinforcement learning","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.754965Z"},"links":{"cited_paper":"/paper/1911.11361","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:f3f8f14c4267635a8ee81cd1a1320224ba58db13e1fd7dd1d4753c36132f60b1","observation_id":"dc1fa7b1-d1da-43d7-8967-363960376339","resolution":{"observed_at":"2026-08-15T19:14:53.754965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.09979","last_updated":"2020-01-19T18:04:11Z","snapshot_observed_at":"2026-08-18T10:25:27.158095Z","submitted_at":"2019-08-27T01:34:25Z","title":"DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measures","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.09979","snapshot_observed_at":"2026-08-15T19:14:53.759102Z","title":"Deephoyer: Learning sparser neural network with differentiable scale-invariant sparsity measures","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.759102Z"},"links":{"cited_paper":"/paper/1908.09979","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:988a98131a19c49bb3d3856bf083f696d07338881bae53c3761864c1ac52a402","observation_id":"b79f683b-ca43-4db2-98d2-31bc3cd6321c","resolution":{"observed_at":"2026-08-15T19:14:53.759102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.13425","last_updated":"2022-04-05T19:24:13Z","snapshot_observed_at":"2026-08-18T17:00:30.806909Z","submitted_at":"2022-01-31T18:39:27Z","title":"Don't Change the Algorithm, Change the Data: Exploratory Data for Offline Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.13425","snapshot_observed_at":"2026-08-15T19:14:53.763346Z","title":"Don't change the algorithm, change the data: Exploratory data for offline reinforcement learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.763346Z"},"links":{"cited_paper":"/paper/2201.13425","citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:1a2a72e64fe605d24018844d56c610128aa429da35137ad5eb8fabfe0790aff8","observation_id":"94ddf7a1-bbf8-4fb2-960a-68613ee03066","resolution":{"observed_at":"2026-08-15T19:14:53.763346Z","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-15T19:14:53.767889Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T19:14:53.767889Z"},"links":{"citing_paper":"/paper/2506.17155"},"observation_digest":"sha256:7121cb148f5306c00bd1569ec9f1eb73bdc026d2706770a04f8aee8ffc93f429","observation_id":"6cf42e74-0c9d-49b1-8dbb-53c647755ab1","resolution":{"observed_at":"2026-08-15T19:14:53.767889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.17155","last_updated":"2025-06-26T21:55:13Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T17:00:41.421344Z","submitted_at":"2025-06-20T16:57:59Z","title":"Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":1,"verified_fuzzy":14},"total_outbound_references":50},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2506.17155."}