{"as_of":"2026-08-09T12:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:85dbf4f5ce8ef6924758b7ef2eadf8f44c5c19dcbff6f92f76cfc1399595730a","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:49:40.192955Z","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-30T07:14:21.713475Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-08-06T14:49:40.192955Z","title":"Optimal linear decay learning rate schedules and further refinements","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.17634","last_updated":"2025-08-11T08:36:31Z","snapshot_observed_at":"2026-08-06T19:16:35.269127Z","submitted_at":"2025-07-23T16:02:06Z","title":"WSM: Decay-Free Learning Rate Schedule via Checkpoint Merging for LLM Pre-training","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T14:49:40.192955Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2507.17634"},"observation_digest":"sha256:94f50a26ac1343d81faa825b04b1a82ac319a23dd41a3c4c28146db48d26adf2","observation_id":"9f23933e-377f-4d5a-812e-ac93845b4613","resolution":{"observed_at":"2026-08-06T14:49:40.192955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-08-04T12:38:53.947945Z","title":"Optimal linear decay learning rate schedules and further refinements","venue":null,"work_id":null,"year":2023},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-04T12:38:53.947945Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2510.03164"},"observation_digest":"sha256:9de83b4960c2fec7cf6a1cd328a0d269f4fda18af54a19f6ffd5568555478fbc","observation_id":"e1bde069-6bd4-47e7-9f02-85ea680d3b84","resolution":{"observed_at":"2026-08-04T12:38:53.947945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":"2310.07831","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-06-30T07:14:21.713475Z","title":"arXiv preprint arXiv:2310.07831 , year=","venue":null,"work_id":"54cda9cb-6f26-4516-a2ee-7145edbfbab6","year":2023},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:046e4c9bc9e17b46db44b52f2b68cc27770977275f51352e4210cfee14585303","observation_id":"40131a86-20e5-4a41-9aeb-9c4b91d16687","resolution":{"observed_at":"2026-05-17T23:20:27.656986Z","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":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":"2310.07831","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-06-30T07:14:21.713475Z","title":"arXiv preprint arXiv:2310.07831 , year=","venue":null,"work_id":"54cda9cb-6f26-4516-a2ee-7145edbfbab6","year":2023},"citing_paper":{"arxiv_id":"2602.04774","last_updated":"2026-05-08T16:24:57Z","snapshot_observed_at":"2026-08-03T01:34:12.578849Z","submitted_at":"2026-02-04T17:11:36Z","title":"Theory of Optimal Learning Rate Schedules and Scaling Laws for a Random Feature Model","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-16T06:58:38.927268Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2602.04774"},"observation_digest":"sha256:bb4d57e81bdb9cddfed0fc3602233ab7d1b432112de355c83281e5cba0f5754d","observation_id":"f60ddd8b-d932-4e81-a9ec-c3c47d29622a","resolution":{"observed_at":"2026-05-16T07:00:43.262655Z","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":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-08-03T02:53:13.970167Z","title":"Optimal linear decay learning rate schedules and further refinements","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.09842","last_updated":"2026-05-26T14:40:02Z","snapshot_observed_at":"2026-08-09T01:26:12.036715Z","submitted_at":"2026-02-10T14:46:14Z","title":"Step-Size Stability in Stochastic Optimization: A Theoretical Perspective","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T02:53:13.970167Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2602.09842"},"observation_digest":"sha256:97c50b1d0264b28896845cd00eecee70d05d26af2b21732465d38d0bdfc3adc6","observation_id":"d549f276-269b-45cf-8ffb-36afbc859bcf","resolution":{"observed_at":"2026-08-03T02:53:13.970167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-07-13T10:46:25.335756Z","title":"Defazio, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2604.04218","last_updated":"2026-04-05T18:31:51Z","snapshot_observed_at":"2026-07-13T10:46:19.431432Z","submitted_at":"2026-04-05T18:31:51Z","title":"Sharp asymptotic theory for Q-learning with LDTZ learning rate and its generalization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-13T10:46:25.335756Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2604.04218"},"observation_digest":"sha256:142afa27f46c1b6591779fa40ec6330c5bf5433177bb8794d7dafae56707dbc6","observation_id":"f0041dc8-2c60-4c68-8c1b-e41d9ea4bf8c","resolution":{"observed_at":"2026-07-13T10:46:25.335756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":"2310.07831","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-06-30T07:14:21.713475Z","title":"arXiv preprint arXiv:2310.07831 , year=","venue":null,"work_id":"54cda9cb-6f26-4516-a2ee-7145edbfbab6","year":2023},"citing_paper":{"arxiv_id":"2604.10728","last_updated":"2026-04-12T17:02:08Z","snapshot_observed_at":"2026-07-06T22:59:18.756089Z","submitted_at":"2026-04-12T17:02:08Z","title":"Last Iterate Convergence of AdaGrad-Norm for Convex Non-Smooth Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-10T15:44:30.926534Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2604.10728"},"observation_digest":"sha256:1372d888aa05c78df6dc47667fc71bb4c3062a6a53d0078e07c547a959918ac8","observation_id":"82f4e79e-7779-4d0c-b7c1-9e55dab96168","resolution":{"observed_at":"2026-05-11T09:56:03.779246Z","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":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":"2310.07831","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-06-30T07:14:21.713475Z","title":"arXiv preprint arXiv:2310.07831 , year=","venue":null,"work_id":"54cda9cb-6f26-4516-a2ee-7145edbfbab6","year":2023},"citing_paper":{"arxiv_id":"2605.06741","last_updated":"2026-05-07T14:28:37Z","snapshot_observed_at":"2026-07-06T23:19:10.574595Z","submitted_at":"2026-05-07T14:28:37Z","title":"A Closed-Form Upper Bound for Admissible Learning-Rate Steps in Belief-Space Dynamics","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-11T01:13:56.995359Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2605.06741"},"observation_digest":"sha256:1a730b3dd3d3a1c7562c3f6a8a2c6039df35b79e51b03cde1e971187e2aae70f","observation_id":"4adff2a0-c155-4c90-ade2-2dcebe730663","resolution":{"observed_at":"2026-05-11T04:35:58.426025Z","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":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":"2310.07831","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-06-30T07:14:21.713475Z","title":"arXiv preprint arXiv:2310.07831 , year=","venue":null,"work_id":"54cda9cb-6f26-4516-a2ee-7145edbfbab6","year":2023},"citing_paper":{"arxiv_id":"2606.30559","last_updated":"2026-06-29T16:55:45Z","snapshot_observed_at":"2026-08-01T14:52:02.260041Z","submitted_at":"2026-06-29T16:55:45Z","title":"Convergence of Continual Learning in Homogeneous Deep Networks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-30T07:05:09.767632Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2606.30559"},"observation_digest":"sha256:eab7881e9f991ab8ab3145d3405001419981ce16edd1836f71f8595c66245b5b","observation_id":"cc136043-ff94-48e6-9731-ae2c3cc8bc53","resolution":{"observed_at":"2026-06-30T07:14:21.715842Z","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":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-07-14T08:04:06.432613Z","title":"arXiv preprint arXiv:2310.07831 , 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":8,"source":"arxiv_source","source_observed_at":"2026-07-14T08:04:06.432613Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2607.10959"},"observation_digest":"sha256:df8362cbec4ef843df3de45f1953e0d813b9bfc9a477a9adacce0bb0a56e3bad","observation_id":"60eb9750-6b4d-457b-8c2b-930d7bb930a8","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":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-08-01T06:58:10.540455Z","title":"Optimal linear decay learning rate schedules and further refinements.arXiv preprint arXiv:2310.07831,","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-07T15:18:52.757558Z","submitted_at":"2026-07-23T18:02:03Z","title":"A Defense of the Quadratic Model","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-01T06:58:10.540455Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2607.21716"},"observation_digest":"sha256:2d55beffda36e8cde9720629bf8ab68683c7acde66c5acfb5a652d9ffcd2c89f","observation_id":"f4858053-ce37-48fa-b1b5-459c374f517f","resolution":{"observed_at":"2026-08-01T06:58:10.540455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.07831/citation-record","integrity":"/paper/2310.07831/integrity","json":"/paper/2310.07831/citation-record.json","paper":"/paper/2310.07831"},"outbound":[],"paper":{"arxiv_id":"2310.07831","last_updated":"2024-10-29T22:57:44Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T12:23:38.852681Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements"},"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 11 inbound Pith citation observations for arXiv:2310.07831."}