{"as_of":"2026-08-15T06:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:84e22d432ba43883cf2c5ad1c41e2a84448e427de91a6ebb2e0a6ed18df3e2c3","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T19:40:15.552837Z","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-07-04T20:50:12.692359Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.06960","last_updated":"2023-11-06T07:40:20Z","snapshot_observed_at":"2026-08-15T05:22:28.744847Z","submitted_at":"2023-02-14T10:38:40Z","title":"Data pruning and neural scaling laws: fundamental limitations of score-based algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.06960","snapshot_observed_at":"2026-08-12T19:40:15.552837Z","title":"Data pruning and neural scaling laws: fundamental limitations of score-based algorithms, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.10545","last_updated":"2025-02-17T23:14:08Z","snapshot_observed_at":"2026-08-14T11:20:51.953434Z","submitted_at":"2024-11-15T19:36:15Z","title":"Efficient Alignment of Large Language Models via Data Sampling","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T19:40:15.552837Z"},"links":{"cited_paper":"/paper/2302.06960","citing_paper":"/paper/2411.10545"},"observation_digest":"sha256:e3faf38d9bdee7215b1b26e8014757d0d37cebd953168f60ff251b2e43871351","observation_id":"31d18014-3ab3-4886-a212-382479d44f01","resolution":{"observed_at":"2026-08-12T19:40:15.552837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06960","last_updated":"2023-11-06T07:40:20Z","snapshot_observed_at":"2026-08-15T05:22:28.744847Z","submitted_at":"2023-02-14T10:38:40Z","title":"Data pruning and neural scaling laws: fundamental limitations of score-based algorithms","version":3},"cited_work":{"arxiv_id":"2302.06960","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.06960","snapshot_observed_at":"2026-07-04T20:50:12.692359Z","title":"arXiv preprint arXiv:2302.06960 , year=","venue":null,"work_id":"38cd087b-7447-4a18-ae46-cca1341c9230","year":2023},"citing_paper":{"arxiv_id":"2606.08574","last_updated":"2026-06-07T11:11:51Z","snapshot_observed_at":"2026-08-12T22:44:51.074475Z","submitted_at":"2026-06-07T11:11:51Z","title":"OrderDP: A Theoretically Guaranteed Lossless Dynamic Data Pruning Framework","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-06-27T18:26:32.883834Z"},"links":{"cited_paper":"/paper/2302.06960","citing_paper":"/paper/2606.08574"},"observation_digest":"sha256:c8ac2749d241b862041fef6cb8dd72e98a6c927e2dc57339891947423ee4a370","observation_id":"d012d466-3a5b-429d-8e26-14cf41ee41ce","resolution":{"observed_at":"2026-07-02T23:07:27.195165Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06960","last_updated":"2023-11-06T07:40:20Z","snapshot_observed_at":"2026-08-15T05:22:28.744847Z","submitted_at":"2023-02-14T10:38:40Z","title":"Data pruning and neural scaling laws: fundamental limitations of score-based algorithms","version":3},"cited_work":{"arxiv_id":"2302.06960","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.06960","snapshot_observed_at":"2026-07-04T20:50:12.692359Z","title":"arXiv preprint arXiv:2302.06960 , year=","venue":null,"work_id":"38cd087b-7447-4a18-ae46-cca1341c9230","year":2023},"citing_paper":{"arxiv_id":"2606.23611","last_updated":"2026-06-22T17:11:15Z","snapshot_observed_at":"2026-08-12T13:39:08.360008Z","submitted_at":"2026-06-22T17:11:15Z","title":"Data Selection Through Iterative Self-Filtering for Vision-Language Settings","version":1},"reference_index":191,"source":"arxiv_source","source_observed_at":"2026-06-26T09:22:47.537137Z"},"links":{"cited_paper":"/paper/2302.06960","citing_paper":"/paper/2606.23611"},"observation_digest":"sha256:84b6dd4855bac9e499e8d85207e55855971632f995d2aaef5b500684c2634aa5","observation_id":"2ce6b77f-a939-4976-92dc-5cdf10ea3543","resolution":{"observed_at":"2026-07-04T09:49:44.953283Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06960","last_updated":"2023-11-06T07:40:20Z","snapshot_observed_at":"2026-08-15T05:22:28.744847Z","submitted_at":"2023-02-14T10:38:40Z","title":"Data pruning and neural scaling laws: fundamental limitations of score-based algorithms","version":3},"cited_work":{"arxiv_id":"2302.06960","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.06960","snapshot_observed_at":"2026-07-04T20:50:12.692359Z","title":"arXiv preprint arXiv:2302.06960 , year=","venue":null,"work_id":"38cd087b-7447-4a18-ae46-cca1341c9230","year":2023},"citing_paper":{"arxiv_id":"2606.26091","last_updated":"2026-06-24T17:59:02Z","snapshot_observed_at":"2026-08-10T18:32:18.583804Z","submitted_at":"2026-06-24T17:59:02Z","title":"On-Policy Self-Distillation with Sampled Demonstrations Reduces Output Diversity","version":1},"reference_index":212,"source":"arxiv_source","source_observed_at":"2026-06-25T19:23:56.452083Z"},"links":{"cited_paper":"/paper/2302.06960","citing_paper":"/paper/2606.26091"},"observation_digest":"sha256:1e436d3b170e9492d235b349bfb0e4901b9d1a2119e5fab1324b2ac9c38cc1b1","observation_id":"d03bb547-aec3-4cf0-bd30-0988199c3e06","resolution":{"observed_at":"2026-07-04T20:50:12.694656Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2302.06960/citation-record","integrity":"/paper/2302.06960/integrity","json":"/paper/2302.06960/citation-record.json","paper":"/paper/2302.06960"},"outbound":[],"paper":{"arxiv_id":"2302.06960","last_updated":"2023-11-06T07:40:20Z","latest_version":3,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-15T05:22:28.744847Z","submitted_at":"2023-02-14T10:38:40Z","title":"Data pruning and neural scaling laws: fundamental limitations of score-based algorithms"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2302.06960."}