{"as_of":"2026-08-17T18:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:27e5539469a01682bd3cf2620f04756d752862b10bfeda4179d562bdf1f6d544","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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:30:24.968099Z","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-03T20:18:56.208375Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2112.03459","last_updated":"2021-12-07T02:47:58Z","snapshot_observed_at":"2026-08-16T17:36:34.725272Z","submitted_at":"2021-12-07T02:47:58Z","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","version":1},"cited_work":{"arxiv_id":"2112.03459","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.03459","snapshot_observed_at":"2026-07-03T20:18:56.208375Z","title":"Stochastic first- and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013a","venue":null,"work_id":"20c26602-48c9-4d37-9181-a2c2151582ca","year":2021},"citing_paper":{"arxiv_id":"2409.04777","last_updated":"2026-05-20T09:55:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-07T09:37:19Z","title":"Optimization Hyper-parameter Laws for Large Language Models","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T20:45:31.427677Z"},"links":{"cited_paper":"/paper/2112.03459","citing_paper":"/paper/2409.04777"},"observation_digest":"sha256:777af37ef690c1c670c1451faca7376a7a91f6464f61d37183ef9d82aa0b37b5","observation_id":"3feba15a-7bca-4398-a3a3-68a93ee0a0ec","resolution":{"observed_at":"2026-05-23T20:45:48.831372Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.03459","last_updated":"2021-12-07T02:47:58Z","snapshot_observed_at":"2026-08-16T17:36:34.725272Z","submitted_at":"2021-12-07T02:47:58Z","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.03459","snapshot_observed_at":"2026-08-15T23:30:24.968099Z","title":"A n ovel convergence analysis for algorithms of the adam family","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.04599","last_updated":"2025-05-07T17:40:12Z","snapshot_observed_at":"2026-08-17T17:47:13.898444Z","submitted_at":"2025-05-07T17:40:12Z","title":"Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-15T23:30:24.968099Z"},"links":{"cited_paper":"/paper/2112.03459","citing_paper":"/paper/2505.04599"},"observation_digest":"sha256:dba66e0d5323b75fe91ef80d106a2a8c16ce98ff8359d270c30946f6575882ba","observation_id":"0fb4aa0f-b843-4aef-822b-6b94177a9ecd","resolution":{"observed_at":"2026-08-15T23:30:24.968099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.03459","last_updated":"2021-12-07T02:47:58Z","snapshot_observed_at":"2026-08-16T17:36:34.725272Z","submitted_at":"2021-12-07T02:47:58Z","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","version":1},"cited_work":{"arxiv_id":"2112.03459","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.03459","snapshot_observed_at":"2026-07-03T20:18:56.208375Z","title":"Stochastic first- and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013a","venue":null,"work_id":"20c26602-48c9-4d37-9181-a2c2151582ca","year":2021},"citing_paper":{"arxiv_id":"2509.15816","last_updated":"2026-05-10T06:58:46Z","snapshot_observed_at":"2026-08-12T12:31:17.777645Z","submitted_at":"2025-09-19T09:43:37Z","title":"On the Convergence of Muon and Beyond","version":5},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-18T15:56:30.602824Z"},"links":{"cited_paper":"/paper/2112.03459","citing_paper":"/paper/2509.15816"},"observation_digest":"sha256:b548abe66c1a1de6a0836fe8470aeba6e41ff748605b3be7c57396d7c300feaf","observation_id":"1a679cd9-47df-46ac-aee8-16fba370fb1a","resolution":{"observed_at":"2026-05-18T15:56:34.147639Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.03459","last_updated":"2021-12-07T02:47:58Z","snapshot_observed_at":"2026-08-16T17:36:34.725272Z","submitted_at":"2021-12-07T02:47:58Z","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","version":1},"cited_work":{"arxiv_id":"2112.03459","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.03459","snapshot_observed_at":"2026-07-03T20:18:56.208375Z","title":"Stochastic first- and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013a","venue":null,"work_id":"20c26602-48c9-4d37-9181-a2c2151582ca","year":2021},"citing_paper":{"arxiv_id":"2603.03099","last_updated":"2026-05-18T07:31:26Z","snapshot_observed_at":"2026-08-15T05:43:58.829184Z","submitted_at":"2026-03-03T15:34:51Z","title":"Why Adam Can Beat SGD: Second-Moment Normalization Yields Sharper Tails","version":7},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-15T16:34:31.388219Z"},"links":{"cited_paper":"/paper/2112.03459","citing_paper":"/paper/2603.03099"},"observation_digest":"sha256:73e0a1938d204fc806541a9c29bae7df3c0947cb067c86b4818d467de35125ec","observation_id":"2340f814-cd58-4afb-8fe5-06fe02a1022c","resolution":{"observed_at":"2026-05-15T16:36:17.480350Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.03459","last_updated":"2021-12-07T02:47:58Z","snapshot_observed_at":"2026-08-16T17:36:34.725272Z","submitted_at":"2021-12-07T02:47:58Z","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","version":1},"cited_work":{"arxiv_id":"2112.03459","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.03459","snapshot_observed_at":"2026-07-03T20:18:56.208375Z","title":"Stochastic first- and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013a","venue":null,"work_id":"20c26602-48c9-4d37-9181-a2c2151582ca","year":2021},"citing_paper":{"arxiv_id":"2603.03099","last_updated":"2026-05-18T07:31:26Z","snapshot_observed_at":"2026-08-15T05:43:58.829184Z","submitted_at":"2026-03-03T15:34:51Z","title":"Why Adam Can Beat SGD: Second-Moment Normalization Yields Sharper Tails","version":8},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-21T11:47:27.345223Z"},"links":{"cited_paper":"/paper/2112.03459","citing_paper":"/paper/2603.03099"},"observation_digest":"sha256:1eeedd01fa896668d0120b2e9f2d8d8aa81ab11b97255a265a2db8e192eb8874","observation_id":"95b8ac5e-cc1e-4989-9074-12de02c42851","resolution":{"observed_at":"2026-05-21T11:50:03.791284Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.03459","last_updated":"2021-12-07T02:47:58Z","snapshot_observed_at":"2026-08-16T17:36:34.725272Z","submitted_at":"2021-12-07T02:47:58Z","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","version":1},"cited_work":{"arxiv_id":"2112.03459","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.03459","snapshot_observed_at":"2026-07-03T20:18:56.208375Z","title":"Stochastic first- and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013a","venue":null,"work_id":"20c26602-48c9-4d37-9181-a2c2151582ca","year":2021},"citing_paper":{"arxiv_id":"2604.15392","last_updated":"2026-04-16T07:44:52Z","snapshot_observed_at":"2026-08-15T17:49:20.577615Z","submitted_at":"2026-04-16T07:44:52Z","title":"Lightweight Geometric Adaptation for Training Physics-Informed Neural Networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T12:21:58.056762Z"},"links":{"cited_paper":"/paper/2112.03459","citing_paper":"/paper/2604.15392"},"observation_digest":"sha256:a9f0abc6b819a77c9ef4fc31859bb908ea2032d812c3be6b6bae01812e2f18f1","observation_id":"250151d8-2915-4299-af2a-6e2938d12d71","resolution":{"observed_at":"2026-05-10T12:25:22.601262Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.03459","last_updated":"2021-12-07T02:47:58Z","snapshot_observed_at":"2026-08-16T17:36:34.725272Z","submitted_at":"2021-12-07T02:47:58Z","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","version":1},"cited_work":{"arxiv_id":"2112.03459","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.03459","snapshot_observed_at":"2026-07-03T20:18:56.208375Z","title":"Stochastic first- and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013a","venue":null,"work_id":"20c26602-48c9-4d37-9181-a2c2151582ca","year":2021},"citing_paper":{"arxiv_id":"2605.10288","last_updated":"2026-05-12T10:19:03Z","snapshot_observed_at":"2026-08-14T19:46:29.121523Z","submitted_at":"2026-05-11T09:50:10Z","title":"BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-12T04:47:04.868735Z"},"links":{"cited_paper":"/paper/2112.03459","citing_paper":"/paper/2605.10288"},"observation_digest":"sha256:6e6c80ecbd15a9594bce1627ffd1674d87de016b0ec9f8a1ab049847b657876b","observation_id":"0633d965-a8c3-4e3b-b4a2-09fba9960622","resolution":{"observed_at":"2026-05-12T05:56:26.584346Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.03459","last_updated":"2021-12-07T02:47:58Z","snapshot_observed_at":"2026-08-16T17:36:34.725272Z","submitted_at":"2021-12-07T02:47:58Z","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","version":1},"cited_work":{"arxiv_id":"2112.03459","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.03459","snapshot_observed_at":"2026-07-03T20:18:56.208375Z","title":"Stochastic first- and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013a","venue":null,"work_id":"20c26602-48c9-4d37-9181-a2c2151582ca","year":2021},"citing_paper":{"arxiv_id":"2605.10288","last_updated":"2026-05-12T10:19:03Z","snapshot_observed_at":"2026-08-14T19:46:29.121523Z","submitted_at":"2026-05-11T09:50:10Z","title":"BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-13T06:20:42.781613Z"},"links":{"cited_paper":"/paper/2112.03459","citing_paper":"/paper/2605.10288"},"observation_digest":"sha256:d07750c09e1adc0a7b864cc049d791e7c086b5ce4f0714ad53e5cf5b9341255b","observation_id":"6cbf052c-e207-4652-8d3c-aa55beeba20d","resolution":{"observed_at":"2026-05-13T06:22:23.312646Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.03459","last_updated":"2021-12-07T02:47:58Z","snapshot_observed_at":"2026-08-16T17:36:34.725272Z","submitted_at":"2021-12-07T02:47:58Z","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","version":1},"cited_work":{"arxiv_id":"2112.03459","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.03459","snapshot_observed_at":"2026-07-03T20:18:56.208375Z","title":"Stochastic first- and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013a","venue":null,"work_id":"20c26602-48c9-4d37-9181-a2c2151582ca","year":2021},"citing_paper":{"arxiv_id":"2606.04662","last_updated":"2026-06-03T09:40:30Z","snapshot_observed_at":"2026-08-12T19:27:04.962406Z","submitted_at":"2026-06-03T09:40:30Z","title":"Why Muon Outperforms Adam: A Curvature Perspective","version":1},"reference_index":144,"source":"arxiv_source","source_observed_at":"2026-06-28T07:04:21.012269Z"},"links":{"cited_paper":"/paper/2112.03459","citing_paper":"/paper/2606.04662"},"observation_digest":"sha256:8aa1d0785271f2bb71f415bd969f672537e1e9b462ac7c75db2c096af982fa55","observation_id":"b7fd7ede-67cd-4773-9a34-a15f7025401a","resolution":{"observed_at":"2026-07-02T07:06:44.996018Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.03459","last_updated":"2021-12-07T02:47:58Z","snapshot_observed_at":"2026-08-16T17:36:34.725272Z","submitted_at":"2021-12-07T02:47:58Z","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","version":1},"cited_work":{"arxiv_id":"2112.03459","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.03459","snapshot_observed_at":"2026-07-03T20:18:56.208375Z","title":"Stochastic first- and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013a","venue":null,"work_id":"20c26602-48c9-4d37-9181-a2c2151582ca","year":2021},"citing_paper":{"arxiv_id":"2606.17526","last_updated":"2026-06-16T05:10:29Z","snapshot_observed_at":"2026-08-15T19:26:27.614515Z","submitted_at":"2026-06-16T05:10:29Z","title":"MGUP: A Momentum-Gradient Alignment Update Policy for Stochastic Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T01:31:53.550342Z"},"links":{"cited_paper":"/paper/2112.03459","citing_paper":"/paper/2606.17526"},"observation_digest":"sha256:6bfae42c125aeb45705992f5cd2f8e06576fb17f3099e13e15adc9a4a30e4fa0","observation_id":"0bafd005-2a56-4c89-87a9-7b13b09be1c4","resolution":{"observed_at":"2026-07-03T20:18:56.210194Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2112.03459/citation-record","integrity":"/paper/2112.03459/integrity","json":"/paper/2112.03459/citation-record.json","paper":"/paper/2112.03459"},"outbound":[],"paper":{"arxiv_id":"2112.03459","last_updated":"2021-12-07T02:47:58Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:36:34.725272Z","submitted_at":"2021-12-07T02:47:58Z","title":"A Novel Convergence Analysis for Algorithms of the Adam Family"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2112.03459."}