{"as_of":"2026-08-07T20:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2c006bb7d75afcb4712a7c9c3e8766593959ba3400459f914b38b2f096bd48fd","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T07:04:21.012269Z","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-07-06T12:16:01.829426Z","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:ca662692047926f0537798fae5ffa8ba47be18563834b34b7db10454dad2815f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T12:16:01.829426Z","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-07-06T22:30:17.163909Z","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:ef6fc8adcfda6c58604c0d4899be0388424926bed426784e82b32c2db4c2c271","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T12:16:01.829426Z","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-05T19:10:03.664230Z","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:697f9f10fb8298a74afa19adec865f99986cc6e63c1708bbe435739e8411c084","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T12:16:01.829426Z","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-05T19:10:03.664230Z","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:06d862d16d8fdb81e82fb6133c981c80ffdf179b1a21f6fb56c22e882b1366e8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T12:16:01.829426Z","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-07-06T23:02:58.361418Z","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:b409578e09219fc847b57b3945ae8e555d6aac02abbb3835879b52ddc949a741","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T12:16:01.829426Z","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-07-06T23:22:18.704329Z","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:02e518b258312ebd7e0da1bb3208ae5feef404a4fb9651134d8a78948abb383c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T12:16:01.829426Z","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-07-06T23:22:18.704329Z","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:d9bf3957ae4a00069abcdc5af6e4a914e46deef83544fd0be85ca1a9fe76dff2","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T12:16:01.829426Z","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-07-06T23:44:42.700120Z","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:628f956bf6fd2a2632676a8be183f01753773512f9931dd256844c8cc394c81b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T12:16:01.829426Z","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-07-06T23:53:07.149182Z","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:4c92e07c3dea0449be17f42327ce3e8efb2739ee8c52ec47c2fc802b5c21999a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T12:16:01.829426Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2112.03459."}