{"as_of":"2026-08-10T05:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:808dcb00f49db9988e4c58a24afd7f9d73b265db5b12b90e3c3b404c4d7df931","coverage":[{"denominator":102,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:46:01.597095Z","state":"measured"},{"denominator":101,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":101,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T21:49:36.142405Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T21:55:06.025305Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"cited_work":{"arxiv_id":"2506.21037","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.21037","snapshot_observed_at":"2026-06-30T21:55:06.025305Z","title":"Rl-selector: Reinforcement learning- guided data selection via redundancy assessment.arXiv preprint arXiv:2506.21037, 2025","venue":null,"work_id":"3490135b-8e22-4fab-8118-b0c0aced3d07","year":2025},"citing_paper":{"arxiv_id":"2605.14773","last_updated":"2026-05-14T12:37:11Z","snapshot_observed_at":"2026-08-02T17:17:14.233601Z","submitted_at":"2026-05-14T12:37:11Z","title":"Beyond What to Select: A Plug-and-play Oscillatory Data-Volume Scheduling for Efficient Model Training","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-30T21:49:36.142405Z"},"links":{"cited_paper":"/paper/2506.21037","citing_paper":"/paper/2605.14773"},"observation_digest":"sha256:6845832b542dfdeee02f33c7677b0ced0a0f9ae5e4c9e285f3615e7e842f5264","observation_id":"d8882972-97bc-48d5-b134-5b60ee2487d8","resolution":{"observed_at":"2026-06-30T21:55:06.027305Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.21037/citation-record","integrity":"/paper/2506.21037/integrity","json":"/paper/2506.21037/citation-record.json","paper":"/paper/2506.21037"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:45:58.695170Z","title":"A definition of continual reinforcement learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:58.695170Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:68362c4a3ab69672b81637ae43bf9f8e74718c707be668be0b6d2b628cf369c5","observation_id":"1d7f785c-3759-4d31-9acb-40d2261fd07e","resolution":{"observed_at":"2026-08-06T22:45:58.695170Z","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-06T22:45:58.773341Z","title":"Vlmo: Unified vision-language pre-training with mixture-of-modality-experts.Advances in Neural Information Processing Systems, 35:32897–32912, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:58.773341Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:d4dffdf8db5b38b51c5416893220022c9df48f2a757da25b8610cce42fefc480","observation_id":"e62a545e-a05b-474f-abeb-f58b2af84fe5","resolution":{"observed_at":"2026-08-06T22:45:58.773341Z","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-06T22:45:58.839715Z","title":"Scail: Classifier weights scaling for class incremental learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:58.839715Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:6c5c86b1ba35ada5a62d8ac3eecf02c3e44e2d4887db8974436bab54d5397f22","observation_id":"8f3835e0-a19c-4583-9c56-0fde56e19bb6","resolution":{"observed_at":"2026-08-06T22:45:58.839715Z","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-06T22:45:58.956136Z","title":"Efros, and Jun-Yan Zhu","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:58.956136Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:1b114d62b51681af7fcd431facc16396efcada27bcecdbc8044734bb80bfec7f","observation_id":"114eceea-9476-4d1e-8873-8b936982a064","resolution":{"observed_at":"2026-08-06T22:45:58.956136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.15130","last_updated":"2022-05-30T14:22:10Z","snapshot_observed_at":"2026-08-08T13:50:10.571064Z","submitted_at":"2022-05-30T14:22:10Z","title":"Why Adversarial Training of ReLU Networks Is Difficult?","version":1},"cited_work":{"arxiv_id":"2205.15130","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.15130","snapshot_observed_at":"2026-08-06T22:46:02.020845Z","title":"Why Adversarial Training of ReLU Networks Is Difficult?","venue":"cs.LG","work_id":"230d7fe7-461e-4488-b7ee-9fa35c3db01a","year":2022},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.058129Z"},"links":{"cited_paper":"/paper/2205.15130","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:3440157188688be85222cae08c11dae62a48fa5cb1347195269d65167d2a5df5","observation_id":"90b051d2-5db7-4ce2-ad59-50c25e11a50d","resolution":{"observed_at":"2026-08-06T22:46:02.026551Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:45:59.131960Z","title":"Palm: Scaling language modeling with pathways.Journal of Machine Learning Research, 24(240): 1–113, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.131960Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:db2ec9fd0ae69942ce0a9762cc33a4b57380afefc1763713ff981a1fe65481e6","observation_id":"1b6e7aa6-8f9d-48d4-84f4-53f2a5712c5d","resolution":{"observed_at":"2026-08-06T22:45:59.131960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.08819","last_updated":"2017-08-23T16:06:20Z","snapshot_observed_at":"2026-07-06T05:52:59.445968Z","submitted_at":"2017-07-27T11:22:22Z","title":"A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.08819","snapshot_observed_at":"2026-08-06T22:45:59.199233Z","title":"A downsampled variant of imagenet as an alternative to the ci- far datasets.arXiv preprint arXiv:1707.08819, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.199233Z"},"links":{"cited_paper":"/paper/1707.08819","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:619e4bb637d78fcf02eb4e11645cdc6206ede21523f58560b34d46e21f3f7cbe","observation_id":"c16b6d6a-24b8-4074-a4b7-d24cb1a8142b","resolution":{"observed_at":"2026-08-06T22:45:59.199233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.11829","last_updated":"2020-10-27T00:52:20Z","snapshot_observed_at":"2026-07-06T08:03:24.054624Z","submitted_at":"2019-06-26T23:01:47Z","title":"Selection via Proxy: Efficient Data Selection for Deep Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.11829","snapshot_observed_at":"2026-08-06T22:45:59.295226Z","title":"Selection via proxy: Efficient data se- lection for deep learning.arXiv preprint arXiv:1906.11829, 2019","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.295226Z"},"links":{"cited_paper":"/paper/1906.11829","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:2638d39b34172dd65c62bec3366be831519cdb100aa6fd7229b4e69181dd18a1","observation_id":"7acb0be7-da63-486d-9df8-03f2225a2a93","resolution":{"observed_at":"2026-08-06T22:45:59.295226Z","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-06T22:45:59.396068Z","title":"Imagenet: A large-scale hierarchical image database","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.396068Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:8e518eeacf49877e13ce03fc49556e98f487d9bb2b580c5f8fc53a9e57c96800","observation_id":"77277328-072e-4d85-8301-8a28d71ada6e","resolution":{"observed_at":"2026-08-06T22:45:59.396068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.11929","last_updated":"2021-06-03T13:08:56Z","snapshot_observed_at":"2026-08-10T01:12:16.468283Z","submitted_at":"2020-10-22T17:55:59Z","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.11929","snapshot_observed_at":"2026-08-06T22:45:59.460608Z","title":"An image is worth 16x16 words: Trans- formers for image recognition at scale.arXiv preprint arXiv:2010.11929, 2020","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.460608Z"},"links":{"cited_paper":"/paper/2010.11929","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:330d9d5c1e1e526a9759f43fdd2c7b03679622cddff8b9035c83608a94d207aa","observation_id":"3bb93ac9-ea71-44f5-9840-7ad191d934e6","resolution":{"observed_at":"2026-08-06T22:45:59.460608Z","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-06T22:45:59.527468Z","title":"Minimizing the accumulated trajectory error to improve dataset distillation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.527468Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:a32793ecf8e7d19051be5f7152f5f85d88fd1247dcdea2e1f0365273bf35abe1","observation_id":"883bdea7-2bd4-4b5b-989e-fd12c7deea70","resolution":{"observed_at":"2026-08-06T22:45:59.527468Z","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-06T22:45:59.655061Z","title":null,"venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.655061Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:3f2131ab1670da8cb4f8238c0c40132d6d065f196a6de6edc1a416078fbe101d","observation_id":"12d2248a-8e0e-4b4b-97ed-57223adb4dec","resolution":{"observed_at":"2026-08-06T22:45:59.655061Z","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-06T22:45:59.740396Z","title":"What neural networks memorize and why: Discovering the long tail via influence estimation.Advances in Neural Information Processing Sys- tems, 33:2881–2891, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.740396Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:29fda4933f1e2fc8098bd3a132f56f46621eb716f98eff668e8521e56e7e4c1a","observation_id":"b7cfd9ae-34e6-4311-a17c-3eebeec68da6","resolution":{"observed_at":"2026-08-06T22:45:59.740396Z","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-06T22:45:59.746503Z","title":"Vissl.https://github.com/ facebookresearch/vissl, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.746503Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:4c611a65193b0ed6e6eca036c40889a2d2cda8635dc959300350d91c2bf18565","observation_id":"56121782-6d0f-4254-904f-7700165bce50","resolution":{"observed_at":"2026-08-06T22:45:59.746503Z","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-06T22:45:59.751065Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.751065Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:33d8e27a158199fdb440996a725ee7363cdff5044f6e7f63450f6ed28a20e709","observation_id":"d2e8c262-3471-4414-90ce-af529dbf756e","resolution":{"observed_at":"2026-08-06T22:45:59.751065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-06T22:45:59.755997Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning.arXiv preprint arXiv:2501.12948, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.755997Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:7ee21e46eaa4aaa57329e77c08c72b2d16efd3595bb8c630c7083dcc6364ee52","observation_id":"ab997ffa-0eb5-44f5-8504-5987b6ae4c61","resolution":{"observed_at":"2026-08-06T22:45:59.755997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05773","last_updated":"2024-03-18T11:44:06Z","snapshot_observed_at":"2026-07-06T16:29:51.896529Z","submitted_at":"2023-10-09T14:57:41Z","title":"Towards Lossless Dataset Distillation via Difficulty-Aligned Trajectory Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05773","snapshot_observed_at":"2026-08-06T22:45:59.760610Z","title":"Towards lossless dataset distillation via difficulty-aligned trajectory matching.arXiv preprint arXiv:2310.05773, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.760610Z"},"links":{"cited_paper":"/paper/2310.05773","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:b9371742318732305278152f6201569778ada8149f4837b2a65ff9a6a0bfded5","observation_id":"00da97ca-072f-481d-b10d-e8126f70e8a9","resolution":{"observed_at":"2026-08-06T22:45:59.760610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.02095","last_updated":"2023-03-10T08:04:01Z","snapshot_observed_at":"2026-08-08T01:02:15.306943Z","submitted_at":"2023-03-03T17:24:39Z","title":"Data-Efficient Training of CNNs and Transformers with Coresets: A Stability Perspective","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.02095","snapshot_observed_at":"2026-08-06T22:45:59.766132Z","title":"Data-efficient training of cnns and trans- formers with coresets: A stability perspective.arXiv preprint arXiv:2303.02095, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.766132Z"},"links":{"cited_paper":"/paper/2303.02095","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:fa34c454f39811191cfc337de0cce39a763983721edb8aad8a60078355c805ea","observation_id":"4372fa9f-9b0d-4c6d-985d-017095c6ea10","resolution":{"observed_at":"2026-08-06T22:45:59.766132Z","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-06T22:45:59.771311Z","title":"Deep residual learning for image recognition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.771311Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:85013fc9e47c6bb6fb987370126fc486a31a64cbe68ef787d7e5f4cbcc66aa30","observation_id":"a45dd16b-0dc1-4593-865c-b16441b02e4d","resolution":{"observed_at":"2026-08-06T22:45:59.771311Z","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-06T22:45:59.776399Z","title":"You only con- dense once: Two rules for pruning condensed datasets.Ad- vances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.776399Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:9e07450426eb074b76f608285232beb179914b8df66b54045865c2c58c459e98","observation_id":"75cee0b3-fa59-464e-8f69-0a3096d7eaea","resolution":{"observed_at":"2026-08-06T22:45:59.776399Z","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-06T22:45:59.782395Z","title":"The many faces of robust- ness: A critical analysis of out-of-distribution generalization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.782395Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:eb038cd3358cfeb87fb1ab6c4cf0c5b56aadf015b016f1646181cbd2c03abacd","observation_id":"758c6cb0-e95e-49a0-a04c-9a384d419269","resolution":{"observed_at":"2026-08-06T22:45:59.782395Z","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-06T22:45:59.787459Z","title":"Natural adversarial examples","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.787459Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:d297c15c81327d1694285ce12f2ff93fbdc58c7fbd48316e1ffc6c2e5c2668e6","observation_id":"cb460f3d-3f95-4274-98d1-1d4762850458","resolution":{"observed_at":"2026-08-06T22:45:59.787459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04872","last_updated":"2024-06-07T12:12:20Z","snapshot_observed_at":"2026-08-09T05:17:05.901094Z","submitted_at":"2024-06-07T12:12:20Z","title":"Diversified Batch Selection for Training Acceleration","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04872","snapshot_observed_at":"2026-08-06T22:45:59.792729Z","title":"Diversified batch selection for training acceleration.arXiv preprint arXiv:2406.04872, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.792729Z"},"links":{"cited_paper":"/paper/2406.04872","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:e3a84c52a4d81e4332e75333dda70b54ab85411603b3d0b828a3a54ff78852de","observation_id":"5aaafcea-702e-4245-b2cd-9d085bb8b35b","resolution":{"observed_at":"2026-08-06T22:45:59.792729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14810","last_updated":"2025-08-08T13:29:20Z","snapshot_observed_at":"2026-08-07T22:19:57.315486Z","submitted_at":"2025-04-21T02:25:03Z","title":"DONOD: Efficient and Generalizable Instruction Fine-Tuning for LLMs via Model-Intrinsic Dataset Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14810","snapshot_observed_at":"2026-08-06T22:45:59.798387Z","title":"Donod: Robust and generalizable instruction fine-tuning for llms via model-intrinsic dataset pruning.arXiv preprint arXiv:2504.14810, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.798387Z"},"links":{"cited_paper":"/paper/2504.14810","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:db80d8e0c1cda602252ebacbcabceda2ce3f5bc5a42cdad2b26c08b514688092","observation_id":"f74a5973-2481-495c-b184-2d85b3b3ed80","resolution":{"observed_at":"2026-08-06T22:45:59.798387Z","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-06T22:45:59.803738Z","title":"Densely connected convolutional net- works","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.803738Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:1c07283f162d220f74a2350f44f513aedba32d683de194f27e6e661bcef3165b","observation_id":"657989d9-7467-4baa-bead-07fc94138d60","resolution":{"observed_at":"2026-08-06T22:45:59.803738Z","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-06T22:45:59.808165Z","title":"Polynomial bounds for vc dimension of sigmoidal and general pfaffian neural networks.Journal of Computer and System Sciences, 54(1): 169–176, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.808165Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:5e6e6ca7a134e85e1b3be5c62e704a3244219d393602c12f188719dc89c06176","observation_id":"24a607f5-fe57-4462-9564-e4e4108a5ebc","resolution":{"observed_at":"2026-08-06T22:45:59.808165Z","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-06T22:45:59.813109Z","title":"Grad-match: Gradient matching based data subset selection for efficient deep model training","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.813109Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:291ab4e3b8df7b707e1e0282a6e780a48233c1be9cfbc1a7cfb78a11ff0eba48","observation_id":"cfe58b0c-0de6-4e3c-8baa-85619fe30366","resolution":{"observed_at":"2026-08-06T22:45:59.813109Z","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-06T22:45:59.817457Z","title":"Glister: Generalization based data subset selection for efficient and robust learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.817457Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:d851f386f514db14e106e6edcd23d2b1686a1907ba7ddfdeb9b8984462d31366","observation_id":"55fe10fc-24c7-4bbd-a354-f63464ff0eb1","resolution":{"observed_at":"2026-08-06T22:45:59.817457Z","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-06T22:45:59.822283Z","title":"Segment any- thing","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.822283Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:b4a3d040699ea04b527d66fba6631ac887973bec8294acf20cec4d17c1223238","observation_id":"debf466d-7a7b-45be-a151-a4831a08a84b","resolution":{"observed_at":"2026-08-06T22:45:59.822283Z","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-06T22:45:59.827100Z","title":"Understanding black-box predictions via influence functions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.827100Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:380f6bd8f260a60d35f03836026c9426b0f33f0ec5bb1076de40996303974e5a","observation_id":"6361aad5-7521-40bc-aba3-94f496a32bac","resolution":{"observed_at":"2026-08-06T22:45:59.827100Z","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-06T22:45:59.833065Z","title":"Understanding black-box predictions via influence functions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.833065Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:8889e4d4e6bfe28c776abecadc55283c6f0d4de39cdeb6bd09cc73f5bb18cc8f","observation_id":"027efbde-5693-4bbe-8cef-66addf2be9d3","resolution":{"observed_at":"2026-08-06T22:45:59.833065Z","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-06T22:46:02.838901Z","title":"Prism: A unified framework of parameterized submodular information measures for tar- geted data subset selection and summarization","venue":null,"work_id":"43785d33-a876-4785-8673-c9f040a28388","year":2022},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.838020Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:a8d229bb0f9dbf589ce1143210c2f8082a43bd6f5a0920d17dad787e2a09c9d8","observation_id":"04d206c7-02d7-4434-b7db-55eb0da0d109","resolution":{"observed_at":"2026-08-06T22:46:02.844368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:45:59.842722Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.842722Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:2158821a9add6be7785c4acc3db8a3a10fd13bc24b11308f17244f9fffc11982","observation_id":"3f08a32b-6ecc-445f-8cfb-597745813083","resolution":{"observed_at":"2026-08-06T22:45:59.842722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.04716","last_updated":"2021-12-09T06:01:01Z","snapshot_observed_at":"2026-08-06T22:36:35.996391Z","submitted_at":"2021-12-09T06:01:01Z","title":"DR3: Value-Based Deep Reinforcement Learning Requires Explicit Regularization","version":1},"cited_work":{"arxiv_id":"2112.04716","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.04716","snapshot_observed_at":"2026-08-06T22:46:01.879303Z","title":"DR3: Value-Based Deep Reinforcement Learning Requires Explicit Regularization","venue":"cs.LG","work_id":"5b994b10-8faf-49df-b0a3-e09956c8b0c9","year":2021},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.847173Z"},"links":{"cited_paper":"/paper/2112.04716","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:5bc7ce2d46cf6f4bc68a3a215a63865cd04883b0c3510043db97b9d7177cd259","observation_id":"62363d1a-289b-4754-a013-b2246dc74fca","resolution":{"observed_at":"2026-08-06T22:46:01.886092Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.812026Z","title":"Super- vised pretraining can learn in-context reinforcement learn- ing.Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":"c6164040-e6d2-4da4-a2cf-7ebd1d6da633","year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.853033Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:123d96244241deb9eba4e78e98e50f8cd1e69e5b4295c35358dfc8082078cf0f","observation_id":"e95a7e29-9f31-4945-937b-a82bdbba3ad7","resolution":{"observed_at":"2026-08-06T22:46:02.817969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.05603","last_updated":"2023-12-24T14:45:22Z","snapshot_observed_at":"2026-07-06T14:41:06.148813Z","submitted_at":"2023-01-13T15:11:38Z","title":"A Comprehensive Survey of Dataset Distillation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.05603","snapshot_observed_at":"2026-08-06T22:45:59.858858Z","title":"A comprehensive survey to dataset distillation.arXiv preprint arXiv:2301.05603, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.858858Z"},"links":{"cited_paper":"/paper/2301.05603","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:b02676280d1d55aced3ffc7cb6fb2f40670bbe438cc9ca325d87bc4e99ddbc09","observation_id":"71d5c2c3-5c70-4f06-b344-e789934f35be","resolution":{"observed_at":"2026-08-06T22:45:59.858858Z","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-06T22:45:59.864334Z","title":"Align before fuse: Vision and language representation learn- ing with momentum distillation.Advances in neural infor- mation processing systems, 34:9694–9705, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.864334Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:49228894fa7b47d856cbf99aae847d9bc916108074d7a8087a0a0686cf271560","observation_id":"20339c3b-dbd2-4138-a9ec-f023d7c9bb02","resolution":{"observed_at":"2026-08-06T22:45:59.864334Z","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-06T22:46:02.787357Z","title":"Design from policies: Con- servative test-time adaptation for offline policy optimiza- tion.Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":"ceb51e61-baa5-413b-8a23-11c408e8ea54","year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.869742Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:abfee58a57d456fd4b2a6d87cce5e535f915f8aa4d7cdfdcbf492feed1a19fc9","observation_id":"7e9ef7bd-3a8b-400a-9627-5e6262ecb8c0","resolution":{"observed_at":"2026-08-06T22:46:02.792042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:45:59.874839Z","title":"Swin transformer: Hierarchical vision transformer using shifted windows","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.874839Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:63eb735e9a2da7305bb97dc515a102e8701f0b185236a471ca8c278df03598db","observation_id":"3d975c5f-eeed-406c-b786-e40d10cbe653","resolution":{"observed_at":"2026-08-06T22:45:59.874839Z","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-06T22:46:02.764170Z","title":"Struc- tured state space models for in-context reinforcement learn- ing.Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":"c33d588b-7956-42b6-b21f-01825f110d14","year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.879793Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:86cdda14cb4e68fac746c0ce32ee6acc65798b57d796f13d96dc249754d39f68","observation_id":"57516fe2-de92-4c88-988d-d808ca4bb5a5","resolution":{"observed_at":"2026-08-06T22:46:02.768712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07931","last_updated":"2023-10-11T23:01:29Z","snapshot_observed_at":"2026-07-06T16:31:33.607406Z","submitted_at":"2023-10-11T23:01:29Z","title":"D2 Pruning: Message Passing for Balancing Diversity and Difficulty in Data Pruning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07931","snapshot_observed_at":"2026-08-06T22:45:59.884362Z","title":"D2 pruning: Message passing for balancing diversity and dif- ficulty in data pruning.arXiv preprint arXiv:2310.07931, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.884362Z"},"links":{"cited_paper":"/paper/2310.07931","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:8ce3821b614f1bb1e103ab779740a054ffc7b60c00f5ff8349fbdc7e4dbed443","observation_id":"8942c9be-2da6-45e4-a55c-f84ed0cb586e","resolution":{"observed_at":"2026-08-06T22:45:59.884362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-06T22:45:59.888871Z","title":"Language models are few-shot learners.arXiv preprint arXiv:2005.14165, 2020","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.888871Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:9e9bc546b27525339562722d7067b6cbb46a24c6bf444c3cc467058943dff2f3","observation_id":"d52f0ced-fe67-41e6-893d-17b3333f64b7","resolution":{"observed_at":"2026-08-06T22:45:59.888871Z","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-06T22:46:02.749236Z","title":"Schulze Buschoff, Robert Geirhos, and Felix A","venue":null,"work_id":"b4fb8f05-c7aa-4406-bf1f-ce7a74f11a2d","year":2022},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.894740Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:cbcca79298d68f9067e8a23840d828392a367727560ca7eb73d52d88fc274a0c","observation_id":"4b39e7ce-b0a6-42e4-9ae4-4f05c65b6227","resolution":{"observed_at":"2026-08-06T22:46:02.754343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.734619Z","title":"Coresets for data-efficient training of machine learning mod- els","venue":null,"work_id":"9dc603d7-f7c6-471b-8c18-dc59488ae8cf","year":2020},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.898877Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:1dd68264a0fdcdd1ee66caca82d573712a04faf87b0c06413da58ea1349b94d1","observation_id":"b9bdb6ca-15f7-4e74-9892-5258f98e847a","resolution":{"observed_at":"2026-08-06T22:46:02.739571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.01783","last_updated":"2016-06-16T16:38:45Z","snapshot_observed_at":"2026-07-06T04:45:11.148515Z","submitted_at":"2016-02-04T18:38:41Z","title":"Asynchronous Methods for Deep Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.01783","snapshot_observed_at":"2026-08-06T22:45:59.903971Z","title":"Asynchronous methods for deep rein- forcement learning.arXiv preprint arXiv:1602.01783, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.903971Z"},"links":{"cited_paper":"/paper/1602.01783","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:77ce90dc79442fabcd5b26ea2d0a64550989cdd742f54fc0e8f87660c0a091f4","observation_id":"433b45d1-7f48-4c61-9f21-ec257892d076","resolution":{"observed_at":"2026-08-06T22:45:59.903971Z","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-06T22:46:02.719643Z","title":"Asynchronous methods for deep reinforcement learning","venue":null,"work_id":"43619b03-7333-4b86-97cd-f895b9d9f985","year":1928},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.909272Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:d9abfa47963c5ec4a669d949fc0a0b96938bec6cafe166d0e63e552de0d1002c","observation_id":"e76b24ba-4e88-42f5-bed9-47f283675808","resolution":{"observed_at":"2026-08-06T22:46:02.724621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.703795Z","title":"Performance bounds for policy-based average reward rein- forcement learning algorithms.Advances in Neural Infor- mation Processing Systems, 36:19386–19396, 2023","venue":null,"work_id":"22e2e20e-b04e-4c57-8bd4-e08024b81f17","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.914019Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:08c1c69f1d33693ddfc956f39ec515474ad47ade0b01c1d81f4b810abd72ef09","observation_id":"5db15f97-96d7-42bc-b595-154cb956d87d","resolution":{"observed_at":"2026-08-06T22:46:02.709239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.688604Z","title":"Bridging the gap between value and policy based reinforcement learning.Advances in neural informa- tion processing systems, 30, 2017","venue":null,"work_id":"4361d14d-3140-488c-87ab-57572755f4fd","year":2017},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.918265Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:6bf37286ee9650c65222a567533b6894e8c65d5790ee294c58549ca1e24463b6","observation_id":"53a30719-06d6-444b-b452-d3f4f845354e","resolution":{"observed_at":"2026-08-06T22:46:02.693490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.673328Z","title":"Data valu- ation without training of a model","venue":null,"work_id":"2238f016-62c7-4e60-b163-c0a36222565c","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.922663Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:8c08fd0ce04aba5c1ff4e05e760ec69b10275a972c67a38a0c6e272a58e5b86b","observation_id":"7332f4e7-e5a5-4371-950c-1cf62d23174a","resolution":{"observed_at":"2026-08-06T22:46:02.678328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.658071Z","title":"Deep learning on a data diet: Finding important ex- amples early in training.Advances in Neural Information Processing Systems, 34:20596–20607, 2021","venue":null,"work_id":"b50467d7-df63-4b4e-8603-cc57c976fda8","year":2021},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.928364Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:19a8b902fc8d74bfcb46fc2599200acc05fc306042aafa6fcc034f0480000fd6","observation_id":"de7d3119-ef20-4115-8fe5-e06648aa3555","resolution":{"observed_at":"2026-08-06T22:46:02.663324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.643011Z","title":"Adaptive second order coresets for data-efficient machine learning","venue":null,"work_id":"510676c8-bf04-4ecf-8bbd-e1fac600c91d","year":2022},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.934113Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:10e074ec9c77056b3fbd45215ef53de5b66918bff6117bdf4414771741d1c309","observation_id":"6b7999bb-6075-49b1-9489-0bf17619a88e","resolution":{"observed_at":"2026-08-06T22:46:02.648081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04947","last_updated":"2023-10-20T04:38:34Z","snapshot_observed_at":"2026-07-06T15:00:24.620138Z","submitted_at":"2023-03-08T23:40:47Z","title":"InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.04947","snapshot_observed_at":"2026-08-06T22:45:59.939052Z","title":"Infobatch: Lossless training speed up by unbiased dynamic data pruning.arXiv preprint arXiv:2303.04947, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.939052Z"},"links":{"cited_paper":"/paper/2303.04947","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:16ee7d338efe18326f8a0b688fd7f27c94e3aa7c6a169fd852a4896a08c938d1","observation_id":"c76ea08c-374c-4588-99e3-c699b1e0358b","resolution":{"observed_at":"2026-08-06T22:45:59.939052Z","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-06T22:45:59.944444Z","title":"Language models are unsu- pervised multitask learners.OpenAI blog, 1(8):9, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.944444Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:137e849f5db1aba394c6a33886a31aca35dbaf4d0d78e08448cb0a85d313ce7c","observation_id":"4799d44e-16e9-4864-adcc-e0d98b7009ab","resolution":{"observed_at":"2026-08-06T22:45:59.944444Z","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-06T22:45:59.950681Z","title":"Learning transferable visual models from natural language supervi- sion","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.950681Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:0c3fc9f4b7d03225f42752723da79077d4b47316999036bd442cd3d5b1ab33d0","observation_id":"36e64bc2-ccbb-4ebb-9565-dbaabd9708c3","resolution":{"observed_at":"2026-08-06T22:45:59.950681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.12621","last_updated":"2021-11-24T16:47:34Z","snapshot_observed_at":"2026-08-08T00:44:54.701952Z","submitted_at":"2021-11-24T16:47:34Z","title":"Accelerating Deep Learning with Dynamic Data Pruning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.12621","snapshot_observed_at":"2026-08-06T22:45:59.959130Z","title":"Accelerat- ing deep learning with dynamic data pruning.arXiv preprint arXiv:2111.12621, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.959130Z"},"links":{"cited_paper":"/paper/2111.12621","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:8ff63c774252f2c662470d82a55abc3d25d1abff0cc7d88b30fff6722bea5a78","observation_id":"8449f8d1-ff33-410a-acd7-1fb22db86278","resolution":{"observed_at":"2026-08-06T22:45:59.959130Z","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-06T22:46:02.609291Z","title":"Data-centric green artifi- cial intelligence: A survey.IEEE Transactions on Artificial Intelligence, 2023","venue":null,"work_id":"38c6b4c1-6d87-4280-8924-289b0290d5b6","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.963658Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:ad639a771ee72540b1ddaa1bcd9a46953a51c642357a56385034c6e88133c2e1","observation_id":"96691100-8007-47ae-8b62-b01251832e72","resolution":{"observed_at":"2026-08-06T22:46:02.614490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.593604Z","title":"Laion-5b: An open large-scale dataset for training next generation image-text models.Advances in Neural In- formation Processing Systems, 35:25278–25294, 2022","venue":null,"work_id":"62056585-ac80-4263-8537-05f4c057a7c3","year":2022},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.968439Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:42977e66de342a4e441788d2ed338dffe156a536f88f1cbd91f0fe7628bf44f7","observation_id":"1bbc9bc1-0050-4607-a756-861674ac5a4c","resolution":{"observed_at":"2026-08-06T22:46:02.599369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.579647Z","title":"Active learning for convolu- tional neural networks: A core-set approach","venue":null,"work_id":"f8558ae0-3569-4c1b-9716-f2724a6a97dd","year":2018},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.972657Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:6a834607797bed1dbfd052a7dfcccef7ecfa64d9ce4fabe5490a632b4b4486d2","observation_id":"ad0889fd-ee4b-4245-8c59-13991499750b","resolution":{"observed_at":"2026-08-06T22:46:02.584354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.566488Z","title":"Reinforcement learning algorithms: A brief survey.Expert Systems with Applications, page 120495, 2023","venue":null,"work_id":"dbc5c0ac-288f-470a-9afb-8b4c49c24021","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.977444Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:d1b363ffa98b54200e27041662ff6e8209b7bfdc8595a3f5180b32562ff4c386","observation_id":"8b8662fc-5539-4464-95fb-0b83368c6491","resolution":{"observed_at":"2026-08-06T22:46:02.570745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1409.1556","last_updated":"2015-04-10T16:25:04Z","snapshot_observed_at":"2026-07-06T03:53:32.549552Z","submitted_at":"2014-09-04T19:48:04Z","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.1556","snapshot_observed_at":"2026-08-06T22:45:59.982305Z","title":"Very deep convo- lutional networks for large-scale image recognition.arXiv preprint arXiv:1409.1556, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.982305Z"},"links":{"cited_paper":"/paper/1409.1556","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:e98073936d79f6135962b6a32e434ed2c8a6a22ef590b62d09d635e9b05e45ec","observation_id":"c7336274-2974-49be-9562-49f9f4d561c7","resolution":{"observed_at":"2026-08-06T22:45:59.982305Z","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-06T22:46:02.552366Z","title":null,"venue":null,"work_id":"23f2b805-337a-4dd7-a9eb-17910e68d741","year":2022},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.988538Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:532b30455bd4bbe622af6e9d3458582a07e58bb89dce4b4d375039a87d893d83","observation_id":"6f496b4d-f4ee-4d8c-ab72-f6c824317b1f","resolution":{"observed_at":"2026-08-06T22:46:02.556595Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.538399Z","title":"On the depth of deep neural networks: A the- oretical view","venue":null,"work_id":"b363e8fe-e141-4f22-9c8f-a28646a3fb44","year":2016},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.993271Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:14bfb602deaa7f5bacdbea7611428a51a5af775b46ec4a22d0526461c8464f1f","observation_id":"e3fd2e8a-14e9-42b2-b66b-da13d20d7415","resolution":{"observed_at":"2026-08-06T22:46:02.542933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.524098Z","title":null,"venue":null,"work_id":"f71e6f36-5c57-42ea-8d9c-02630db6889f","year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.997951Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:312729ece6627e3c76b559c92ee859a5318424bc62dfdeae15bb6247c3c7beff","observation_id":"1ff49d75-f427-41a4-af03-6a1ad8ec5c5b","resolution":{"observed_at":"2026-08-06T22:46:02.529153Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.509281Z","title":"Data pruning via moving-one- sample-out.Advances in Neural Information Processing Sys- tems, 36, 2024","venue":null,"work_id":"38fe39be-15da-4d49-ad02-17d9bd52bdff","year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.003807Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:2689c376b48f013ba8635610e7cc1a11da7f2dd06c0e8935d06cd700cef9364f","observation_id":"3a94ca87-b5cc-4c21-9da3-af85ad86911a","resolution":{"observed_at":"2026-08-06T22:46:02.514192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.494494Z","title":"D4: Improving llm pretraining via document de- duplication and diversification","venue":null,"work_id":"5c4e9907-56f4-4c04-be16-329f3dd643cd","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.007930Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:fe136ce2359f49576e64e8ffff3fb5bdba1aef8b62cd050ce162e538326c5649","observation_id":"59fd0781-47d3-47ed-9055-61bae4ab7299","resolution":{"observed_at":"2026-08-06T22:46:02.499133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.479953Z","title":"Policy-based reinforcement learning for generalisation in interactive text- based environments","venue":null,"work_id":"4ed96135-7477-48ad-8858-7ae79db61fef","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.012599Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:0984ee683e8862d8def33319f92e4854c1585c649272a7afaf201aacc83ab385","observation_id":"2049c0e2-7e19-4698-b443-a87f6c19fd46","resolution":{"observed_at":"2026-08-06T22:46:02.484792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.05159","last_updated":"2019-11-15T17:08:30Z","snapshot_observed_at":"2026-08-01T06:33:25.731787Z","submitted_at":"2018-12-12T21:24:15Z","title":"An Empirical Study of Example Forgetting during Deep Neural Network Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.05159","snapshot_observed_at":"2026-08-06T22:46:00.018900Z","title":"An empirical study of example forget- ting during deep neural network learning.arXiv preprint arXiv:1812.05159, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.018900Z"},"links":{"cited_paper":"/paper/1812.05159","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:6d2fcd3d12a4a4515828a2dc3c261bc9653ad1811853ce6b4add32c302d9bbd3","observation_id":"3c466a90-d7ec-4953-9755-3964be828308","resolution":{"observed_at":"2026-08-06T22:46:00.018900Z","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-06T22:46:02.464808Z","title":"Visualizing data using t-sne.J","venue":null,"work_id":"e3e95668-bc94-41f3-bcd3-7d6f4597ab61","year":2008},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.023688Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:2bd41e0903994c2a8dbebbb534b798fe3ce79445846f196afde83c40aff851a6","observation_id":"5443d804-1ce6-4aab-aa1a-db7ac94fa21a","resolution":{"observed_at":"2026-08-06T22:46:02.469928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.450061Z","title":"Submodularity in data subset selection and active learning","venue":null,"work_id":"04baa453-25d6-486b-a325-888be42b923b","year":1954},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.027702Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:87a07b5e6eefeb100ffb01151d0e3b3aa2d21d68c43127950fe214099c834510","observation_id":"4df00de2-d421-4c1d-9a53-b6797adfb7d9","resolution":{"observed_at":"2026-08-06T22:46:02.455132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.434205Z","title":"Herding dynamical weights to learn","venue":null,"work_id":"ef21dbae-8633-48f4-bd7e-d844d60f145f","year":2009},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.032166Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:4681d4bf07526ec1705090f328ed93abe76ad9ab846fbb00c47a68b6c451790c","observation_id":"ff3b0b43-e527-40a8-a322-cd3cdc381a0d","resolution":{"observed_at":"2026-08-06T22:46:02.439843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.419743Z","title":"Scalable trust-region method for deep re- inforcement learning using kronecker-factored approxima- tion.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":"0ba08e7f-fe25-4bff-bff8-0e03362acfc7","year":2017},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.037529Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:072be2dfbd95f5c321a2316da0279a7c097b41dd064a9e6ec54fe60e7de6b647","observation_id":"6c4e3a4a-3eb1-4758-bfb5-47a86b26cbe6","resolution":{"observed_at":"2026-08-06T22:46:02.424377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.405196Z","title":"Moderate coreset: A universal method of data selection for real-world data-efficient deep learning","venue":null,"work_id":"2f29b563-9d39-4c89-a3a5-0164c24e027b","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.078599Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:1b9d8f4501690928dc8c43a022554e270c44d94ab1079021e283f73329ece457","observation_id":"42a13abe-93a8-496e-9ad1-85868addd374","resolution":{"observed_at":"2026-08-06T22:46:02.410694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.390185Z","title":"Dataset pruning: Reducing training data by ex- amining generalization influence","venue":null,"work_id":"c1d03c18-91a4-4145-87d0-da3af31b64c8","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.139020Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:1a4fd043147bb3c2befc5aea36e381f331bb1d72e04b2742de5770f3f1c276e0","observation_id":"467d9d2f-3356-4177-9f05-2575f5c15d47","resolution":{"observed_at":"2026-08-06T22:46:02.394794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05599","last_updated":"2023-12-09T16:01:21Z","snapshot_observed_at":"2026-07-06T16:59:15.553868Z","submitted_at":"2023-12-09T16:01:21Z","title":"Not All Data Matters: An End-to-End Adaptive Dataset Pruning Framework for Enhancing Model Performance and Efficiency","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.05599","snapshot_observed_at":"2026-08-06T22:46:00.186939Z","title":"Not all data matters: An end-to-end adap- tive dataset pruning framework for enhancing model per- formance and efficiency.arXiv preprint arXiv:2312.05599, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.186939Z"},"links":{"cited_paper":"/paper/2312.05599","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:c11315f9c367f767c76e8786609439ec204de90fbe501f6d43211b4ab83def48","observation_id":"a5d31db3-065d-4aa1-8875-1f47896ec3e3","resolution":{"observed_at":"2026-08-06T22:46:00.186939Z","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-06T22:46:02.375991Z","title":"In- vestigating the effectiveness of data augmentation from simi- larity and diversity: An empirical study.Pattern Recognition, 148:110204, 2024","venue":null,"work_id":"0c4755d8-47d1-4309-aa6a-76cbab160530","year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.248726Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:c6baa26e02dac0d44dfe12de4ecaec1a6573b0c41a71cb5c5234e48ed5192b27","observation_id":"0c697fb3-1057-4099-bd62-229d5b9b0e16","resolution":{"observed_at":"2026-08-06T22:46:02.380754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11467","last_updated":"2025-07-13T15:34:26Z","snapshot_observed_at":"2026-07-06T18:16:20.122022Z","submitted_at":"2024-05-19T06:54:03Z","title":"AdaAugment: A Tuning-Free and Adaptive Approach to Enhance Data Augmentation","version":3},"cited_work":{"arxiv_id":"2405.11467","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.11467","snapshot_observed_at":"2026-08-06T22:46:01.716763Z","title":"AdaAugment: A Tuning-Free and Adaptive Approach to Enhance Data Augmentation","venue":"cs.CV","work_id":"3b3e9dd2-811b-48eb-9d4a-25d68f19213d","year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.273146Z"},"links":{"cited_paper":"/paper/2405.11467","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:aeaa2bc91d20d376a473e9fabd744ea156d0b563d4cc9dcae465a7f803a4d079","observation_id":"f6263b7d-935d-4b9d-9425-85aafa11aa6b","resolution":{"observed_at":"2026-08-06T22:46:01.721993Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.360182Z","title":"Entaugment: Entropy-driven adaptive data augmentation framework for image classification","venue":null,"work_id":"ab23ed25-d1bd-4071-b11d-f7f926d38c30","year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.340167Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:f4686d88e5653f949824080a8a5aa0ce3ddcf3c4587bce617df12ceddb1b40d6","observation_id":"0fdadc98-eae9-4b48-8e1e-81d6ade9aafb","resolution":{"observed_at":"2026-08-06T22:46:02.366373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11215","last_updated":"2025-06-20T04:41:06Z","snapshot_observed_at":"2026-08-09T11:16:05.305900Z","submitted_at":"2024-10-15T03:00:58Z","title":"A CLIP-Powered Framework for Robust and Generalizable Data Selection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11215","snapshot_observed_at":"2026-08-06T22:46:00.463710Z","title":"A clip-powered framework for ro- bust and generalizable data selection.arXiv preprint arXiv:2410.11215, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.463710Z"},"links":{"cited_paper":"/paper/2410.11215","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:0a609127d3eddfa1d5b8946c30f91d45eca69de5dc89f23d23e17857e2b55a3f","observation_id":"f36bed3d-fe36-4a96-871a-01cc7d39aa1f","resolution":{"observed_at":"2026-08-06T22:46:00.463710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03809","last_updated":"2025-05-02T11:38:48Z","snapshot_observed_at":"2026-08-08T08:03:51.071432Z","submitted_at":"2025-05-02T11:38:48Z","title":"When Dynamic Data Selection Meets Data Augmentation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03809","snapshot_observed_at":"2026-08-06T22:46:00.502202Z","title":"When dynamic data selection meets data augmentation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.502202Z"},"links":{"cited_paper":"/paper/2505.03809","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:c30511610dc7a2972da49c7b97bc341e4f565ef4705921cb8ea4f83187ed9949","observation_id":"41f0be0b-0fc1-4466-a89b-a3e2d06bb2af","resolution":{"observed_at":"2026-08-06T22:46:00.502202Z","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-06T22:46:02.345999Z","title":"Nearly op- timal vc-dimension and pseudo-dimension bounds for deep neural network derivatives","venue":null,"work_id":"12a1b024-adc5-4f81-a940-3e58155a2aba","year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.616507Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:48810c71f8a315755ecaa431cf6147449c46f57a7ea204abe9e7a7a740379516","observation_id":"9dc560aa-b306-44a1-aaa7-201bd79e6472","resolution":{"observed_at":"2026-08-06T22:46:02.350957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03173","last_updated":"2024-03-18T21:44:47Z","snapshot_observed_at":"2026-08-04T00:02:13.267299Z","submitted_at":"2023-10-04T21:40:36Z","title":"$\\mathcal{B}$-Coder: Value-Based Deep Reinforcement Learning for Program Synthesis","version":2},"cited_work":{"arxiv_id":"2310.03173","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.03173","snapshot_observed_at":"2026-08-06T22:46:01.660805Z","title":"$\\mathcal{B}$-Coder: Value-Based Deep Reinforcement Learning for Program Synthesis","venue":"cs.CL","work_id":"15a828c3-4bbd-453d-a096-c817559fef4c","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.717321Z"},"links":{"cited_paper":"/paper/2310.03173","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:89e687bf76938b66b37655ac44bc473652b732acfe65478c1d69021bf7b498d7","observation_id":"a5cd0c3f-029c-4e47-adb5-8f3e4aebfd35","resolution":{"observed_at":"2026-08-06T22:46:01.668249Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.331151Z","title":"Metalight: Value-based meta-reinforcement learning for traffic signal control","venue":null,"work_id":"4308a60b-6d80-4f04-8963-b977f319222c","year":2020},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.779701Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:3fbedc330d5cc2b2efc366269f34e8cdd8e5251422fc2a64c210a016120b4224","observation_id":"aca3617e-a97a-45b6-886c-74f64ea7d918","resolution":{"observed_at":"2026-08-06T22:46:02.335805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.315746Z","title":"Accelerating dataset distillation via model augmenta- tion","venue":null,"work_id":"d7629e57-682b-4cce-8be8-ae869d572145","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.923252Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:5349ccd458eaad5a062bfb638d1ae4bd30aa5ac56a3580986d925cfb5ca6827a","observation_id":"cc4e0b73-f622-47e3-939c-1c9a84a9cb2a","resolution":{"observed_at":"2026-08-06T22:46:02.320800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.300900Z","title":"Spanning training progress: Temporal dual-depth scoring (tdds) for enhanced dataset pruning","venue":null,"work_id":"f7e83f39-33cc-4b52-9a36-3e75d1e5e70a","year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:00.972474Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:0841f2725b2c0230009d2fc461127a7c77e883f580d1d0a899c4628456126fab","observation_id":"5145a703-5fd9-4d7a-8613-83f7890a8d59","resolution":{"observed_at":"2026-08-06T22:46:02.306102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.286434Z","title":"Selectivity drives productivity: Efficient dataset prun- ing for enhanced transfer learning.Advances in Neural In- formation Processing Systems, 36, 2024","venue":null,"work_id":"04f888e2-5806-42a6-8396-d7bf1efe5d7a","year":2024},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.069893Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:b43a74fafb876f51179b11e80aeebec2de0c0bd3f22912ca7326dcc51a29e5a3","observation_id":"e7412f3e-1c85-4513-b0bb-8fc8d7a372bb","resolution":{"observed_at":"2026-08-06T22:46:02.291133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.270562Z","title":"Coverage-centric coreset selection for high pruning rates","venue":null,"work_id":"1aa6e145-3502-43e9-9fb4-b88b63c77424","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.158138Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:64cfd2bbc9aa297ef14710e2a78897d5bbe2591b749bf01630dae92e9adc2376","observation_id":"fb954907-9de4-4d40-90ed-5e4da4bd7c72","resolution":{"observed_at":"2026-08-06T22:46:02.276071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.254528Z","title":"Dataset quantization","venue":null,"work_id":"8b29a42a-7630-490c-a580-c4eabc6b5784","year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.257810Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:7a8f3546cbaef778c40225481ffcc73762b5df733edfdb93b1df69ae428e1ece","observation_id":"b504299d-eaed-4d2c-92f2-d05f8b63170b","resolution":{"observed_at":"2026-08-06T22:46:02.259087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.00719","last_updated":"2022-10-24T05:49:56Z","snapshot_observed_at":"2026-08-01T08:04:07.723440Z","submitted_at":"2022-06-01T19:02:06Z","title":"Dataset Distillation using Neural Feature Regression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.00719","snapshot_observed_at":"2026-08-06T22:46:01.357184Z","title":"Dataset distillation using neural feature regression.arXiv preprint arXiv:2206.00719, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.357184Z"},"links":{"cited_paper":"/paper/2206.00719","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:02953eb9da70dfa3bc2c294240a9297cb33eae78e7ccba42fa7c85a467eccb42","observation_id":"49af3629-c284-4a2e-a2c6-37542003e6c9","resolution":{"observed_at":"2026-08-06T22:46:01.357184Z","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-06T22:46:02.238658Z","title":"ˆyi − ˆyj =∥w(x i −x j)∥(12) ≤ ∥w∥ ∥xi −x j∥(13) ≤ϵ∥w∥(14) (15) In the above, the Inequality(13)follows from H ¨older’s inequality","venue":null,"work_id":"e46b7863-ccf1-497f-937f-184fe32d2e6d","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.432758Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:e7fbb5f7619e66508082c1bb04aa825367005efb32e6c4abbd086d849102f78f","observation_id":"820bb129-b97c-4b0f-b838-41a6905dd2c7","resolution":{"observed_at":"2026-08-06T22:46:02.244079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.222290Z","title":null,"venue":null,"work_id":"2dbf5264-1ec5-404c-9816-d289c41b8a1a","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.549340Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:fde00694586b096f15b48d316f1e4b200dd9db4600d8f2fefea5d49b0d1840cf","observation_id":"4cc18842-905c-412c-868b-ff0323942e68","resolution":{"observed_at":"2026-08-06T22:46:02.227674Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.207209Z","title":null,"venue":null,"work_id":"9df8167c-d653-47be-ba40-3876bf25c67e","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.557674Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:c700467fb8fdd9433e28f83cfc12f70c36bb9579382b399ac2612ad73458c6c1","observation_id":"912c5b4c-e5e8-4a9c-88f4-eb8de8e36629","resolution":{"observed_at":"2026-08-06T22:46:02.212016Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.191844Z","title":null,"venue":null,"work_id":"a534ba8c-75f5-48e2-8c03-f4c09cf6714d","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.562309Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:12dc177b46ec424cda092e7d1a609a5148b80cd18ca7a90210ed49acff27b9d5","observation_id":"c7eeebbd-b433-478c-b360-1d38c72ba471","resolution":{"observed_at":"2026-08-06T22:46:02.197233Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.176786Z","title":null,"venue":null,"work_id":"39605e19-7803-4ac9-bdc4-85025ddbc10b","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.566577Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:5e88f212ec7083975cc0b38d8744055b103bbc62613c331b6e9ff698f408ae10","observation_id":"8cbbd3d0-0eef-4a09-aa17-db939f8d86d9","resolution":{"observed_at":"2026-08-06T22:46:02.181469Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.161285Z","title":"The total epoch is 200, and no warm-up schedule is used","venue":null,"work_id":"09557301-1613-40fb-9343-af9fc3a7909a","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.570981Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:56a1b51be01426b5affa2f413ac7da6f0d57cb9a21586224ae38c07e1ea4bc38","observation_id":"5428e772-4ce3-474e-88d1-34e11d76d88f","resolution":{"observed_at":"2026-08-06T22:46:02.166571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.146793Z","title":"The A2C network architecture details","venue":null,"work_id":"57ed9c0a-cd5e-4238-b604-f5af21ad8fea","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.575895Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:2fd7f06d3e5055d0ab1799f29dc6cfe708d2f169dd07df160ac0e0f90c6a6a8b","observation_id":"7741c6a8-88b1-44d4-b969-cd21e9e76784","resolution":{"observed_at":"2026-08-06T22:46:02.151473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.130592Z","title":"The complexities of the first two steps areO N 2 k d andO N 2 k , respectively, whereN k is the number of sam- ples in classkanddis the feature dimension (e.g., 512 for ResNet-18)","venue":null,"work_id":"000e7e3e-295e-4210-bc29-c70290aef695","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.579711Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:6663c41a691edfee251c3da770eac2e2cc450de97fa9d8b2dbdf4a0eca7cbc82","observation_id":"0aefc2e8-56c9-441a-b2e8-bed2d33e4e1e","resolution":{"observed_at":"2026-08-06T22:46:02.136574Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.115241Z","title":null,"venue":null,"work_id":"107a2c65-58ac-417b-a313-78ace4485a25","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.583720Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:67b57df2bae4235099798632da4ad2e680d945c4a3146426277ca4ae9b365310","observation_id":"c7417447-d8ff-4ca7-a844-ce983a66109c","resolution":{"observed_at":"2026-08-06T22:46:02.120060Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.099603Z","title":"For experiments on Tiny-ImageNet, following [72], we adopt a batch size of 256, an SGD opti- mizer with a momentum of 0.9, weight decay of 1e-4, and an initial learning rate of 0.1","venue":null,"work_id":"86e85d10-a7bb-4770-abdf-c867ed16b25f","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.587796Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:09629d5c47af525657004f790037dfadd411e9f02fa23b3cb885dff9ae5d6d8a","observation_id":"5748ba80-4ad1-4be4-b1a5-a8716854be97","resolution":{"observed_at":"2026-08-06T22:46:02.104613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.083401Z","title":"Specifically, once the selected datasets are obtained, only a subset needs to be stored as a replacement for the full dataset, leading to savings in memory costs","venue":null,"work_id":"f57199dd-c4f0-438f-a845-414b88b9a410","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.592676Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:10901af49e59031ab32e4f859c94fd6c4edc445656a8bc5ed591c7f1509f18a2","observation_id":"b6b66a7a-8fa4-44f5-87d9-7117fd9f9489","resolution":{"observed_at":"2026-08-06T22:46:02.088715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:46:02.067948Z","title":"As shown in Table 8, our method can achieve superior results","venue":null,"work_id":"bd2be326-e899-4858-a8df-c4e371634703","year":null},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-06T22:46:01.597095Z"},"links":{"citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:e26c28f779b623f20991c611bbee68571b1e584abf263c15f85eafbe162c382b","observation_id":"6a4e3880-05cd-4cad-83e5-7cff299da327","resolution":{"observed_at":"2026-08-06T22:46:02.072710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T22:19:57.815374Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":54,"verified_exact":4,"verified_fuzzy":41},"total_outbound_references":102},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 100 of 102 outbound references and 1 inbound Pith citation observation for arXiv:2506.21037."}