{"as_of":"2026-08-09T07:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:469c78f7a86f6909694fe32e9c11f2a347dfa98e56b70133ca578c1abbb69a2a","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T16:32:36.445245Z","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-02T12:46:56.684221Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.01505","last_updated":"2024-12-02T13:58:35Z","snapshot_observed_at":"2026-08-09T03:34:22.901333Z","submitted_at":"2024-12-02T13:58:35Z","title":"Scaling Law for Language Models Training Considering Batch Size","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.01505","snapshot_observed_at":"2026-08-04T16:32:36.445245Z","title":"Scaling law for language models training considering batch size, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.14026","last_updated":"2026-07-06T11:24:08Z","snapshot_observed_at":"2026-08-07T08:29:53.256830Z","submitted_at":"2025-09-17T14:28:42Z","title":"Quantum Variational Activation Functions Empower Kolmogorov-Arnold Networks","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-04T16:32:36.445245Z"},"links":{"cited_paper":"/paper/2412.01505","citing_paper":"/paper/2509.14026"},"observation_digest":"sha256:97148fb6606ab53cf792e2c0c2066e3ee6014e93a8db3a09a1f30524639550a4","observation_id":"869ddff4-527a-4e3a-9008-c386733890e3","resolution":{"observed_at":"2026-08-04T16:32:36.445245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01505","last_updated":"2024-12-02T13:58:35Z","snapshot_observed_at":"2026-08-09T03:34:22.901333Z","submitted_at":"2024-12-02T13:58:35Z","title":"Scaling Law for Language Models Training Considering Batch Size","version":1},"cited_work":{"arxiv_id":"2412.01505","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.01505","snapshot_observed_at":"2026-07-02T12:46:56.684221Z","title":"arXiv preprint arXiv:2412.01505 , year=","venue":null,"work_id":"0c09e4df-98c3-4428-81c3-7486c44125ab","year":2025},"citing_paper":{"arxiv_id":"2605.24316","last_updated":"2026-06-25T06:26:55Z","snapshot_observed_at":"2026-08-01T14:56:15.713802Z","submitted_at":"2026-05-23T00:48:36Z","title":"From One-Pass SGD to Data Reuse: Mini-Batch Scaling Laws in Sketched Linear Regression","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T14:09:52.456340Z"},"links":{"cited_paper":"/paper/2412.01505","citing_paper":"/paper/2605.24316"},"observation_digest":"sha256:13648d44d7185e7e159295db71c6d9daa0af0f9cb5b67a9944128451e411bc55","observation_id":"99d29ae3-99d8-452c-8362-2ea5a7585d98","resolution":{"observed_at":"2026-06-30T14:14:45.577224Z","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":"2412.01505","last_updated":"2024-12-02T13:58:35Z","snapshot_observed_at":"2026-08-09T03:34:22.901333Z","submitted_at":"2024-12-02T13:58:35Z","title":"Scaling Law for Language Models Training Considering Batch Size","version":1},"cited_work":{"arxiv_id":"2412.01505","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.01505","snapshot_observed_at":"2026-07-02T12:46:56.684221Z","title":"arXiv preprint arXiv:2412.01505 , year=","venue":null,"work_id":"0c09e4df-98c3-4428-81c3-7486c44125ab","year":2025},"citing_paper":{"arxiv_id":"2605.24326","last_updated":"2026-05-23T01:11:19Z","snapshot_observed_at":"2026-07-06T23:34:23.087565Z","submitted_at":"2026-05-23T01:11:19Z","title":"ScaleAcross Explorer: Exploring Communication Optimization for Scale-Across AI Model Training","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-30T12:57:37.344369Z"},"links":{"cited_paper":"/paper/2412.01505","citing_paper":"/paper/2605.24326"},"observation_digest":"sha256:0f0743ed49be651e41d3dc2bc81f519c9f6cc0aaf051b37cfe0efbcf98a91626","observation_id":"962af652-e9c5-4de7-b59c-4b218db666b1","resolution":{"observed_at":"2026-06-30T13:04:40.480399Z","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":"2412.01505","last_updated":"2024-12-02T13:58:35Z","snapshot_observed_at":"2026-08-09T03:34:22.901333Z","submitted_at":"2024-12-02T13:58:35Z","title":"Scaling Law for Language Models Training Considering Batch Size","version":1},"cited_work":{"arxiv_id":"2412.01505","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.01505","snapshot_observed_at":"2026-07-02T12:46:56.684221Z","title":"arXiv preprint arXiv:2412.01505 , year=","venue":null,"work_id":"0c09e4df-98c3-4428-81c3-7486c44125ab","year":2025},"citing_paper":{"arxiv_id":"2606.05610","last_updated":"2026-06-04T02:32:11Z","snapshot_observed_at":"2026-07-06T23:45:33.157370Z","submitted_at":"2026-06-04T02:32:11Z","title":"Predictable Scaling Laws of Optimal Hyperparameters for LLM Continued Pre-training","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-28T01:53:04.715108Z"},"links":{"cited_paper":"/paper/2412.01505","citing_paper":"/paper/2606.05610"},"observation_digest":"sha256:5dce046e1f8766874d1dbe28e7331f7fafa93b2b3551b7e8fa97f75f1d60c529","observation_id":"472b2b92-66de-4991-ab47-1513c428e5ec","resolution":{"observed_at":"2026-07-02T12:46:56.685662Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2412.01505/citation-record","integrity":"/paper/2412.01505/integrity","json":"/paper/2412.01505/citation-record.json","paper":"/paper/2412.01505"},"outbound":[],"paper":{"arxiv_id":"2412.01505","last_updated":"2024-12-02T13:58:35Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T03:34:22.901333Z","submitted_at":"2024-12-02T13:58:35Z","title":"Scaling Law for Language Models Training Considering Batch Size"},"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 4 inbound Pith citation observations for arXiv:2412.01505."}