{"as_of":"2026-08-09T20:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:52ddf421ea82b6df7459af5a46a88678738ad44e36d58b68c46440b84fdf25d1","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T05:55:59.187523Z","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-24T17:54:46.077723Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.12838","last_updated":"2019-10-29T04:04:19Z","snapshot_observed_at":"2026-07-06T07:49:17.886466Z","submitted_at":"2019-04-29T17:41:27Z","title":"The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure For Least Squares","version":2},"cited_work":{"arxiv_id":"1904.12838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.12838","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"78a1255f-368b-49a4-a11d-625b4fc9dad3","year":1904},"citing_paper":{"arxiv_id":"1907.09547","last_updated":"2019-07-22T19:52:11Z","snapshot_observed_at":"2026-07-06T08:09:25.854208Z","submitted_at":"2019-07-22T19:52:11Z","title":"Stochastic algorithms with geometric step decay converge linearly on sharp functions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-24T17:53:08.819382Z"},"links":{"cited_paper":"/paper/1904.12838","citing_paper":"/paper/1907.09547"},"observation_digest":"sha256:84c8dffa5f482f4347e100c028170b0d2294b90c541ca221c7443da9d4a29de6","observation_id":"2d0bfda6-65e8-40c4-8163-2d324a714c06","resolution":{"observed_at":"2026-05-24T17:54:46.080824Z","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":"1904.12838","last_updated":"2019-10-29T04:04:19Z","snapshot_observed_at":"2026-07-06T07:49:17.886466Z","submitted_at":"2019-04-29T17:41:27Z","title":"The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure For Least Squares","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.12838","snapshot_observed_at":"2026-08-06T05:55:59.187523Z","title":"Understanding emergent abilities of language models from the loss perspective","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2508.01483","last_updated":"2025-08-02T20:36:52Z","snapshot_observed_at":"2026-08-06T05:51:21.591740Z","submitted_at":"2025-08-02T20:36:52Z","title":"Training Dynamics of the Cooldown Stage in Warmup-Stable-Decay Learning Rate Scheduler","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T05:55:59.187523Z"},"links":{"cited_paper":"/paper/1904.12838","citing_paper":"/paper/2508.01483"},"observation_digest":"sha256:1532ffa54382cedcd017cec58f60f202549c13aa771e7de25d820fe855489593","observation_id":"79e55738-1928-4437-b9db-ff79d9374f41","resolution":{"observed_at":"2026-08-06T05:55:59.187523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1904.12838/citation-record","integrity":"/paper/1904.12838/integrity","json":"/paper/1904.12838/citation-record.json","paper":"/paper/1904.12838"},"outbound":[],"paper":{"arxiv_id":"1904.12838","last_updated":"2019-10-29T04:04:19Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:49:17.886466Z","submitted_at":"2019-04-29T17:41:27Z","title":"The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure For Least Squares"},"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 2 inbound Pith citation observations for arXiv:1904.12838."}