{"as_of":"2026-08-18T11:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c0a4cb5a5b9614198fd0a8040a896fad0dd7eeea15988f0b3522c03fa5f0f6e2","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T21:31:02.042701Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:27:29.801691Z","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-28T22:52:45.615517Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04403","snapshot_observed_at":"2026-08-15T23:27:29.801691Z","title":"Smith, Dirk Groeneveld, Pang Wei Koh, Jesse Dodge, and Hannaneh Hajishirzi","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04592","last_updated":"2025-05-07T17:35:36Z","snapshot_observed_at":"2026-08-17T23:42:59.217553Z","submitted_at":"2025-05-07T17:35:36Z","title":"AI Governance to Avoid Extinction: The Strategic Landscape and Actionable Research Questions","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T23:27:29.801691Z"},"links":{"cited_paper":"/paper/2412.04403","citing_paper":"/paper/2505.04592"},"observation_digest":"sha256:3d58cfb17636d6ec50f8253ea8fd58a2492b0814b816f259b9b380a5904f01c5","observation_id":"cb403640-2ce5-4081-9f6f-107852f19626","resolution":{"observed_at":"2026-08-15T23:27:29.801691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04403","snapshot_observed_at":"2026-08-06T16:53:08.432070Z","title":"Establishing task scaling laws via compute-efficient model ladders","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12466","last_updated":"2025-07-16T17:59:45Z","snapshot_observed_at":"2026-08-16T18:06:02.995315Z","submitted_at":"2025-07-16T17:59:45Z","title":"Language Models Improve When Pretraining Data Matches Target Tasks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T16:53:08.432070Z"},"links":{"cited_paper":"/paper/2412.04403","citing_paper":"/paper/2507.12466"},"observation_digest":"sha256:91beec77cb68b3c58d12f085f3afa383a9e2ae67ab508164ac054d4c67d81755","observation_id":"97a117fd-7c64-48dd-ae6a-abf22d818adc","resolution":{"observed_at":"2026-08-06T16:53:08.432070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04403","snapshot_observed_at":"2026-08-15T17:21:06.610860Z","title":"Estab- lishing task scaling laws via compute-efficient model ladders","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.13144","last_updated":"2025-08-18T17:56:04Z","snapshot_observed_at":"2026-08-18T03:59:35.024516Z","submitted_at":"2025-08-18T17:56:04Z","title":"Signal and Noise: A Framework for Reducing Uncertainty in Language Model Evaluation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T17:21:06.610860Z"},"links":{"cited_paper":"/paper/2412.04403","citing_paper":"/paper/2508.13144"},"observation_digest":"sha256:1b8d41924d1670151e85f4fa7670a0780622b84eacc3e3da4d5c6b47037953a8","observation_id":"a3c03f77-dfbd-46e9-b42f-b5aad8f57ab6","resolution":{"observed_at":"2026-08-15T17:21:06.610860Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04403","snapshot_observed_at":"2026-08-05T11:59:49.489653Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.02046","last_updated":"2025-09-04T19:22:04Z","snapshot_observed_at":"2026-08-18T07:20:56.759709Z","submitted_at":"2025-09-02T07:43:22Z","title":"Fantastic Pretraining Optimizers and Where to Find Them","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T11:59:49.489653Z"},"links":{"cited_paper":"/paper/2412.04403","citing_paper":"/paper/2509.02046"},"observation_digest":"sha256:7273d74b777e637e75a80d1169d0109089cb1c0e6ac201091ce249a65a415a5a","observation_id":"1d11fb19-e8aa-4322-9002-dfbe59ac2e34","resolution":{"observed_at":"2026-08-05T11:59:49.489653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04403","snapshot_observed_at":"2026-08-03T18:13:09.333420Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.06553","last_updated":"2026-06-02T19:03:16Z","snapshot_observed_at":"2026-08-04T04:27:19.877522Z","submitted_at":"2025-12-06T19:49:31Z","title":"A Latent Variable Framework for Scaling Laws in Large Language Models","version":2},"reference_index":465,"source":"pdf_text","source_observed_at":"2026-08-03T18:13:09.333420Z"},"links":{"cited_paper":"/paper/2412.04403","citing_paper":"/paper/2512.06553"},"observation_digest":"sha256:72062cd3cc88ba58d6aadfb791da57341a1bb0a090db962d4a46fce8322593ed","observation_id":"e7c5254a-50c8-433f-b9fa-d8854e7fd5d5","resolution":{"observed_at":"2026-08-03T18:13:09.333420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"cited_work":{"arxiv_id":"2412.04403","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04403","snapshot_observed_at":"2026-06-28T22:52:45.615517Z","title":"H., Soldaini, L., Smith, N","venue":null,"work_id":"57471809-6089-4c49-a638-6bd9f3860a4e","year":2024},"citing_paper":{"arxiv_id":"2603.08022","last_updated":"2026-05-06T03:36:45Z","snapshot_observed_at":"2026-08-12T13:46:02.406167Z","submitted_at":"2026-03-09T06:58:00Z","title":"Capacity-Aware Mixture Law Enables Efficient LLM Data Optimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-15T14:23:30.849350Z"},"links":{"cited_paper":"/paper/2412.04403","citing_paper":"/paper/2603.08022"},"observation_digest":"sha256:e48288c322411d02805c62f136f540c488b09f1e1afcda6e07f4512be6a18609","observation_id":"7daa418d-d705-46a6-930b-d433f88748dd","resolution":{"observed_at":"2026-05-15T14:25:55.403333Z","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":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"cited_work":{"arxiv_id":"2412.04403","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04403","snapshot_observed_at":"2026-06-28T22:52:45.615517Z","title":"H., Soldaini, L., Smith, N","venue":null,"work_id":"57471809-6089-4c49-a638-6bd9f3860a4e","year":2024},"citing_paper":{"arxiv_id":"2604.21215","last_updated":"2026-04-23T02:12:58Z","snapshot_observed_at":"2026-08-13T18:25:58.484752Z","submitted_at":"2026-04-23T02:12:58Z","title":"The Recurrent Transformer: Greater Effective Depth and Efficient Decoding","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-09T22:03:35.260373Z"},"links":{"cited_paper":"/paper/2412.04403","citing_paper":"/paper/2604.21215"},"observation_digest":"sha256:bdb7aa26f3a24613cbe6f55d2286f25891ceeb7783bdb0c39c7a23594a25f474","observation_id":"2fa7a170-9867-4a97-80e2-d46d4f9129be","resolution":{"observed_at":"2026-05-11T14:21:04.595703Z","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":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"cited_work":{"arxiv_id":"2412.04403","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04403","snapshot_observed_at":"2026-06-28T22:52:45.615517Z","title":"H., Soldaini, L., Smith, N","venue":null,"work_id":"57471809-6089-4c49-a638-6bd9f3860a4e","year":2024},"citing_paper":{"arxiv_id":"2604.24416","last_updated":"2026-04-27T12:45:18Z","snapshot_observed_at":"2026-08-16T23:04:20.752839Z","submitted_at":"2026-04-27T12:45:18Z","title":"Scaling Properties of Continuous Diffusion Spoken Language Models","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-05-08T03:43:10.132447Z"},"links":{"cited_paper":"/paper/2412.04403","citing_paper":"/paper/2604.24416"},"observation_digest":"sha256:ce4a76acad25444885e491a403880c69d7798994a186c32ce36be7dafe35a018","observation_id":"7828b7e3-8b76-42cf-ab7f-3ca783f1a8c2","resolution":{"observed_at":"2026-05-11T21:56:27.353396Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"cited_work":{"arxiv_id":"2412.04403","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04403","snapshot_observed_at":"2026-06-28T22:52:45.615517Z","title":"H., Soldaini, L., Smith, N","venue":null,"work_id":"57471809-6089-4c49-a638-6bd9f3860a4e","year":2024},"citing_paper":{"arxiv_id":"2606.07616","last_updated":"2026-05-29T20:55:15Z","snapshot_observed_at":"2026-07-06T23:47:15.041928Z","submitted_at":"2026-05-29T20:55:15Z","title":"Item Response Scaling Laws: A Measurement Theory Approach for Efficient and Generalizable Neural Scaling Estimation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T22:48:20.193699Z"},"links":{"cited_paper":"/paper/2412.04403","citing_paper":"/paper/2606.07616"},"observation_digest":"sha256:4944bede3b3ac26710c398ce0a6dffd75999d17549981dbf77f3a44f4d1eba2b","observation_id":"80f229ed-6d8d-408f-9983-2551c1d75d10","resolution":{"observed_at":"2026-06-28T22:52:45.616723Z","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":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04403","snapshot_observed_at":"2026-07-11T07:57:43.000834Z","title":"Smith, Dirk Groeneveld, Pang Wei Koh, Jesse Dodge, and Hannaneh Hajishirzi","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.05155","last_updated":"2026-07-06T14:39:22Z","snapshot_observed_at":"2026-08-16T06:48:52.700573Z","submitted_at":"2026-07-06T14:39:22Z","title":"EdgeBench: Unveiling Scaling Laws of Learning from Real-World Environments","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T07:57:43.000834Z"},"links":{"cited_paper":"/paper/2412.04403","citing_paper":"/paper/2607.05155"},"observation_digest":"sha256:ae13a42c340ee9ac0f95e799ac8d54fecf81e324007e87cdc6b286deb1697480","observation_id":"b178965b-c5bf-4417-a2ba-00ad557826a1","resolution":{"observed_at":"2026-07-11T07:57:43.000834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.04403/citation-record","integrity":"/paper/2412.04403/integrity","json":"/paper/2412.04403/citation-record.json","paper":"/paper/2412.04403"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:03.077066Z","title":"Olmo 2: The best fully open language model to date, 2024","venue":null,"work_id":"9eba005a-cf41-4ad2-a92c-83f8a04ff274","year":2024},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.732234Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:3ddefc4d2a6e5f3b74ecb2e631f5089859db987f79daed89c503eeeea5c79b19","observation_id":"3e63acb0-638d-4ef7-bf99-847255bb5ab4","resolution":{"observed_at":"2026-08-11T21:31:03.094962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-08-09T21:25:20.369782Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-11T21:31:01.738227Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.738227Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:ae7e1df6a5c00e056f5c89382e63a135c6f292bbca1a014503d89d4e1dbdc560","observation_id":"813a028c-1fb1-4491-b69d-09aa0c0d22db","resolution":{"observed_at":"2026-08-11T21:31:01.738227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:01.743766Z","title":"PIQA : Reasoning about physical commonsense in natural language","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.743766Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:91869a4d17d58319e4948903933ce7274c898e82687280b7f91923aaa2a203c8","observation_id":"4ec3fa94-3592-45d1-b79c-f26b1fd308be","resolution":{"observed_at":"2026-08-11T21:31:01.743766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:03.030848Z","title":"Scaling laws for predicting downstream performance in llms","venue":null,"work_id":"a88fc860-6d1d-456d-aba7-386a82e7ee75","year":2024},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.749838Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:85bb590cad2c87a488fbf457c9acb4e539d5cbc1c0e6e44b00fab1da4cf6741f","observation_id":"fb6f9fc8-253c-4f41-a846-c726d2f7a924","resolution":{"observed_at":"2026-08-11T21:31:03.044370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:01.758801Z","title":"B ool Q : Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.758801Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:e7723981a71c9edba362b89bccde7a68793bf3936fce093d419d0ed678b28e85","observation_id":"f3e2b2e8-8a69-4e14-891c-40c1c1a4cb81","resolution":{"observed_at":"2026-08-11T21:31:01.758801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-08-14T19:36:07.505691Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-11T21:31:01.779121Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.779121Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:ef32a2b827fbd6b1534dfaa28334e1f71f729e870c279eb0bc6180d0d3af3e22","observation_id":"d9551b80-c7aa-40d5-acb9-9fe23bf1ef32","resolution":{"observed_at":"2026-08-11T21:31:01.779121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-11T21:31:01.785740Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.785740Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:3e07d3430d2ff589951097860311db560ad3f4c827ccea2baabc60f96ff662bd","observation_id":"655255f2-0bde-405a-8988-ce163707ec96","resolution":{"observed_at":"2026-08-11T21:31:01.785740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.08540","last_updated":"2024-06-14T20:21:05Z","snapshot_observed_at":"2026-08-16T14:10:11.362149Z","submitted_at":"2024-03-13T13:54:00Z","title":"Language models scale reliably with over-training and on downstream tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.08540","snapshot_observed_at":"2026-08-11T21:31:01.797350Z","title":"Dimakis, Gabriel Ilharco, Shuran Song, Thomas Kollar, Yair Carmon, Achal Dave, Reinhard Heckel, Niklas Muennighoff, and Ludwig Schmidt","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.797350Z"},"links":{"cited_paper":"/paper/2403.08540","citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:f36d2d2fcd286b2b505039f73ac503b1368e563d359ff842db7ffd3a55e503d5","observation_id":"d16f232d-b54a-40ee-98aa-39589b1dfd6c","resolution":{"observed_at":"2026-08-11T21:31:01.797350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:01.814936Z","title":"Olmes: A standard for language model evaluations, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.814936Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:c20e70df137d85f7bb7cd584da3ebf2399eaa8b4d5ce7ac71c246b6e55ba91e2","observation_id":"68b98dda-ea51-42f5-9d14-7b5d6a271776","resolution":{"observed_at":"2026-08-11T21:31:01.814936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:01.823503Z","title":"Measuring massive multitask language understanding","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.823503Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:314dd3eb98b0bcdf726a66f130ed423417f050c93e3ec10f4b0e9b20dd49fa4f","observation_id":"c84e7222-7952-4f0f-af18-f23caa1ddc17","resolution":{"observed_at":"2026-08-11T21:31:01.823503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15556","last_updated":"2022-03-29T13:38:03Z","snapshot_observed_at":"2026-08-09T19:52:33.533277Z","submitted_at":"2022-03-29T13:38:03Z","title":"Training Compute-Optimal Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15556","snapshot_observed_at":"2026-08-11T21:31:01.835814Z","title":"Rae, Oriol Vinyals, and L","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.835814Z"},"links":{"cited_paper":"/paper/2203.15556","citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:b9f9e5a526b15b3fcd4c3e1950192c038fae3833d05a487f50e1f05f79f846f8","observation_id":"b27f4816-4c45-4f0a-89ed-903831513a44","resolution":{"observed_at":"2026-08-11T21:31:01.835814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:02.966661Z","title":"Predicting emergent abilities with infinite resolution evaluation","venue":null,"work_id":"b84f6ba9-5b9e-4302-bd99-59ba8feed44a","year":2023},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.859891Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:4a5845012a7dd75e90e0de9e2e1ef7bbdd0fc9ede1f06cfb2bffc693cc18014b","observation_id":"4c007da5-80e6-4059-8f4e-fa41b34cdecb","resolution":{"observed_at":"2026-08-11T21:31:02.975949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-08-13T17:41:53.092611Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-11T21:31:01.868880Z","title":"Brown, Benjamin Chess, Rewon Child, Scott Gray, Alec Radford, Jeff Wu, and Dario Amodei","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.868880Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:965b36bb3de453ba02c3e042a8d24de9e203e0ebc8768375ab8a409b8967a7ad","observation_id":"28e1c326-497a-48ce-99da-16f86eeb7f26","resolution":{"observed_at":"2026-08-11T21:31:01.868880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11794","snapshot_observed_at":"2026-08-11T21:31:01.877000Z","title":"Kakade, Shuran Song, Sujay Sanghavi, Fartash Faghri, Sewoong Oh, Luke S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.877000Z"},"links":{"cited_paper":"/paper/2406.11794","citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:bc3169858d6e4d4f7e53996f9d1ce39c686400ff30b9398ddd936574d2923b4a","observation_id":"5e69c7b5-45a6-46aa-85a2-fc1859f1da4d","resolution":{"observed_at":"2026-08-11T21:31:01.877000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:01.895171Z","title":"Can a suit of armor conduct electricity? a new dataset for open book question answering","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.895171Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:3715d649dd9e20fedabda04ec0259c32068e680efb0d8fae0ad1145b68c6aade","observation_id":"876f2d1f-dba1-4639-a0e8-a7fa23960dbc","resolution":{"observed_at":"2026-08-11T21:31:01.895171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:02.937332Z","title":"Llm foundry, 2024","venue":null,"work_id":"5e5a13e3-b538-47c7-9a26-3cf97472be6d","year":2024},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.901081Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:722d62a0b61dccdc2497edb2e65a99f6661f752e6fcc3e0eea1647f6aeeefac0","observation_id":"b7bc0f52-58fa-42f9-80cd-21dd8f5db9f2","resolution":{"observed_at":"2026-08-11T21:31:02.945213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2305.16264","last_updated":"2025-06-28T00:00:06Z","snapshot_observed_at":"2026-08-08T06:18:27.640980Z","submitted_at":"2023-05-25T17:18:55Z","title":"Scaling Data-Constrained Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16264","snapshot_observed_at":"2026-08-11T21:31:01.909295Z","title":"Rush, Boaz Barak, Teven Le Scao, Aleksandra Piktus, Nouamane Tazi, Sampo Pyysalo, Thomas Wolf, and Colin Raffel","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.909295Z"},"links":{"cited_paper":"/paper/2305.16264","citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:530a9061d0c2dfdfda96caa2f4e2dc563fee145bf70226b444a80ca182daf778","observation_id":"8131b418-1f2d-40e0-9743-4ffcdf7ef1d3","resolution":{"observed_at":"2026-08-11T21:31:01.909295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19146","last_updated":"2025-01-19T10:34:08Z","snapshot_observed_at":"2026-08-16T13:39:05.282413Z","submitted_at":"2024-06-27T13:02:43Z","title":"Resolving Discrepancies in Compute-Optimal Scaling of Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.19146","snapshot_observed_at":"2026-08-11T21:31:01.919455Z","title":"Resolving discrepancies in compute-optimal scaling of language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.919455Z"},"links":{"cited_paper":"/paper/2406.19146","citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:7eb4dc07a150232574bc0811a1877e9a0b17ed8ac04bb60e761b8b4d0ca5e1bb","observation_id":"048d7588-4cbb-4b7a-8788-fa3b0fe28b2d","resolution":{"observed_at":"2026-08-11T21:31:01.919455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:02.898956Z","title":"Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi Zhou, Wei Li, and Peter J","venue":null,"work_id":"c12fb6af-f418-449f-b595-4c5d89db029e","year":2019},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.927769Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:7f83f43b1339a3935c375445612f8050224cbdbc897a888b863c663fd2d4e86a","observation_id":"72446ab2-503e-4c91-b0ee-bd77d809f35b","resolution":{"observed_at":"2026-08-11T21:31:02.905373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:01.952847Z","title":"Wino G rande: An adversarial winograd schema challenge at scale","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.952847Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:4aef31881b4442c7923383013cc190e68db67b6acda87072c7f8af9088529bf8","observation_id":"af09e181-04ac-4474-a65e-761a09113bc7","resolution":{"observed_at":"2026-08-11T21:31:01.952847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:01.961373Z","title":"Social IQ a: Commonsense reasoning about social interactions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.961373Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:ef95661898df3a3dc2c2e3441b98110d15dbeb78c2a2e961bc7e84214ff78dbe","observation_id":"97b38224-b638-4c9d-a2df-fa8e43551788","resolution":{"observed_at":"2026-08-11T21:31:01.961373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:02.874640Z","title":"Why has predicting downstream capabilities of frontier AI models with scale remained elusive? In Trustworthy Multi-modal Foundation Models and AI Agents (TiFA), 2024","venue":null,"work_id":"e3d4a2c2-19d8-4e84-a171-38444bafaa1b","year":2024},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.970858Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:db1788ed52e994828e74ff16897e1de74247efa6f3f4e5c86ac3c361fd620587","observation_id":"72677520-69ca-483a-b8bb-774ea706cc88","resolution":{"observed_at":"2026-08-11T21:31:02.885884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:01.983973Z","title":"C ommonsense QA : A question answering challenge targeting commonsense knowledge","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.983973Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:11ee77fb0e7142b0da09d70c8ccbc56cad294adec6128656981fa30a0ac6a084","observation_id":"e50f306f-8d11-4829-8d04-af60638dd1d3","resolution":{"observed_at":"2026-08-11T21:31:01.983973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:01.992177Z","title":"H ella S wag: Can a machine really finish your sentence? pp.\\ 4791--4800, Florence, Italy, July 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:01.992177Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:312eeae5d242d39037ad0aebf6967a762c7f3fc2d6fb3ecf0c5baeb1f45820e8","observation_id":"5a53a98c-0754-40c5-9030-131c689b7a65","resolution":{"observed_at":"2026-08-11T21:31:01.992177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19327","last_updated":"2024-07-10T16:55:47Z","snapshot_observed_at":"2026-08-16T13:48:04.075163Z","submitted_at":"2024-05-29T17:57:16Z","title":"MAP-Neo: Highly Capable and Transparent Bilingual Large Language Model Series","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19327","snapshot_observed_at":"2026-08-11T21:31:02.003853Z","title":"Map-neo: Highly capable and transparent bilingual large language model series","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:02.003853Z"},"links":{"cited_paper":"/paper/2405.19327","citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:9dce811fc400bbbf53acdcb751114226c31e6bf7b19019a5ec8b60a1c367f1a0","observation_id":"968d3453-66da-4e4d-9d2c-2c37f1aea8ef","resolution":{"observed_at":"2026-08-11T21:31:02.003853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:02.012206Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:02.012206Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:7685ad00ef07b615f374aa118538afa293e16fc41054ef1cacded2858bd97776","observation_id":"d25a3acb-839e-4efa-8f16-1454ea497bf6","resolution":{"observed_at":"2026-08-11T21:31:02.012206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:02.023540Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:02.023540Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:724f36f9b5f145e87773ea7f77e2cba1de155719c70cb66736304370079f3e7e","observation_id":"e6f81f64-9832-48d6-9665-06b440bb1529","resolution":{"observed_at":"2026-08-11T21:31:02.023540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:02.035946Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:02.035946Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:82eebcf32660e7694293011a3a541165e72f1b24f15c228dc0da6472d7538988","observation_id":"340dacc6-d0ca-4143-8a3b-60eec42ba2e4","resolution":{"observed_at":"2026-08-11T21:31:02.035946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:31:02.042701Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T21:31:02.042701Z"},"links":{"citing_paper":"/paper/2412.04403"},"observation_digest":"sha256:74519ebce7d2216b3f2391c64ef3a5e392a4195151b6fd1d62ceca5766c1c27b","observation_id":"9d9dbb2c-f2cc-41f9-804b-fa3486993774","resolution":{"observed_at":"2026-08-11T21:31:02.042701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.04403","last_updated":"2025-08-22T17:27:09Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-17T15:54:07.298847Z","submitted_at":"2024-12-05T18:21:49Z","title":"Establishing Task Scaling Laws via Compute-Efficient Model Ladders"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":6},"total_outbound_references":29},"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 29 of 29 outbound references and 10 inbound Pith citation observations for arXiv:2412.04403."}