{"as_of":"2026-08-19T00:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:462a73c7aa887c7e66868f595906959f103172699925920bfff99f3a72fff92b","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T02:34:22.725072Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2603.17205/citation-record","integrity":"/paper/2603.17205/integrity","json":"/paper/2603.17205/citation-record.json","paper":"/paper/2603.17205"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.09540","last_updated":"2023-03-22T17:22:35Z","snapshot_observed_at":"2026-08-06T15:07:40.203199Z","submitted_at":"2023-03-16T17:53:24Z","title":"SemDeDup: Data-efficient learning at web-scale through semantic deduplication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.09540","snapshot_observed_at":"2026-08-03T02:34:18.469510Z","title":"Semd- edup: Data-efficient learning at web-scale through semantic deduplication.arXiv preprint arXiv:2303.09540,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:18.469510Z"},"links":{"cited_paper":"/paper/2303.09540","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:675c80b2680565cd4c7e1a8506cd0903c7383b5377fb4272954635cd15ee3072","observation_id":"6a076bfc-d7e4-4297-9cae-ce3c43c2bed7","resolution":{"observed_at":"2026-08-03T02:34:18.469510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19128","last_updated":"2024-10-01T18:40:07Z","snapshot_observed_at":"2026-08-16T13:14:38.550698Z","submitted_at":"2024-09-27T20:21:19Z","title":"Pruning then Reweighting: Towards Data-Efficient Training of Diffusion Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.19128","snapshot_observed_at":"2026-08-03T02:34:19.490475Z","title":"Pruning then reweighting: Towards data- efficient training of diffusion models.arXiv preprint arXiv:2409.19128,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:19.490475Z"},"links":{"cited_paper":"/paper/2409.19128","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:0396ba0ff85b276fe1ea1721a68d2bb8d5695a99fb279894a5d920799b631f0f","observation_id":"ac99a121-77f9-4c14-aa72-b2e2383b5500","resolution":{"observed_at":"2026-08-03T02:34:19.490475Z","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-03T02:34:19.604765Z","title":"Handschuh, A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:19.604765Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:af76341456fff4f7b6bb6c3394e1160a6cdb8e46aebbfc4118a6c385107551eb","observation_id":"04e17b24-ccdc-4fd3-9791-0c55bc33723f","resolution":{"observed_at":"2026-08-03T02:34:19.604765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.04564","last_updated":"2023-09-08T19:34:05Z","snapshot_observed_at":"2026-08-16T15:02:10.343729Z","submitted_at":"2023-09-08T19:34:05Z","title":"When Less is More: Investigating Data Pruning for Pretraining LLMs at Scale","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.04564","snapshot_observed_at":"2026-08-03T02:34:19.737306Z","title":"When less is more: Investigating data pruning for pretraining llms at scale.arXiv preprint arXiv:2309.04564,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:19.737306Z"},"links":{"cited_paper":"/paper/2309.04564","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:a6a79bd1312184a254a61c2714294b00a6e0d9d6bcafb8008889ff5fade35ce9","observation_id":"02f8e2ee-dc95-42cb-a6ab-97b1549804ad","resolution":{"observed_at":"2026-08-03T02:34:19.737306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.07316","last_updated":"2023-03-19T13:37:01Z","snapshot_observed_at":"2026-08-17T06:54:11.300249Z","submitted_at":"2022-10-13T19:42:08Z","title":"MTEB: Massive Text Embedding Benchmark","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.07316","snapshot_observed_at":"2026-08-03T02:34:19.819441Z","title":"Mteb: Massive text embedding benchmark.arXiv preprint arXiv:2210.07316,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:19.819441Z"},"links":{"cited_paper":"/paper/2210.07316","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:95499c61d91c568640205036294073436973fb045519b68e4ef031a64137e5af","observation_id":"2bcb5d45-2286-4eef-86d5-149ef3ea0949","resolution":{"observed_at":"2026-08-03T02:34:19.819441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.09848","last_updated":"2019-03-26T12:39:04Z","snapshot_observed_at":"2026-08-19T00:34:42.404753Z","submitted_at":"2019-03-23T17:33:38Z","title":"Competence-based Curriculum Learning for Neural Machine Translation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.09848","snapshot_observed_at":"2026-08-03T02:34:19.983031Z","title":"Competence-based curriculum learning for neural machine translation","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:19.983031Z"},"links":{"cited_paper":"/paper/1903.09848","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:bcab7d878410154db2638c1668f3d04b153bc256cdbc0546c6cec0cd63e9ee1a","observation_id":"adc519f0-9d47-48c7-853e-6cc0c0d91ebf","resolution":{"observed_at":"2026-08-03T02:34:19.983031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08663","last_updated":"2021-10-21T01:18:28Z","snapshot_observed_at":"2026-08-09T23:22:21.200279Z","submitted_at":"2021-04-17T23:29:55Z","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08663","snapshot_observed_at":"2026-08-03T02:34:20.512620Z","title":"Nandan Thakur, Nils Reimers, and Jimmy Lin","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:20.512620Z"},"links":{"cited_paper":"/paper/2104.08663","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:aee7c52af59de4120a79a1c2d8025cbae822c1c6473466cddb72bbebb9c33c22","observation_id":"a63d6035-3a35-4cad-bbf6-96344981b9e0","resolution":{"observed_at":"2026-08-03T02:34:20.512620Z","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-03T02:34:20.659380Z","title":"FEVER: a large-scale dataset for fact extraction and VERification","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:20.659380Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:220940d22f9c96327b3f5c35f978bda5980b95125d42242feab9b19a15457b7c","observation_id":"5475180c-f206-48e5-b92e-d07f1223681d","resolution":{"observed_at":"2026-08-03T02:34:20.659380Z","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-03T02:34:20.783701Z","title":"doi: 10.18653/v1/N18-1074","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:20.783701Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:bdea739601ee6268adc7ab6c7d9a6d3f74669a500aacaba8c60e39ea2db92af8","observation_id":"a3e67083-d0d0-4e26-8bd9-4d9219b56c92","resolution":{"observed_at":"2026-08-03T02:34:20.783701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.05159","last_updated":"2019-11-15T17:08:30Z","snapshot_observed_at":"2026-08-16T19:44:25.767623Z","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-03T02:34:20.925644Z","title":"An empirical study of example forgetting during deep neural network learning.arXiv preprint arXiv:1812.05159,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:20.925644Z"},"links":{"cited_paper":"/paper/1812.05159","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:e5a1a3f8c12998beff15a3ec3923b2bf2b274095884b20171a2cefaf0a78bc98","observation_id":"00e2ab29-a0f6-4636-8fe5-307b1fbe0e52","resolution":{"observed_at":"2026-08-03T02:34:20.925644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-03T02:34:21.028767Z","title":"Llama 2: Open foundation and fine-tuned chat models.arXiv preprint arXiv:2307.09288,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:21.028767Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:1323053d43ed70ea3c8e804cdf006950ae11cfba2261a7b88224247fcfc167b2","observation_id":"c70d8bca-78cf-4d06-9986-f893252e7fc6","resolution":{"observed_at":"2026-08-03T02:34:21.028767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.03533","last_updated":"2024-02-22T06:21:51Z","snapshot_observed_at":"2026-07-06T14:27:46.217000Z","submitted_at":"2022-12-07T09:25:54Z","title":"Text Embeddings by Weakly-Supervised Contrastive Pre-training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.03533","snapshot_observed_at":"2026-08-03T02:34:21.121211Z","title":"Text embeddings by weakly-supervised contrastive pre-training","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:21.121211Z"},"links":{"cited_paper":"/paper/2212.03533","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:02ca1c959d771f488af34a0ac305fa003203465aed4b77f1f281a606f6a73e02","observation_id":"0ab545f9-84c0-4b4a-bc5f-87c2cd5236b2","resolution":{"observed_at":"2026-08-03T02:34:21.121211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18373","last_updated":"2024-06-26T14:17:36Z","snapshot_observed_at":"2026-08-18T01:11:09.082451Z","submitted_at":"2024-06-26T14:17:36Z","title":"Dynamic Data Pruning for Automatic Speech Recognition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18373","snapshot_observed_at":"2026-08-03T02:34:21.235727Z","title":"Dynamic data pruning for automatic speech recognition.arXiv preprint arXiv:2406.18373,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:21.235727Z"},"links":{"cited_paper":"/paper/2406.18373","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:2fd7afd1046d382c4cf04f32fd9fed68f101dff1b4a27c87e377b04d05a6f605","observation_id":"fb7c36ff-1ef1-441c-bf0e-cf793e736ab6","resolution":{"observed_at":"2026-08-03T02:34:21.235727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.09329","last_updated":"2023-02-27T04:55:14Z","snapshot_observed_at":"2026-08-18T01:18:48.170096Z","submitted_at":"2022-05-19T05:36:35Z","title":"Dataset Pruning: Reducing Training Data by Examining Generalization Influence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.09329","snapshot_observed_at":"2026-08-03T02:34:21.345501Z","title":"Dataset prun- ing: Reducing training data by examining generalization influence.arXiv preprint arXiv:2205.09329,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:21.345501Z"},"links":{"cited_paper":"/paper/2205.09329","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:77e86b255d62ccd6b179f22e790e77251f4c35ab3c006c8ce54909261f31a69e","observation_id":"d859c6a1-2d00-492d-8768-0045a8ede3f6","resolution":{"observed_at":"2026-08-03T02:34:21.345501Z","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-03T02:34:21.469413Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:21.469413Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:60d3e7cb82a2ffc4f6347f49cebdab80e342c221257b595435a98a4f0ace02d2","observation_id":"2d6bdf1e-b466-4123-a780-929ca627ce88","resolution":{"observed_at":"2026-08-03T02:34:21.469413Z","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-03T02:34:21.534643Z","title":"doi: 10.18653/v1/D18-1259","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:21.534643Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:177f5cdfa5c4b05722c65d65cc436957f1d8975964b00f2c81ee32ebe994fa00","observation_id":"94036946-2da2-47a2-8cc9-033b9801ab89","resolution":{"observed_at":"2026-08-03T02:34:21.534643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05176","last_updated":"2025-06-11T02:54:49Z","snapshot_observed_at":"2026-08-17T07:57:12.232097Z","submitted_at":"2025-06-05T15:49:48Z","title":"Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05176","snapshot_observed_at":"2026-08-03T02:34:21.625901Z","title":"Qwen3 embedding: Advancing text embedding and reranking through foundation models.arXiv preprint arXiv:2506.05176,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:21.625901Z"},"links":{"cited_paper":"/paper/2506.05176","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:b2023714c181b75c45c9efabea08abb0f50dc694929cd06e065a336f209529d3","observation_id":"28d1f29e-4c95-4a9c-8d0d-8e073664479b","resolution":{"observed_at":"2026-08-03T02:34:21.625901Z","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-03T02:34:21.831653Z","title":"While models like NV-Embed- v1 (Lee et al.,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:21.831653Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:1c811b5956199f695b570683c23f71da49f252f519d5f267e794438a6ba7c2b8","observation_id":"8357659c-82a6-4480-9293-e3176eb8af40","resolution":{"observed_at":"2026-08-03T02:34:21.831653Z","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-03T02:34:21.933113Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:21.933113Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:f3a9bcd9f35e7ed470819d74f09859862df3196165f9b75165423f1d5feb5630","observation_id":"b289423e-0e40-4d3c-b50c-b527861129fc","resolution":{"observed_at":"2026-08-03T02:34:21.933113Z","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-03T02:34:22.008506Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:22.008506Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:ce8520c7ee1f3b9a0665ba4c78f40fe4f88dcd66c8e6a8333fda708486bd5144","observation_id":"4a67eb4b-4506-40b7-a3d7-703e6f40331e","resolution":{"observed_at":"2026-08-03T02:34:22.008506Z","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-03T02:34:22.067937Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:22.067937Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:a2c0da8a81b27c6345ec50b0bad4e025bcab9404781f4cf2d8f9a953b89ed41c","observation_id":"82eae0b4-73a4-4fc9-ba09-52d29d91e4d0","resolution":{"observed_at":"2026-08-03T02:34:22.067937Z","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-03T02:34:22.136605Z","title":"Our work extends these ideas to the domain adaptation setting, where different considerations apply due to the distinct nature of the training data","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:22.136605Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:68fb386be310f49898e20134875212734c1c12c759d9365ae0761d8386d0a199","observation_id":"c789ca9a-2e8d-40f4-9930-5a0a617f2596","resolution":{"observed_at":"2026-08-03T02:34:22.136605Z","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-03T02:34:22.237137Z","title":"A.3 Curriculum Learning and Adaptive Training Curriculum learning has emerged as a promising approach to train neural networks by presenting training examples in a meaningful order","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:22.237137Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:b2862398c37c886fcab72b1534ec9e03e996a3985b7ccd40b5518e0e7f288d4b","observation_id":"0e4b7d2b-170a-44f4-bbce-5b9d8c966f86","resolution":{"observed_at":"2026-08-03T02:34:22.237137Z","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-03T02:34:22.509911Z","title":"• Training set:Documents with relevance levels of 2, 3, and 4 were treated as positive samples","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:22.509911Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:5589cd2342a313b3d35e6e3791230562843186d53f9edba2c9f3a59524a8fc1b","observation_id":"4dd6f081-0d31-46bc-8eb4-ca0a6d0859e0","resolution":{"observed_at":"2026-08-03T02:34:22.509911Z","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-03T02:34:22.664748Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:22.664748Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:5313d949f9718f73b618a491bd43f22e799a5153faf2045b3b264cfdda19c553","observation_id":"b53c9357-82a3-4b3e-9c78-9577476103ee","resolution":{"observed_at":"2026-08-03T02:34:22.664748Z","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-03T02:34:22.725072Z","title":"The results, presented in Figure 4, demonstrate that SP consistently surpasses FT in terms of NDCG@10 across all retention rates","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:22.725072Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:25b8fc315bdc1212f8c572fce41c7b7b321bffd2d853fbfa005ebfac90311646","observation_id":"e7108f77-525c-49b6-88c7-0bcb5cf711f3","resolution":{"observed_at":"2026-08-03T02:34:22.725072Z","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-03T02:34:22.455222Z","title":"The temperature is set to 0.02, and the system leverages cross-device negatives during training","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:22.455222Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:3b7f2a2a78c259625970f169bb1c52f8fcbc52574082f1f977626f8b15b2cfc2","observation_id":"194985a2-0dbd-423e-b2be-877f175dbce9","resolution":{"observed_at":"2026-08-03T02:34:22.455222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-08-17T20:30:34.016254Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-03T02:34:19.239397Z","title":"Mistral 7b.arXiv preprint arXiv:2310.06825,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:19.239397Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:4599c3c7d274355128abca6f0e4ba04d6804e46bf4bcd0ed10a7b8fbd3f842e8","observation_id":"26e17d7e-00ae-44e8-ad84-d38bbadccf03","resolution":{"observed_at":"2026-08-03T02:34:19.239397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-08-14T05:02:11.716316Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-03T02:34:20.309080Z","title":"Sentence-bert: Sentence embeddings using siamese bert-networks.arXiv preprint arXiv:1908.10084,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:20.309080Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:63f51927b7aca469c656e5a52dfa25fd2dadd66da9dc3b163cde5c97244f92de","observation_id":"0569c59f-1251-41b0-b54c-4d1abc1b0bad","resolution":{"observed_at":"2026-08-03T02:34:20.309080Z","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-03T02:34:22.369006Z","title":"Other works have explored the use of teacher-student frameworks (Matiisen et al., 2019), where a teacher model determines the curriculum for a student model","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:22.369006Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:c02bba584b6b05fd1855bd43cf34008694bcb5657ed6b2c5ddd2ae2bd4c1e2da","observation_id":"d7681e02-8582-41e1-866e-59495178c3c1","resolution":{"observed_at":"2026-08-03T02:34:22.369006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03216","last_updated":"2025-12-12T11:26:32Z","snapshot_observed_at":"2026-08-17T15:25:09.479397Z","submitted_at":"2024-02-05T17:26:49Z","title":"M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03216","snapshot_observed_at":"2026-08-03T02:34:18.518206Z","title":"Bge m3-embedding: Multi-lingual, multi-functionality, multi-granularity text embeddings through self-knowledge distillation.arXiv preprint arXiv:2402.03216,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:18.518206Z"},"links":{"cited_paper":"/paper/2402.03216","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:284deca8a670035196a371e680c20139a4fde151a12f1110b89f45b755da749e","observation_id":"f6e60640-fb9b-4efa-8ea0-000cb72bff21","resolution":{"observed_at":"2026-08-03T02:34:18.518206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04906","last_updated":"2020-09-30T21:27:13Z","snapshot_observed_at":"2026-07-06T09:11:26.109763Z","submitted_at":"2020-04-10T04:53:17Z","title":"Dense Passage Retrieval for Open-Domain Question Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04906","snapshot_observed_at":"2026-08-03T02:34:19.377747Z","title":"Dense passage retrieval for open-domain question answer- ing.arXiv preprint arXiv:2004.04906,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:19.377747Z"},"links":{"cited_paper":"/paper/2004.04906","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:e2087356af9ed5ab6d36d5289623fbff9bdb3b4da97809655947e33287361bd1","observation_id":"b62934c8-f276-48f9-bbf4-49d641e9f2b1","resolution":{"observed_at":"2026-08-03T02:34:19.377747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05492","last_updated":"2024-06-07T15:51:08Z","snapshot_observed_at":"2026-08-16T14:53:55.872485Z","submitted_at":"2023-10-09T07:56:16Z","title":"How Abilities in Large Language Models are Affected by Supervised Fine-tuning Data Composition","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05492","snapshot_observed_at":"2026-08-03T02:34:18.740900Z","title":"How abilities in large lan- guage models are affected by supervised fine-tuning data composition.arXiv preprint arXiv:2310.05492,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:18.740900Z"},"links":{"cited_paper":"/paper/2310.05492","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:8f482556d47296557a918f1cb54bc9ef579f803b4f9a1e84d18c17b56326565e","observation_id":"6cea7470-e9d7-484a-b8f4-8affa5e61608","resolution":{"observed_at":"2026-08-03T02:34:18.740900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04947","last_updated":"2023-10-20T04:38:34Z","snapshot_observed_at":"2026-08-18T15:38:02.757383Z","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-03T02:34:20.139275Z","title":"Infobatch: Lossless training speed up by unbiased dynamic data pruning.arXiv preprint arXiv:2303.04947,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:20.139275Z"},"links":{"cited_paper":"/paper/2303.04947","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:8fefcb82a761b1469f26995b8cdd4387ef5f10ea90a41c951765933956f15585","observation_id":"785ed716-352c-40bd-9124-9c65858132a0","resolution":{"observed_at":"2026-08-03T02:34:20.139275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.06146","last_updated":"2018-05-23T09:23:47Z","snapshot_observed_at":"2026-08-14T19:54:00.470999Z","submitted_at":"2018-01-18T17:54:52Z","title":"Universal Language Model Fine-tuning for Text Classification","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.06146","snapshot_observed_at":"2026-08-03T02:34:18.912953Z","title":"Large-scale dataset pruning with dynamic uncertainty","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:18.912953Z"},"links":{"cited_paper":"/paper/1801.06146","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:56adebd15a92b370f5ee65e23350c6511116b199cbf550f23ab43285ef1590d5","observation_id":"5ff49fe2-80b8-4097-9259-41c965a017e3","resolution":{"observed_at":"2026-08-03T02:34:18.912953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.09118","last_updated":"2022-08-29T12:17:32Z","snapshot_observed_at":"2026-08-14T13:19:21.742321Z","submitted_at":"2021-12-16T18:57:37Z","title":"Unsupervised Dense Information Retrieval with Contrastive Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.09118","snapshot_observed_at":"2026-08-03T02:34:19.052789Z","title":"Kalervo J¨arvelin and Jaana Kek¨al¨ainen","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:19.052789Z"},"links":{"cited_paper":"/paper/2112.09118","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:6545284667058572c02844ad377e64b478df2ada055ee96c5ab456db03d0b77b","observation_id":"f5d75f63-dbad-44a4-a796-719ec79f6d38","resolution":{"observed_at":"2026-08-03T02:34:19.052789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09906","last_updated":"2025-03-03T04:28:49Z","snapshot_observed_at":"2026-08-17T08:29:24.619960Z","submitted_at":"2024-02-15T12:12:19Z","title":"Generative Representational Instruction Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09906","snapshot_observed_at":"2026-08-03T02:34:19.873982Z","title":"Generative representational instruction tuning.arXiv preprint arXiv:2402.09906,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:19.873982Z"},"links":{"cited_paper":"/paper/2402.09906","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:b0744f339ec50cc27b65a630d3a7c48e4d35f23178f00430edd5f1395f6e8818","observation_id":"2a9d85cf-f43b-40d5-9b31-af4a42ce8166","resolution":{"observed_at":"2026-08-03T02:34:19.873982Z","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-16T17:39:34.647413Z","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-03T02:34:20.216624Z","title":"Accelerating deep learning with dynamic data pruning.arXiv preprint arXiv:2111.12621,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:20.216624Z"},"links":{"cited_paper":"/paper/2111.12621","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:ed69ec502b817c5273f584d8cfe399647af5b22710fedc0ea7c95943a3e8a15c","observation_id":"88e2f1ee-ad78-4f86-99bb-8583cdb2831b","resolution":{"observed_at":"2026-08-03T02:34:20.216624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-08-14T18:16:28.847993Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-03T02:34:18.620626Z","title":"Bert: Pre- training of deep bidirectional transformers for language understanding.arXiv preprint arXiv:1810.04805,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:18.620626Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:c6c9cf4d21a55a4b01090534cd87241cb4433a1284c8979f5de80d789d75a0c3","observation_id":"4e24626d-11e1-400f-879a-023973c2779b","resolution":{"observed_at":"2026-08-03T02:34:18.620626Z","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-03T02:34:21.724741Z","title":"Under review","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T02:34:21.724741Z"},"links":{"citing_paper":"/paper/2603.17205"},"observation_digest":"sha256:584127f2251afe3bded1bc755b1f8a66ddfac29d6b3ae48352ea38bc9985f033","observation_id":"2f08ae21-6b82-4d08-a992-dffcd7a9b5fb","resolution":{"observed_at":"2026-08-03T02:34:21.724741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.17205","last_updated":"2026-07-30T22:57:15Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-13T15:58:10.431583Z","submitted_at":"2026-03-17T23:11:45Z","title":"OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":40,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":40},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2603.17205."}