{"as_of":"2026-08-18T09:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd16076aca0e16aa2423c6603ac78d65f1fe104889711e2b6fec65365bde64a0","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T12:26:16.373663Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T22:05:05.662609Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.04947","last_updated":"2023-10-20T04:38:34Z","snapshot_observed_at":"2026-08-17T04:59:49.921361Z","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-08T12:26:16.373663Z","title":"Infobatch: Lossless training speed up by unbiased dynamic data pruning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.07547","last_updated":"2025-02-11T13:34:09Z","snapshot_observed_at":"2026-08-13T03:44:22.463537Z","submitted_at":"2025-02-11T13:34:09Z","title":"Instance-dependent Early Stopping","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-08T12:26:16.373663Z"},"links":{"cited_paper":"/paper/2303.04947","citing_paper":"/paper/2502.07547"},"observation_digest":"sha256:f9fedc878afad46ae9f8dd8ded9192587e6e08d224b5a15edc0b2bfa257b34cc","observation_id":"8421adad-a751-4c78-af0e-5b187f025f60","resolution":{"observed_at":"2026-08-08T12:26:16.373663Z","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-17T04:59:49.921361Z","submitted_at":"2023-03-08T23:40:47Z","title":"InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.04947","snapshot_observed_at":"2026-08-06T22:45:59.939052Z","title":"Infobatch: Lossless training speed up by unbiased dynamic data pruning.arXiv preprint arXiv:2303.04947, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21037","last_updated":"2025-06-26T06:28:56Z","snapshot_observed_at":"2026-08-15T12:17:19.659405Z","submitted_at":"2025-06-26T06:28:56Z","title":"RL-Selector: Reinforcement Learning-Guided Data Selection via Redundancy Assessment","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:59.939052Z"},"links":{"cited_paper":"/paper/2303.04947","citing_paper":"/paper/2506.21037"},"observation_digest":"sha256:79438d5b496df9232d534ed79c9aee7706223b0457d770557a808c4d94fde146","observation_id":"c76ea08c-374c-4588-99e3-c699b1e0358b","resolution":{"observed_at":"2026-08-06T22:45:59.939052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04947","last_updated":"2023-10-20T04:38:34Z","snapshot_observed_at":"2026-08-17T04:59:49.921361Z","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-06T16:45:02.762139Z","title":"Infobatch: Lossless training speed up by unbiased dynamic data pruning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.12750","last_updated":"2025-07-17T03:08:26Z","snapshot_observed_at":"2026-08-16T14:13:04.702274Z","submitted_at":"2025-07-17T03:08:26Z","title":"Multimodal-Guided Dynamic Dataset Pruning for Robust and Efficient Data-Centric Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:45:02.762139Z"},"links":{"cited_paper":"/paper/2303.04947","citing_paper":"/paper/2507.12750"},"observation_digest":"sha256:f76337b105aef282f22e535bfb89fb5599db238caee4abab6f4d94481857fc54","observation_id":"4367702a-6c57-44c3-859e-41be010f687c","resolution":{"observed_at":"2026-08-06T16:45:02.762139Z","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-17T04:59:49.921361Z","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-06T16:39:56.268656Z","title":"Infobatch: Lossless training speed up by unbiased dynamic data pruning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.12998","last_updated":"2025-07-17T11:13:44Z","snapshot_observed_at":"2026-08-14T14:52:31.105230Z","submitted_at":"2025-07-17T11:13:44Z","title":"Differential-informed Sample Selection Accelerates Multimodal Contrastive Learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T16:39:56.268656Z"},"links":{"cited_paper":"/paper/2303.04947","citing_paper":"/paper/2507.12998"},"observation_digest":"sha256:6a11f6ef3e6308098b541bf9df6b0f7d78e3fabcd2411a4ea2d81445468973ed","observation_id":"655cd42e-e420-43ac-8fd0-072efa711d96","resolution":{"observed_at":"2026-08-06T16:39:56.268656Z","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-17T04:59:49.921361Z","submitted_at":"2023-03-08T23:40:47Z","title":"InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning","version":2},"cited_work":{"arxiv_id":"2303.04947","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.04947","snapshot_observed_at":"2026-06-30T22:05:05.662609Z","title":"Infobatch: Lossless training speed up by unbiased dynamic data pruning.arXiv preprint arXiv:2303.04947","venue":null,"work_id":"4109e91f-6a0e-45a3-8e21-060e6c654b3e","year":2023},"citing_paper":{"arxiv_id":"2603.07433","last_updated":"2026-05-13T01:27:10Z","snapshot_observed_at":"2026-08-15T03:24:08.429253Z","submitted_at":"2026-03-08T03:10:39Z","title":"Data Agent: Learning to Select Data via End-to-End Dynamic Optimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-15T15:23:23.950152Z"},"links":{"cited_paper":"/paper/2303.04947","citing_paper":"/paper/2603.07433"},"observation_digest":"sha256:c9028918f8146d6b4b15edf17d3da56608e3ac7f2f6d067639981e9560eebbdb","observation_id":"37b42bd2-25fa-4ca6-9056-326e579df41d","resolution":{"observed_at":"2026-05-15T15:26:10.934061Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04947","last_updated":"2023-10-20T04:38:34Z","snapshot_observed_at":"2026-08-17T04:59:49.921361Z","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:78c64ffeda2d166eb59487be526bdc2ab4c6810b1da7706696e6487ef4b1109d","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":"2303.04947","last_updated":"2023-10-20T04:38:34Z","snapshot_observed_at":"2026-08-17T04:59:49.921361Z","submitted_at":"2023-03-08T23:40:47Z","title":"InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning","version":2},"cited_work":{"arxiv_id":"2303.04947","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.04947","snapshot_observed_at":"2026-06-30T22:05:05.662609Z","title":"Infobatch: Lossless training speed up by unbiased dynamic data pruning.arXiv preprint arXiv:2303.04947","venue":null,"work_id":"4109e91f-6a0e-45a3-8e21-060e6c654b3e","year":2023},"citing_paper":{"arxiv_id":"2605.14773","last_updated":"2026-05-14T12:37:11Z","snapshot_observed_at":"2026-08-13T11:49:19.636602Z","submitted_at":"2026-05-14T12:37:11Z","title":"Beyond What to Select: A Plug-and-play Oscillatory Data-Volume Scheduling for Efficient Model Training","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-30T21:49:36.142405Z"},"links":{"cited_paper":"/paper/2303.04947","citing_paper":"/paper/2605.14773"},"observation_digest":"sha256:8579b583cb183bc09dc71122d06ab38a0a1e8450441f49195d5126e6bca1355a","observation_id":"0b317a89-29c5-45dc-b0eb-575420b862af","resolution":{"observed_at":"2026-06-30T21:55:06.005804Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04947","last_updated":"2023-10-20T04:38:34Z","snapshot_observed_at":"2026-08-17T04:59:49.921361Z","submitted_at":"2023-03-08T23:40:47Z","title":"InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning","version":2},"cited_work":{"arxiv_id":"2303.04947","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.04947","snapshot_observed_at":"2026-06-30T22:05:05.662609Z","title":"Infobatch: Lossless training speed up by unbiased dynamic data pruning.arXiv preprint arXiv:2303.04947","venue":null,"work_id":"4109e91f-6a0e-45a3-8e21-060e6c654b3e","year":2023},"citing_paper":{"arxiv_id":"2605.23969","last_updated":"2026-05-13T06:36:24Z","snapshot_observed_at":"2026-08-09T04:48:40.503387Z","submitted_at":"2026-05-13T06:36:24Z","title":"SLAP: Stratified Loss-based Pruning for On-Policy Data-Efficient Instruction Tuning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-30T22:02:30.217607Z"},"links":{"cited_paper":"/paper/2303.04947","citing_paper":"/paper/2605.23969"},"observation_digest":"sha256:0eed6353551f437f6e490139d4ccec25e1f0f409b04b1221665f79233f90bf2d","observation_id":"052248ca-7213-4798-b5d3-619601e1f77a","resolution":{"observed_at":"2026-06-30T22:05:05.664193Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04947","last_updated":"2023-10-20T04:38:34Z","snapshot_observed_at":"2026-08-17T04:59:49.921361Z","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-01T22:29:40.050893Z","title":"InfoBatch: Lossless Train- ing Speed Up by Unbiased Dynamic Data Pruning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.15745","last_updated":"2026-07-17T08:33:43Z","snapshot_observed_at":"2026-08-17T07:39:00.746164Z","submitted_at":"2026-07-17T08:33:43Z","title":"Learning Faster without Deeper Networks: A*-Inspired Batch Selection for Efficient CNN Training","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:40.050893Z"},"links":{"cited_paper":"/paper/2303.04947","citing_paper":"/paper/2607.15745"},"observation_digest":"sha256:e5823b149b586b9913aec6c46e8211c36428a75ef8bd534bafed8a3319a53bc8","observation_id":"03e26409-0670-4bd3-ba20-6d1819113de9","resolution":{"observed_at":"2026-08-01T22:29:40.050893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2303.04947/citation-record","integrity":"/paper/2303.04947/integrity","json":"/paper/2303.04947/citation-record.json","paper":"/paper/2303.04947"},"outbound":[],"paper":{"arxiv_id":"2303.04947","last_updated":"2023-10-20T04:38:34Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-17T04:59:49.921361Z","submitted_at":"2023-03-08T23:40:47Z","title":"InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2303.04947."}