{"as_of":"2026-08-10T00:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:458b313bcb784a757bf1c779c33b2ac5ea1c94b0456f548ba97ae8bb3f1e652c","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T16:55:17.645929Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:53:07.138400Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06905","snapshot_observed_at":"2026-08-07T14:53:07.138400Z","title":"Lightweight dataset pruning without full training via example difficulty and prediction uncertainty, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17245","last_updated":"2025-05-22T19:46:51Z","snapshot_observed_at":"2026-08-07T14:48:05.345046Z","submitted_at":"2025-05-22T19:46:51Z","title":"Extending Dataset Pruning to Object Detection: A Variance-based Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:53:07.138400Z"},"links":{"cited_paper":"/paper/2502.06905","citing_paper":"/paper/2505.17245"},"observation_digest":"sha256:fc06075c072dbe5de62a262fa37da8d746402b3b90236ae13973d1ce19d255a6","observation_id":"58958b4e-c1ec-47d5-9215-fbeeec23e81b","resolution":{"observed_at":"2026-08-07T14:53:07.138400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06905","snapshot_observed_at":"2026-08-06T18:19:59.327333Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09029","last_updated":"2026-05-31T02:40:58Z","snapshot_observed_at":"2026-08-09T07:04:00.337129Z","submitted_at":"2025-07-11T21:25:11Z","title":"Model Parallelism With Subnetwork Data Parallelism","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:59.327333Z"},"links":{"cited_paper":"/paper/2502.06905","citing_paper":"/paper/2507.09029"},"observation_digest":"sha256:8a99baea17a60c7dd03cf1b2a8d419ea35f0bcd75a1256bdc9363831b4f31079","observation_id":"81cccf8e-54b2-4c00-8a7e-ee6f9d0e58aa","resolution":{"observed_at":"2026-08-06T18:19:59.327333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"cited_work":{"arxiv_id":"2502.06905","doi":"10.48550/arxiv.2502.06905","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06905","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ArXiv.org","work_id":"384ea1b0-f477-4020-a57f-ce36c1ef0c93","year":2025},"citing_paper":{"arxiv_id":"2604.11810","last_updated":"2026-04-09T14:08:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-09T14:08:01Z","title":"GRACE: A Dynamic Coreset Selection Framework for Large Language Model Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T18:06:46.131725Z"},"links":{"cited_paper":"/paper/2502.06905","citing_paper":"/paper/2604.11810"},"observation_digest":"sha256:17abbfee7f6807f1f2017786d9200d3dc059bd9a5c91241c8e58b759f7ad5424","observation_id":"d798a7fd-1861-44c6-9365-0017a2752ceb","resolution":{"observed_at":"2026-05-10T20:30:49.080101Z","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/2502.06905/citation-record","integrity":"/paper/2502.06905/integrity","json":"/paper/2502.06905/citation-record.json","paper":"/paper/2502.06905"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T16:55:18.218337Z","title":"Balancing feature similarity and label variability for optimal size-aware one-shot subset selection","venue":null,"work_id":"9ea47b6f-c134-431a-b713-82d103b060f6","year":2024},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.362000Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:9b05adb8d583287a839dd918a38e451888ae7978d8401ad117d57dd9b924f880","observation_id":"ae97a2a0-ce68-46cd-a010-ad21b87eb178","resolution":{"observed_at":"2026-08-08T16:55:18.221553Z","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-08T16:55:17.366819Z","title":"A closer look at memorization in deep networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.366819Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:db383608aa05ef3b9001706e6a07bf4957bda656b4a3068b1ad66c8891a949b7","observation_id":"6688bee4-2a87-4e43-9e82-3750579a8cb1","resolution":{"observed_at":"2026-08-08T16:55:17.366819Z","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-08T16:55:18.204862Z","title":"Curriculum learning","venue":null,"work_id":"b3047a65-c55a-4332-a23a-14e03b49e325","year":2009},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.370065Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:85ffae9e86d1127136fd05605befd0159a958bad00a716decf23309695e27d3d","observation_id":"ec42a330-5887-47c8-8333-83f03847486c","resolution":{"observed_at":"2026-08-08T16:55:18.208070Z","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":"2406.03057","last_updated":"2024-06-05T08:33:09Z","snapshot_observed_at":"2026-08-09T23:47:21.641589Z","submitted_at":"2024-06-05T08:33:09Z","title":"BWS: Best Window Selection Based on Sample Scores for Data Pruning across Broad Ranges","version":1},"cited_work":{"arxiv_id":"2406.03057","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.03057","snapshot_observed_at":"2026-08-08T16:55:17.874777Z","title":"BWS: Best Window Selection Based on Sample Scores for Data Pruning across Broad Ranges","venue":"cs.LG","work_id":"eca630d8-335d-44e5-a0c6-c94f13c6485f","year":2024},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.373614Z"},"links":{"cited_paper":"/paper/2406.03057","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:6c02d48f10435567acf42f17485f400113b5d7776c3251a43d94209082f374a6","observation_id":"a8d67be4-8656-4de6-876f-e52c4ca5c7b3","resolution":{"observed_at":"2026-08-08T16:55:17.910432Z","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":{"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-08T16:55:17.377215Z","title":"Selection via proxy: Efficient data selection for deep learning, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.377215Z"},"links":{"cited_paper":"/paper/1906.11829","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:58918f71698240aa10ab716847369bbe647c72c9951f14dad518495f9b158b1f","observation_id":"ea7bbfc4-ce2b-4519-9af4-e81a53b20f96","resolution":{"observed_at":"2026-08-08T16:55:17.377215Z","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-08T16:55:18.123621Z","title":"Data and parameter scaling laws for neural machine translation","venue":null,"work_id":"29c22222-7288-441a-8137-a4b9aa727758","year":2021},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.380554Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:4894f4fb982649ce6ae76e71876598e6c4c60479721b00264256b3ba51a92413","observation_id":"6b533af0-7338-4f83-a301-198b0a2f33e3","resolution":{"observed_at":"2026-08-08T16:55:18.179019Z","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-08T16:55:17.383760Z","title":"Implicit bias of gradient descent on linear convolutional networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.383760Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:45a64589cda49e9d3d5548dbdd448d407b9f9d74d6446b8e7f731a8b58d4aeb0","observation_id":"5dd54506-fe52-4ff4-896f-1d9ca9d19081","resolution":{"observed_at":"2026-08-08T16:55:17.383760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1512.03385","last_updated":"2015-12-10T19:51:55Z","snapshot_observed_at":"2026-07-06T04:39:28.429064Z","submitted_at":"2015-12-10T19:51:55Z","title":"Deep Residual Learning for Image Recognition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.03385","snapshot_observed_at":"2026-08-08T16:55:17.394225Z","title":"Deep residual learning for image recognition, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.394225Z"},"links":{"cited_paper":"/paper/1512.03385","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:ad1d129bebecb3ee94208ffe9588d9804d5d99de882ea343b6c27f2768484ef5","observation_id":"e295d1d5-d398-49f7-bf79-97edc110eb82","resolution":{"observed_at":"2026-08-08T16:55:17.394225Z","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-08T16:55:18.039238Z","title":"Large-scale dataset pruning with dynamic uncertainty","venue":null,"work_id":"bd938ef6-1ca1-4072-ab24-f568605fd4b6","year":2024},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.439587Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:eae3c27ee91180a1080dcb56c65898313707b06b7cb6cbcee932750cd9a32295","observation_id":"bbca8637-5aed-4083-9edc-5b50ec8b4e3a","resolution":{"observed_at":"2026-08-08T16:55:18.060834Z","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":"1903.12261","last_updated":"2019-03-28T20:56:37Z","snapshot_observed_at":"2026-08-09T13:36:49.416146Z","submitted_at":"2019-03-28T20:56:37Z","title":"Benchmarking Neural Network Robustness to Common Corruptions and Perturbations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.12261","snapshot_observed_at":"2026-08-08T16:55:17.481088Z","title":"Benchmarking neural network robustness to common corruptions and perturbations","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.481088Z"},"links":{"cited_paper":"/paper/1903.12261","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:b5b24571fc2ad39d229860871d8e4c7cbbd6a19864cc99ba14072e033d99c209","observation_id":"c8517c7f-6656-4915-b59a-928225fb3fae","resolution":{"observed_at":"2026-08-08T16:55:17.481088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.00409","last_updated":"2017-12-01T17:13:14Z","snapshot_observed_at":"2026-07-06T06:12:18.811024Z","submitted_at":"2017-12-01T17:13:14Z","title":"Deep Learning Scaling is Predictable, Empirically","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.00409","snapshot_observed_at":"2026-08-08T16:55:17.515724Z","title":"Deep learning scaling is predictable, empirically","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.515724Z"},"links":{"cited_paper":"/paper/1712.00409","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:e878aec59f8781989fe6f82ec65a345b587e701ad9e952ad42e71583f48711e5","observation_id":"408e3ab7-8a19-4edf-ab4b-d9b9a5286547","resolution":{"observed_at":"2026-08-08T16:55:17.515724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.03206","last_updated":"2021-06-15T17:22:27Z","snapshot_observed_at":"2026-07-06T08:55:49.383573Z","submitted_at":"2020-02-08T17:39:46Z","title":"Characterizing Structural Regularities of Labeled Data in Overparameterized Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.03206","snapshot_observed_at":"2026-08-08T16:55:17.550053Z","title":"Characterizing structural regularities of labeled data in overparameterized models","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.550053Z"},"links":{"cited_paper":"/paper/2002.03206","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:027b627ade88228cbc486233a05bc003ecdc0958bdc3f5d1cfab660d67ffbdaf","observation_id":"5afd24d8-08a1-4103-bbaa-24a71293f9af","resolution":{"observed_at":"2026-08-08T16:55:17.550053Z","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-08T16:55:18.030238Z","title":"Selective-supervised contrastive learning with noisy labels","venue":null,"work_id":"6c133ff6-49f9-472c-a303-020ceae1d782","year":2022},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.577739Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:d36cf6afb3b325139692352c8152aef510d7ff9483408eeac64ea184204755ef","observation_id":"410238ff-de77-4e16-ae41-912814d4a138","resolution":{"observed_at":"2026-08-08T16:55:18.033530Z","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-08T16:55:17.593167Z","title":"D2 pruning: Message passing for balancing diversity and difficulty in data pruning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.593167Z"},"links":{"cited_paper":"/paper/2310.07931","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:b8863587d7cde039d8d8772993764e8bc593e0cc89eb3465a8debd4facd01a15","observation_id":"309275ea-fc1a-4b50-965b-2a509569bfed","resolution":{"observed_at":"2026-08-08T16:55:17.593167Z","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-08T16:55:17.596525Z","title":"Making deep neural networks robust to label noise: A loss correction approach","venue":null,"work_id":null,"year":1944},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.596525Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:2662c9b659c0a04991fa56d85862157c13e034cd8f33f0db625acac01ddd800d","observation_id":"62b2da2f-79d5-41fc-9017-3cdc1fdd7f0b","resolution":{"observed_at":"2026-08-08T16:55:17.596525Z","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-08T16:55:18.015306Z","title":"Deep learning on a data diet: Finding important examples early in training","venue":null,"work_id":"e735ea46-523e-499a-99bf-bd62faf3bea3","year":2021},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.599592Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:e3468ff1cbab395f0de3c0559f46be00d0e36b7532c93d6d68b52a809ce6f2f5","observation_id":"357f8c55-59b2-4a48-b226-7b9716cb7f9a","resolution":{"observed_at":"2026-08-08T16:55:18.018449Z","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":"2001.10528","last_updated":"2020-12-23T14:01:54Z","snapshot_observed_at":"2026-08-05T05:18:08.216110Z","submitted_at":"2020-01-28T18:59:03Z","title":"Identifying Mislabeled Data using the Area Under the Margin Ranking","version":4},"cited_work":{"arxiv_id":"2001.10528","doi":null,"metadata_source":"pith","pith_arxiv_id":"2001.10528","snapshot_observed_at":"2026-08-08T16:55:17.771529Z","title":"Identifying Mislabeled Data using the Area Under the Margin Ranking","venue":"cs.LG","work_id":"e2ba64ec-5222-4bf3-a273-8c239345943f","year":2020},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.602501Z"},"links":{"cited_paper":"/paper/2001.10528","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:a8a1922bdb24d9e38f416d09a8b819e8b3ed85649232a25baba61ec736611e0b","observation_id":"8ccd08fb-4637-4a0f-9d8c-ad9d79c1e04c","resolution":{"observed_at":"2026-08-08T16:55:17.794292Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.12673","last_updated":"2019-12-20T18:20:34Z","snapshot_observed_at":"2026-08-05T03:04:56.613105Z","submitted_at":"2019-09-27T13:27:53Z","title":"A Constructive Prediction of the Generalization Error Across Scales","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.12673","snapshot_observed_at":"2026-08-08T16:55:17.605900Z","title":"A constructive prediction of the generalization error across scales","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.605900Z"},"links":{"cited_paper":"/paper/1909.12673","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:0bad69961aa9c8c3d93f4504010fa426d7337192ff1ae584213d9b34855bb550","observation_id":"7e057948-83c4-4227-a09d-a08b528836e5","resolution":{"observed_at":"2026-08-08T16:55:17.605900Z","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-08T16:55:18.006441Z","title":"Data augmentation as feature manipulation","venue":null,"work_id":"6725f2fb-db6b-49d9-bfb7-d9258dd0dc87","year":2022},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.608947Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:9dfdb8ab9afc7ba73e70a326a5dbfeec92737f271aebf6a9a056902438ac8592","observation_id":"b2fba5a3-6d66-4435-9bb8-17db8f217349","resolution":{"observed_at":"2026-08-08T16:55:18.009844Z","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-08T16:55:17.611938Z","title":"Very deep convolutional networks for large-scale image recognition, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.611938Z"},"links":{"cited_paper":"/paper/1409.1556","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:d9edb4590e6b0c0dacd5ef40126df6814f2a21281e893c5ada28dc0dd897c467","observation_id":"df5811ca-1075-43b6-9685-f31745942e30","resolution":{"observed_at":"2026-08-08T16:55:17.611938Z","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-08T16:55:17.997563Z","title":null,"venue":null,"work_id":"eeed1cbf-9e75-4e38-b254-43f5351b9864","year":2022},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.614530Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:241d5c20f05504f2d1c553a0a39f4f5ee7ee785255012a19dda1ff6489ccfa42","observation_id":"e3e46641-37fe-4e17-8ebf-33f83cf519d6","resolution":{"observed_at":"2026-08-08T16:55:18.000646Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T16:55:17.617282Z","title":"The implicit bias of gradient descent on separable data","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.617282Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:9e7dac44dcebff095480f8c138e5d7ca37e888055b8fc258906d57b716bb642b","observation_id":"362d8f55-1c29-4c0d-b537-377b92babd67","resolution":{"observed_at":"2026-08-08T16:55:17.617282Z","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-08T16:55:17.984070Z","title":"Dataset cartography: Mapping and diagnosing datasets with training dynamics","venue":null,"work_id":"5f728b76-53da-4f0d-bddd-9d71080d9309","year":2020},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.619560Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:7e4f9a42c8476bce32728385c68dc4529d2416a5236839d114fc3f1086f3e0e5","observation_id":"41008f06-d9e2-43b6-b602-fac6d89c0380","resolution":{"observed_at":"2026-08-08T16:55:17.987003Z","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-08T16:55:17.975650Z","title":"Data pruning by information maximization","venue":null,"work_id":"77a7b954-efa2-416d-bf97-ffa64f3bc48c","year":2025},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.621721Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:b5af896664ee6a621a952969c2d2b4eda78dffbe987378cec629f648eee6ebf1","observation_id":"5b246f73-cf9d-487f-ba1b-d7a6bf40cf52","resolution":{"observed_at":"2026-08-08T16:55:17.978949Z","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-08T16:55:17.623919Z","title":"An empirical study of example forgetting during deep neural network learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.623919Z"},"links":{"cited_paper":"/paper/1812.05159","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:5601e5a369793157c1e9a5fe522b710073484d2c43a0130bc8068d2fd3f86849","observation_id":"63eb6278-5b24-4c81-a187-45d6b1f3fcc6","resolution":{"observed_at":"2026-08-08T16:55:17.623919Z","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-08T16:55:17.966862Z","title":"Iterative learning with open-set noisy labels","venue":null,"work_id":"e9c76eaa-11ea-4f46-b62f-a404f70cf01e","year":2018},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.626213Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:9e0acdd0714215382d738c57471a521ed4af2fd4af28d3e56e38e528c3495657","observation_id":"4d0fb30d-b6db-48b3-8c97-7b5645f7dfc5","resolution":{"observed_at":"2026-08-08T16:55:17.970065Z","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-08T16:55:17.958373Z","title":"Robust early-learning: Hindering the memorization of noisy labels","venue":null,"work_id":"aac8e43c-c7f9-4551-b430-ff7f6e93b5fe","year":2020},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.628411Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:95a467fc3fe789a011490b496f7c4a9e80f7ce3ab77149f7dd14d6ac7cb601d7","observation_id":"4c75c90f-9c44-42ec-9b39-24314c2d6947","resolution":{"observed_at":"2026-08-08T16:55:17.961592Z","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":"2106.00455","last_updated":"2021-06-01T13:05:55Z","snapshot_observed_at":"2026-07-06T11:14:46.817047Z","submitted_at":"2021-06-01T13:05:55Z","title":"Instance Correction for Learning with Open-set Noisy Labels","version":1},"cited_work":{"arxiv_id":"2106.00455","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.00455","snapshot_observed_at":"2026-08-08T16:55:17.689892Z","title":"Instance Correction for Learning with Open-set Noisy Labels","venue":"cs.LG","work_id":"d1b06c62-f0ca-446c-a200-d3acde7a1aa2","year":2021},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.630941Z"},"links":{"cited_paper":"/paper/2106.00455","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:e7448a5df39a7ac6ba1af0d6bea6a9c04bc8aa40226ec4e4a32086325f933122","observation_id":"b256e60f-81b7-4946-9496-fc89b97c94d3","resolution":{"observed_at":"2026-08-08T16:55:17.709828Z","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-08T16:55:17.948739Z","title":"Moderate coreset: A universal method of data selection for real-world data-efficient deep learning","venue":null,"work_id":"e8c34929-2cfa-46fc-9c58-5949997c7558","year":2022},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.633852Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:e263e450f6800b70e696ad548ed84cba02a57b847a11546cc402984abd8d6f91","observation_id":"f4545963-911f-480d-9063-d6e1e5d1ba88","resolution":{"observed_at":"2026-08-08T16:55:17.952478Z","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-08T16:55:17.939972Z","title":"Mind the boundary: Coreset selection via reconstructing the decision boundary","venue":null,"work_id":"d731eb2d-2fa5-46d4-952c-e495d0f8b8a7","year":2024},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.636573Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:ce5dcdb0cefbba46b6bf33ba651c38ccb31476054e82f73e155d874e02bab8d6","observation_id":"b421b17d-451c-4c47-a9d5-5e19fcf114bb","resolution":{"observed_at":"2026-08-08T16:55:17.943248Z","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-08T16:55:17.930206Z","title":"Spanning training progress: Temporal dual-depth scoring (tdds) for enhanced dataset pruning","venue":null,"work_id":"88363356-078a-4830-b01c-61d3edeac6cc","year":2024},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.639330Z"},"links":{"citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:845d19da1ec3aa0eb4cc553ac3d9425edbad89589b629aba53faf496d0a30990","observation_id":"4c2297bd-79f4-4dc8-927f-a27e503782f6","resolution":{"observed_at":"2026-08-08T16:55:17.934211Z","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":"2210.15809","last_updated":"2023-03-06T04:54:25Z","snapshot_observed_at":"2026-07-06T14:11:28.089072Z","submitted_at":"2022-10-28T00:14:00Z","title":"Coverage-centric Coreset Selection for High Pruning Rates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.15809","snapshot_observed_at":"2026-08-08T16:55:17.642708Z","title":"Coverage-centric coreset selection for high pruning rates","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.642708Z"},"links":{"cited_paper":"/paper/2210.15809","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:7383533818db91209fc91642c4069727821cd5f9fbf56874c6783b513933a604","observation_id":"29b8f116-d98c-4bf7-b498-a4294d758b08","resolution":{"observed_at":"2026-08-08T16:55:17.642708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.09880","last_updated":"2023-01-24T09:37:00Z","snapshot_observed_at":"2026-08-06T00:08:18.875420Z","submitted_at":"2023-01-24T09:37:00Z","title":"Probabilistic Bilevel Coreset Selection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.09880","snapshot_observed_at":"2026-08-08T16:55:17.645929Z","title":"Probabilistic bilevel coreset selection, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T16:55:17.645929Z"},"links":{"cited_paper":"/paper/2301.09880","citing_paper":"/paper/2502.06905"},"observation_digest":"sha256:986ba3f54d26c7e65d4d5a3e30b8a7ef2d9a30d06eb417cb554bb354dc2b815a","observation_id":"a4e2683d-6f20-4ad5-99cc-8c5295785f06","resolution":{"observed_at":"2026-08-08T16:55:17.645929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.06905","last_updated":"2025-06-12T01:40:08Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T01:28:07.249569Z","submitted_at":"2025-02-10T01:18:40Z","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":16,"verified_exact":2,"verified_fuzzy":14},"total_outbound_references":33},"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 33 of 33 outbound references and 3 inbound Pith citation observations for arXiv:2502.06905."}