{"as_of":"2026-08-09T20:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5eea9386851e45cee470368b60f47a11640f026b2a96b5a1732ff634b55c32c9","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-06T20:48:53.764373Z","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-25T05:40:24.434095Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.18965","last_updated":"2025-07-23T13:03:41Z","snapshot_observed_at":"2026-07-06T20:28:52.880548Z","submitted_at":"2025-01-31T08:55:56Z","title":"The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18965","snapshot_observed_at":"2026-08-06T20:48:53.764373Z","title":"The surprising agreement between convex optimization theory and learning-rate scheduling for large model training","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.02119","last_updated":"2025-07-07T06:13:26Z","snapshot_observed_at":"2026-08-09T03:48:37.458741Z","submitted_at":"2025-07-02T20:03:34Z","title":"Scaling Collapse Reveals Universal Dynamics in Compute-Optimally Trained Neural Networks","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T20:48:53.764373Z"},"links":{"cited_paper":"/paper/2501.18965","citing_paper":"/paper/2507.02119"},"observation_digest":"sha256:a8b5d148c994d4a1c9468c91d63c494e033f35927773dbff9f2756a94fa019d3","observation_id":"524ba4f5-5eea-4805-bd48-9394a5ddabe6","resolution":{"observed_at":"2026-08-06T20:48:53.764373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18965","last_updated":"2025-07-23T13:03:41Z","snapshot_observed_at":"2026-07-06T20:28:52.880548Z","submitted_at":"2025-01-31T08:55:56Z","title":"The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18965","snapshot_observed_at":"2026-08-04T12:38:59.978009Z","title":"The surprising agreement between convex optimization theory and learning-rate scheduling for large model training","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.03164","last_updated":"2026-06-28T16:14:54Z","snapshot_observed_at":"2026-08-04T12:38:48.240318Z","submitted_at":"2025-10-03T16:35:56Z","title":"Why Do We Need Warm-up? A Theoretical Perspective","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-04T12:38:59.978009Z"},"links":{"cited_paper":"/paper/2501.18965","citing_paper":"/paper/2510.03164"},"observation_digest":"sha256:ad51e87059f2d4d1a8ea17da3570ace53dffb3ebafab616c686cf013085142b0","observation_id":"ce80e345-2c2a-46c4-b820-4fbd67f88085","resolution":{"observed_at":"2026-08-04T12:38:59.978009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18965","last_updated":"2025-07-23T13:03:41Z","snapshot_observed_at":"2026-07-06T20:28:52.880548Z","submitted_at":"2025-01-31T08:55:56Z","title":"The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training","version":2},"cited_work":{"arxiv_id":"2501.18965","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18965","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The surprising agreement between convex optimization theory and learning-rate scheduling for large model training","venue":null,"work_id":"84158493-5e4b-43ba-b788-72c195f36943","year":2025},"citing_paper":{"arxiv_id":"2605.11172","last_updated":"2026-05-11T19:30:47Z","snapshot_observed_at":"2026-07-06T23:23:02.025664Z","submitted_at":"2026-05-11T19:30:47Z","title":"Optimistic Dual Averaging Unifies Modern Optimizers","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-13T05:52:16.805180Z"},"links":{"cited_paper":"/paper/2501.18965","citing_paper":"/paper/2605.11172"},"observation_digest":"sha256:88ee8e9fa21eb5c29f3753f31f0fe99ca8703eb8b91bca92d13e19e76ea574c4","observation_id":"cf95fe02-b66a-4973-9e6e-e17359c23ff9","resolution":{"observed_at":"2026-05-13T05:52:21.853745Z","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":"2501.18965","last_updated":"2025-07-23T13:03:41Z","snapshot_observed_at":"2026-07-06T20:28:52.880548Z","submitted_at":"2025-01-31T08:55:56Z","title":"The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training","version":2},"cited_work":{"arxiv_id":"2501.18965","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18965","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The surprising agreement between convex optimization theory and learning-rate scheduling for large model training","venue":null,"work_id":"84158493-5e4b-43ba-b788-72c195f36943","year":2025},"citing_paper":{"arxiv_id":"2605.23061","last_updated":"2026-05-21T21:50:22Z","snapshot_observed_at":"2026-08-02T04:10:09.683333Z","submitted_at":"2026-05-21T21:50:22Z","title":"Anytime Training with Schedule-Free Spectral Optimization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-25T05:38:16.958574Z"},"links":{"cited_paper":"/paper/2501.18965","citing_paper":"/paper/2605.23061"},"observation_digest":"sha256:adef5e20cc10f3ac35cd1df4d0fac17deee9137d50e1c8220a227d16d0ff64e6","observation_id":"1b620e58-78fa-470b-81b9-c9e4586f43a6","resolution":{"observed_at":"2026-05-25T05:40:24.438563Z","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":"2501.18965","last_updated":"2025-07-23T13:03:41Z","snapshot_observed_at":"2026-07-06T20:28:52.880548Z","submitted_at":"2025-01-31T08:55:56Z","title":"The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18965","snapshot_observed_at":"2026-07-14T08:04:06.432613Z","title":"arXiv preprint arXiv:2501.18965 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10959","last_updated":"2026-07-12T23:24:42Z","snapshot_observed_at":"2026-08-03T13:16:14.672928Z","submitted_at":"2026-07-12T23:24:42Z","title":"WSqD: A Horizon-Free Learning Rate Schedule for Large Model Training","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-14T08:04:06.432613Z"},"links":{"cited_paper":"/paper/2501.18965","citing_paper":"/paper/2607.10959"},"observation_digest":"sha256:4c190911cffdd892707ed809d0d7af32bb1a18fbd0d8696afb2ca7d64c2350df","observation_id":"2b84bfe1-2116-411a-b4fe-13fde4b8f7f5","resolution":{"observed_at":"2026-07-14T08:04:06.432613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18965","last_updated":"2025-07-23T13:03:41Z","snapshot_observed_at":"2026-07-06T20:28:52.880548Z","submitted_at":"2025-01-31T08:55:56Z","title":"The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18965","snapshot_observed_at":"2026-08-01T12:16:36.364978Z","title":"2025, arXiv e-prints, arXiv:2501.18965","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19640","last_updated":"2026-07-22T00:21:36Z","snapshot_observed_at":"2026-08-04T21:04:08.236868Z","submitted_at":"2026-07-22T00:21:36Z","title":"AGNFormer I: Reconstruction of AGN spectra using a probabilistic transformer model","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-01T12:16:36.364978Z"},"links":{"cited_paper":"/paper/2501.18965","citing_paper":"/paper/2607.19640"},"observation_digest":"sha256:5042a9e5fc2e870db9ed017aa90501fc21905085d698212498c8eae2a194632e","observation_id":"4c08e596-2b3d-4b4c-bc89-faa5e206c143","resolution":{"observed_at":"2026-08-01T12:16:36.364978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18965","last_updated":"2025-07-23T13:03:41Z","snapshot_observed_at":"2026-07-06T20:28:52.880548Z","submitted_at":"2025-01-31T08:55:56Z","title":"The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18965","snapshot_observed_at":"2026-08-01T12:16:45.602773Z","title":"arXiv e-prints , keywords =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19640","last_updated":"2026-07-22T00:21:36Z","snapshot_observed_at":"2026-08-04T21:04:08.236868Z","submitted_at":"2026-07-22T00:21:36Z","title":"AGNFormer I: Reconstruction of AGN spectra using a probabilistic transformer model","version":1},"reference_index":154,"source":"arxiv_source","source_observed_at":"2026-08-01T12:16:45.602773Z"},"links":{"cited_paper":"/paper/2501.18965","citing_paper":"/paper/2607.19640"},"observation_digest":"sha256:0b84b3c4c89c7745527586e12e3a3899423b73cf969e66a43c5940c03ad33287","observation_id":"c397482a-d1dc-4a09-a687-86898400f35b","resolution":{"observed_at":"2026-08-01T12:16:45.602773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18965","last_updated":"2025-07-23T13:03:41Z","snapshot_observed_at":"2026-07-06T20:28:52.880548Z","submitted_at":"2025-01-31T08:55:56Z","title":"The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18965","snapshot_observed_at":"2026-08-01T06:58:11.864874Z","title":"The surprising agreement between convex optimization theory and learning-rate scheduling for large model training.arXiv preprint arXiv:2501.18965,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21716","last_updated":"2026-07-23T18:02:03Z","snapshot_observed_at":"2026-08-09T14:14:32.562223Z","submitted_at":"2026-07-23T18:02:03Z","title":"A Defense of the Quadratic Model","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T06:58:11.864874Z"},"links":{"cited_paper":"/paper/2501.18965","citing_paper":"/paper/2607.21716"},"observation_digest":"sha256:e6926393106a892dabcf88b4b9da362bbf17d2c9cb18ed9e260f65f5cbeb7a46","observation_id":"61cc0a2b-020d-4971-aca3-9a3efae113db","resolution":{"observed_at":"2026-08-01T06:58:11.864874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.18965/citation-record","integrity":"/paper/2501.18965/integrity","json":"/paper/2501.18965/citation-record.json","paper":"/paper/2501.18965"},"outbound":[],"paper":{"arxiv_id":"2501.18965","last_updated":"2025-07-23T13:03:41Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:28:52.880548Z","submitted_at":"2025-01-31T08:55:56Z","title":"The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training"},"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 8 inbound Pith citation observations for arXiv:2501.18965."}