{"as_of":"2026-08-09T21:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0561eb44f0f43445ac9e541f1ee5e6d8a2785a2d856fbf2928188fb95180ccf9","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:52:07.511745Z","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-05-20T14:03:20.499861Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":"2304.08442","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The minipile challenge for data-efficient language models","venue":null,"work_id":"3f8d2f1e-dbbb-4db4-aded-91e94244e2ca","year":2023},"citing_paper":{"arxiv_id":"2406.11794","last_updated":"2025-04-21T17:48:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-06-17T17:42:57Z","title":"DataComp-LM: In search of the next generation of training sets for language models","version":4},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-05-17T22:58:16.523267Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2406.11794"},"observation_digest":"sha256:8e5ab5c4ed5c6b5a5d69e314e85c71d5351564c5759b8520efacd89b8e9f8f13","observation_id":"ed6fd1fb-cf23-465d-a8f6-d8ba531c2c82","resolution":{"observed_at":"2026-05-17T22:58:17.035055Z","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":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-08-08T14:52:07.511745Z","title":"The minipile challenge for data-efficient language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06643","last_updated":"2025-02-10T16:34:36Z","snapshot_observed_at":"2026-08-09T20:43:08.168062Z","submitted_at":"2025-02-10T16:34:36Z","title":"MoETuner: Optimized Mixture of Expert Serving with Balanced Expert Placement and Token Routing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T14:52:07.511745Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2502.06643"},"observation_digest":"sha256:7afffd02eccbc96c919ef42355e3ccb9e00ecac7d297814c24e5bbb13417f7bc","observation_id":"fb9a4ed6-9ec1-47c4-a061-9f419192f01c","resolution":{"observed_at":"2026-08-08T14:52:07.511745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-08-07T13:54:45.649233Z","title":"The minipile challenge for data-efficient language models.arXiv preprint arXiv:2304.08442,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20698","last_updated":"2025-05-27T04:07:23Z","snapshot_observed_at":"2026-08-09T20:42:35.268317Z","submitted_at":"2025-05-27T04:07:23Z","title":"Sparsified State-Space Models are Efficient Highway Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:54:45.649233Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2505.20698"},"observation_digest":"sha256:095e2ce3ae901ea5ce162807c53e23fd30c04ce44658a8361f0fdb65e4e5f8ce","observation_id":"7ee45e5a-4790-48c3-9e16-75edeca7d294","resolution":{"observed_at":"2026-08-07T13:54:45.649233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-08-07T13:09:59.498544Z","title":"The minipile challenge for data-efficient language models.arXiv preprint arXiv:2304.08442, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23844","last_updated":"2025-05-28T16:24:50Z","snapshot_observed_at":"2026-08-09T20:58:51.092258Z","submitted_at":"2025-05-28T16:24:50Z","title":"Enabling Flexible Multi-LLM Integration for Scalable Knowledge Aggregation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:09:59.498544Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2505.23844"},"observation_digest":"sha256:d7607f9bfd3ce47728f70677907b0e940a1522a4a7dfbb9e736d89d1dedc831e","observation_id":"05fcb154-0386-485f-ba5a-f8a97e565261","resolution":{"observed_at":"2026-08-07T13:09:59.498544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-08-07T11:15:42.992139Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03149","last_updated":"2025-06-03T17:59:47Z","snapshot_observed_at":"2026-08-09T03:37:08.646108Z","submitted_at":"2025-06-03T17:59:47Z","title":"Causal Estimation of Tokenisation Bias","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T11:15:42.992139Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2506.03149"},"observation_digest":"sha256:bd1b6805c3b43fc907abb80c0dfe04f05557378c319f4b9ca77546d2845d3e3a","observation_id":"dc16a7db-3828-4ed7-92ae-c9be9a81ac67","resolution":{"observed_at":"2026-08-07T11:15:42.992139Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-08-06T23:20:52.816970Z","title":"The M ini P ile challenge for data-efficient language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.18639","last_updated":"2025-06-23T13:42:00Z","snapshot_observed_at":"2026-08-09T13:45:17.794658Z","submitted_at":"2025-06-23T13:42:00Z","title":"ByteSpan: Information-Driven Subword Tokenisation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T23:20:52.816970Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2506.18639"},"observation_digest":"sha256:c85b2db24537d3532a5339b6b3c43cd0b3df856db11eb0c8ffaa40f00a787b56","observation_id":"a69bde22-87cd-4b7b-9563-486cfafb349e","resolution":{"observed_at":"2026-08-06T23:20:52.816970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-08-06T17:20:26.663156Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.11273","last_updated":"2025-07-15T12:52:12Z","snapshot_observed_at":"2026-08-08T10:53:21.517764Z","submitted_at":"2025-07-15T12:52:12Z","title":"KV-Latent: Dimensional-level KV Cache Reduction with Frequency-aware Rotary Positional Embedding","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T17:20:26.663156Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2507.11273"},"observation_digest":"sha256:46290bc31f9c9c5bd6c06f7407495863aa38357cf019f22e2981923dec1be157","observation_id":"f96c99fe-5eda-4be2-9f39-2bc3de2d429d","resolution":{"observed_at":"2026-08-06T17:20:26.663156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-08-06T17:04:35.614370Z","title":"The minipile challenge for data-efficient lan- guage models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.12022","last_updated":"2025-07-16T08:30:30Z","snapshot_observed_at":"2026-08-08T06:59:23.614719Z","submitted_at":"2025-07-16T08:30:30Z","title":"Dataset Ownership Verification for Pre-trained Masked Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:35.614370Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2507.12022"},"observation_digest":"sha256:0da058938b0fab5a42dc714482e84e85edc1913cf36493630d69b2d0694312aa","observation_id":"e32e8cf1-5355-4bbf-8076-3d0e8174fe62","resolution":{"observed_at":"2026-08-06T17:04:35.614370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":"2304.08442","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The minipile challenge for data-efficient language models","venue":null,"work_id":"3f8d2f1e-dbbb-4db4-aded-91e94244e2ca","year":2023},"citing_paper":{"arxiv_id":"2604.05192","last_updated":"2026-04-06T21:43:48Z","snapshot_observed_at":"2026-08-07T07:27:45.035220Z","submitted_at":"2026-04-06T21:43:48Z","title":"Faster Superword Tokenization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T18:51:20.043728Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2604.05192"},"observation_digest":"sha256:f470493a122e3b7b640dff46497680375651c14c3008aa9811c2bb3a83534a51","observation_id":"ff07b9ad-9655-48f1-862f-f70633ea58ac","resolution":{"observed_at":"2026-05-10T23:50:52.364277Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":"2304.08442","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The minipile challenge for data-efficient language models","venue":null,"work_id":"3f8d2f1e-dbbb-4db4-aded-91e94244e2ca","year":2023},"citing_paper":{"arxiv_id":"2604.25409","last_updated":"2026-04-28T09:22:43Z","snapshot_observed_at":"2026-08-02T13:56:50.889566Z","submitted_at":"2026-04-28T09:22:43Z","title":"Scaling Probabilistic Transformer via Efficient Cross-Scale Hyperparameter Transfer","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-07T16:31:33.619232Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2604.25409"},"observation_digest":"sha256:c458a48ae9e59dd8716af70192c4f2f48486050c105d86abb1d0fbab79e8d333","observation_id":"12e9c6f7-2127-4056-bb17-b3408965877c","resolution":{"observed_at":"2026-05-11T23:41:16.118183Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":"2304.08442","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The minipile challenge for data-efficient language models","venue":null,"work_id":"3f8d2f1e-dbbb-4db4-aded-91e94244e2ca","year":2023},"citing_paper":{"arxiv_id":"2605.17653","last_updated":"2026-05-17T21:10:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-17T21:10:54Z","title":"LLMForge: Multi-Backend Hardware-Aware Neural Architecture Search with Infinite-Head Attention for Edge Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-20T13:58:55.899958Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2605.17653"},"observation_digest":"sha256:945c32f24d6239bb63930158d3817e7c99486d28bcb96469df684ed818c67080","observation_id":"98073453-e083-40c0-afba-e9e15e0897d5","resolution":{"observed_at":"2026-05-20T14:03:20.502894Z","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":"2304.08442","last_updated":"2023-04-17T17:03:56Z","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08442","snapshot_observed_at":"2026-07-31T23:47:05.969487Z","title":"Violeta Kastreva, Philip Whittington, Dennis Komm, and Tiago Pimentel","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23362","last_updated":"2026-07-25T21:01:14Z","snapshot_observed_at":"2026-08-09T05:28:37.742931Z","submitted_at":"2026-07-25T21:01:14Z","title":"Joint Optimization for Greedy Longest-match Tokenization","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-07-31T23:47:05.969487Z"},"links":{"cited_paper":"/paper/2304.08442","citing_paper":"/paper/2607.23362"},"observation_digest":"sha256:477cd6cc87fb7db5596663f5bdeb8e0f464135900f28dc294bf77532650107b5","observation_id":"5414b1d7-748e-44f5-81c1-a6a9601f70c5","resolution":{"observed_at":"2026-07-31T23:47:05.969487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2304.08442/citation-record","integrity":"/paper/2304.08442/integrity","json":"/paper/2304.08442/citation-record.json","paper":"/paper/2304.08442"},"outbound":[],"paper":{"arxiv_id":"2304.08442","last_updated":"2023-04-17T17:03:56Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T20:42:25.574104Z","submitted_at":"2023-04-17T17:03:56Z","title":"The MiniPile Challenge for Data-Efficient Language Models"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2304.08442."}