{"as_of":"2026-08-10T05:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8980497c43baa67a3965e1f067aa13f31642de438a9b5a8e3b05870d384db34d","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:33:11.026582Z","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-02T21:17:24.195093Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.04578","last_updated":"2024-03-12T10:35:56Z","snapshot_observed_at":"2026-08-08T17:53:54.646922Z","submitted_at":"2024-01-09T14:32:24Z","title":"Effective pruning of web-scale datasets based on complexity of concept clusters","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04578","snapshot_observed_at":"2026-08-07T14:33:11.026582Z","title":"Abbas, E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18458","last_updated":"2025-06-01T16:00:34Z","snapshot_observed_at":"2026-08-07T20:59:19.597449Z","submitted_at":"2025-05-24T01:57:12Z","title":"A Survey of LLM $\\times$ DATA","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:11.026582Z"},"links":{"cited_paper":"/paper/2401.04578","citing_paper":"/paper/2505.18458"},"observation_digest":"sha256:6837412782879ce274434f986982626b703ae27396abe1cb574c62934968b857","observation_id":"0d4431bd-4013-4b3e-99c0-dfcc35429797","resolution":{"observed_at":"2026-08-07T14:33:11.026582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04578","last_updated":"2024-03-12T10:35:56Z","snapshot_observed_at":"2026-08-08T17:53:54.646922Z","submitted_at":"2024-01-09T14:32:24Z","title":"Effective pruning of web-scale datasets based on complexity of concept clusters","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04578","snapshot_observed_at":"2026-08-06T23:05:16.387914Z","title":"Effective pruning of web-scale datasets based on complexity of concept clusters","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00049","last_updated":"2025-06-24T22:35:51Z","snapshot_observed_at":"2026-08-06T22:55:40.355679Z","submitted_at":"2025-06-24T22:35:51Z","title":"AdaDeDup: Adaptive Hybrid Data Pruning for Efficient Large-Scale Object Detection Training","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T23:05:16.387914Z"},"links":{"cited_paper":"/paper/2401.04578","citing_paper":"/paper/2507.00049"},"observation_digest":"sha256:7599c2ce2d24dc9b24b31ae2af518254cf363bce8271b02249a46fa49d399623","observation_id":"4b1ab1d7-d169-41db-98aa-fcad646ef059","resolution":{"observed_at":"2026-08-06T23:05:16.387914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04578","last_updated":"2024-03-12T10:35:56Z","snapshot_observed_at":"2026-08-08T17:53:54.646922Z","submitted_at":"2024-01-09T14:32:24Z","title":"Effective pruning of web-scale datasets based on complexity of concept clusters","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04578","snapshot_observed_at":"2026-08-06T17:56:43.267479Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10613","last_updated":"2025-07-13T15:15:24Z","snapshot_observed_at":"2026-08-08T22:32:30.066463Z","submitted_at":"2025-07-13T15:15:24Z","title":"Sub-Scaling Laws: On the Role of Data Density and Training Strategies in LLMs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:43.267479Z"},"links":{"cited_paper":"/paper/2401.04578","citing_paper":"/paper/2507.10613"},"observation_digest":"sha256:dc3571938ef8c58caebf9b4c3c4bb1223885323245b53de99f77671951322e17","observation_id":"8066dc3e-8748-4e57-b3bc-5a27ea86a4ce","resolution":{"observed_at":"2026-08-06T17:56:43.267479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04578","last_updated":"2024-03-12T10:35:56Z","snapshot_observed_at":"2026-08-08T17:53:54.646922Z","submitted_at":"2024-01-09T14:32:24Z","title":"Effective pruning of web-scale datasets based on complexity of concept clusters","version":2},"cited_work":{"arxiv_id":"2401.04578","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.04578","snapshot_observed_at":"2026-07-02T21:17:24.195093Z","title":"Abbas, E","venue":null,"work_id":"5a7a7243-0c3f-45fa-af92-0073221e40f9","year":2024},"citing_paper":{"arxiv_id":"2605.08398","last_updated":"2026-05-29T19:06:27Z","snapshot_observed_at":"2026-08-02T09:24:57.733749Z","submitted_at":"2026-05-08T19:04:33Z","title":"Exploring and Exploiting Stability in Latent Flow Matching","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-12T01:23:17.812123Z"},"links":{"cited_paper":"/paper/2401.04578","citing_paper":"/paper/2605.08398"},"observation_digest":"sha256:cc525e6701f1904deaf23890b9bc5a8b719c80f5d82ad011cd9d6b9e2c8b7d67","observation_id":"b0d61e45-bef0-45f6-9fda-8a2c98910173","resolution":{"observed_at":"2026-05-12T08:01:30.653091Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04578","last_updated":"2024-03-12T10:35:56Z","snapshot_observed_at":"2026-08-08T17:53:54.646922Z","submitted_at":"2024-01-09T14:32:24Z","title":"Effective pruning of web-scale datasets based on complexity of concept clusters","version":2},"cited_work":{"arxiv_id":"2401.04578","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.04578","snapshot_observed_at":"2026-07-02T21:17:24.195093Z","title":"Abbas, E","venue":null,"work_id":"5a7a7243-0c3f-45fa-af92-0073221e40f9","year":2024},"citing_paper":{"arxiv_id":"2605.08398","last_updated":"2026-05-29T19:06:27Z","snapshot_observed_at":"2026-08-02T09:24:57.733749Z","submitted_at":"2026-05-08T19:04:33Z","title":"Exploring and Exploiting Stability in Latent Flow Matching","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-30T22:53:43.702679Z"},"links":{"cited_paper":"/paper/2401.04578","citing_paper":"/paper/2605.08398"},"observation_digest":"sha256:f1e95026890ed4175b83a9dd18e956022d425317281b5afe6f9879691e15547e","observation_id":"d2cf87d8-dcb7-4dc4-be6a-62b08b5553db","resolution":{"observed_at":"2026-07-01T13:35:46.987114Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04578","last_updated":"2024-03-12T10:35:56Z","snapshot_observed_at":"2026-08-08T17:53:54.646922Z","submitted_at":"2024-01-09T14:32:24Z","title":"Effective pruning of web-scale datasets based on complexity of concept clusters","version":2},"cited_work":{"arxiv_id":"2401.04578","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.04578","snapshot_observed_at":"2026-07-02T21:17:24.195093Z","title":"Abbas, E","venue":null,"work_id":"5a7a7243-0c3f-45fa-af92-0073221e40f9","year":2024},"citing_paper":{"arxiv_id":"2606.28551","last_updated":"2026-06-30T20:49:34Z","snapshot_observed_at":"2026-08-02T23:02:11.703134Z","submitted_at":"2026-06-26T19:11:29Z","title":"DataComp-VLM: Improved Open Datasets for Vision-Language Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-30T01:16:16.834861Z"},"links":{"cited_paper":"/paper/2401.04578","citing_paper":"/paper/2606.28551"},"observation_digest":"sha256:76f38081a1a68a09363b05a8f938b08d47d58358b8ce46747d5429f7998df90e","observation_id":"df5a471e-f420-436d-b2d9-0a264d9bd611","resolution":{"observed_at":"2026-07-01T15:35:48.885503Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04578","last_updated":"2024-03-12T10:35:56Z","snapshot_observed_at":"2026-08-08T17:53:54.646922Z","submitted_at":"2024-01-09T14:32:24Z","title":"Effective pruning of web-scale datasets based on complexity of concept clusters","version":2},"cited_work":{"arxiv_id":"2401.04578","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.04578","snapshot_observed_at":"2026-07-02T21:17:24.195093Z","title":"Abbas, E","venue":null,"work_id":"5a7a7243-0c3f-45fa-af92-0073221e40f9","year":2024},"citing_paper":{"arxiv_id":"2606.28551","last_updated":"2026-06-30T20:49:34Z","snapshot_observed_at":"2026-08-02T23:02:11.703134Z","submitted_at":"2026-06-26T19:11:29Z","title":"DataComp-VLM: Improved Open Datasets for Vision-Language Models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-02T21:10:10.548489Z"},"links":{"cited_paper":"/paper/2401.04578","citing_paper":"/paper/2606.28551"},"observation_digest":"sha256:bf685b71d417fb9fd5c40f2c15613103948b2cbdbdc9657911ea9731be9f25a6","observation_id":"1dbb84d9-7d5f-4521-8f1f-2e2488615cc7","resolution":{"observed_at":"2026-07-02T21:17:24.196571Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04578","last_updated":"2024-03-12T10:35:56Z","snapshot_observed_at":"2026-08-08T17:53:54.646922Z","submitted_at":"2024-01-09T14:32:24Z","title":"Effective pruning of web-scale datasets based on complexity of concept clusters","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04578","snapshot_observed_at":"2026-07-12T08:12:18.373103Z","title":"Effective pruning of web-scale datasets based on complexity of concept clusters","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02637","last_updated":"2026-07-02T15:34:46Z","snapshot_observed_at":"2026-08-09T11:44:14.325898Z","submitted_at":"2026-07-02T15:34:46Z","title":"Post-Generation Curation of Synthetic Images via Homogeneous-Heterogeneous Splitting","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-12T08:12:18.373103Z"},"links":{"cited_paper":"/paper/2401.04578","citing_paper":"/paper/2607.02637"},"observation_digest":"sha256:68187325bd3602cbe8fbad3e23c3db65438b65ad61204692f80a0af1b6348728","observation_id":"5102bbca-3efa-42be-ad98-6c3fcb2d8602","resolution":{"observed_at":"2026-07-12T08:12:18.373103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2401.04578/citation-record","integrity":"/paper/2401.04578/integrity","json":"/paper/2401.04578/citation-record.json","paper":"/paper/2401.04578"},"outbound":[],"paper":{"arxiv_id":"2401.04578","last_updated":"2024-03-12T10:35:56Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-08T17:53:54.646922Z","submitted_at":"2024-01-09T14:32:24Z","title":"Effective pruning of web-scale datasets based on complexity of concept clusters"},"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-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 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2401.04578."}