{"as_of":"2026-08-05T20:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3def68ea956ebb664643548e6c1199a4c61fa2ce395d91a75dbcc9c917b91649","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T08:12:18.373103Z","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-07-06T17:13:17.263599Z","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:c05a7a38b9943a2f8af02a641335961e2e16187196c04f6f4e930acbea3c7b74","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-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-06T17:13:17.263599Z","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:c019ae39a20b386225e5d604fc2ebffc9356cae6360886f581db87781b1a1ae0","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-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-06T17:13:17.263599Z","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:12f333b95165ae84694314dc1a10a7b7e8126735b5373dd4cfc3aae3e6466a76","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-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-06T17:13:17.263599Z","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:e0927cb5b8422b11f5df54ccc1de5e2bbe3780c154a20f55544b36f005c4f2dd","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-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-06T17:13:17.263599Z","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-02T18:06:42.028681Z","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:a271106fc2a9357a2b84061bd9e7d5d6213c5363374c7e8d80d3dac1025c9ffc","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-07-06T17:13:17.263599Z","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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2401.04578."}