{"as_of":"2026-08-18T09:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3f131482a2e0c840743b0f462dc3cf0497dc4f1dc8a9ab8a67989a7b0b8f2fa0","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T06:04:09.786051Z","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-04T07:29:38.375717Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.09632","last_updated":"2023-01-13T15:06:19Z","snapshot_observed_at":"2026-08-16T16:38:01.727184Z","submitted_at":"2022-08-20T08:12:37Z","title":"Adam Can Converge Without Any Modification On Update Rules","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.09632","snapshot_observed_at":"2026-08-16T06:04:09.786051Z","title":"Adam Can Converge Without Any Modification On Update Rules","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.19426","last_updated":"2025-04-28T02:17:50Z","snapshot_observed_at":"2026-08-17T09:02:43.677169Z","submitted_at":"2025-04-28T02:17:50Z","title":"Sharp higher order convergence rates for the Adam optimizer","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T06:04:09.786051Z"},"links":{"cited_paper":"/paper/2208.09632","citing_paper":"/paper/2504.19426"},"observation_digest":"sha256:df4a77b58bf9e7427b35f941275d2b4a2b976872c869d15d69ee66b9df5b865e","observation_id":"55a86273-5bdb-45fa-b649-7a7b9dfb5551","resolution":{"observed_at":"2026-08-16T06:04:09.786051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.09632","last_updated":"2023-01-13T15:06:19Z","snapshot_observed_at":"2026-08-16T16:38:01.727184Z","submitted_at":"2022-08-20T08:12:37Z","title":"Adam Can Converge Without Any Modification On Update Rules","version":5},"cited_work":{"arxiv_id":"2208.09632","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.09632","snapshot_observed_at":"2026-07-04T07:29:38.375717Z","title":"Adam Can Converge Without Any Modification On Update Rules.arXiv:2208.09632, 2022","venue":null,"work_id":"d2f03ebd-ef91-4ee2-a299-e9b9f536f385","year":2022},"citing_paper":{"arxiv_id":"2606.21433","last_updated":"2026-06-19T13:49:42Z","snapshot_observed_at":"2026-08-18T01:00:37.991091Z","submitted_at":"2026-06-19T13:49:42Z","title":"Central limit theorem for the averaged Adam optimizer","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-26T13:29:08.750421Z"},"links":{"cited_paper":"/paper/2208.09632","citing_paper":"/paper/2606.21433"},"observation_digest":"sha256:ccc89e622c0253e58734574405613753aa139ab033e00352d668e0afd8df87eb","observation_id":"61092b32-2d0a-49ac-acd2-78eeaa7f9490","resolution":{"observed_at":"2026-07-04T07:29:38.377173Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.09632","last_updated":"2023-01-13T15:06:19Z","snapshot_observed_at":"2026-08-16T16:38:01.727184Z","submitted_at":"2022-08-20T08:12:37Z","title":"Adam Can Converge Without Any Modification On Update Rules","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.09632","snapshot_observed_at":"2026-07-11T20:46:05.467029Z","title":"Adam Can Converge Without Any Modification On Update Rules","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04233","last_updated":"2026-07-05T11:11:40Z","snapshot_observed_at":"2026-08-16T20:56:16.792561Z","submitted_at":"2026-07-05T11:11:40Z","title":"Unified convergence analysis for gradient descent optimization methods in the training of deep neural networks","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-07-11T20:46:05.467029Z"},"links":{"cited_paper":"/paper/2208.09632","citing_paper":"/paper/2607.04233"},"observation_digest":"sha256:10459858af52641ef90871905bb9cdef1ee9482b97ddcdadae799d83fd56eb60","observation_id":"d1e1cece-5ab0-4496-91c4-0287d38db605","resolution":{"observed_at":"2026-07-11T20:46:05.467029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.09632","last_updated":"2023-01-13T15:06:19Z","snapshot_observed_at":"2026-08-16T16:38:01.727184Z","submitted_at":"2022-08-20T08:12:37Z","title":"Adam Can Converge Without Any Modification On Update Rules","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.09632","snapshot_observed_at":"2026-08-06T21:05:43.655554Z","title":"arXiv:2208.09632 , archivePrefix =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04607","last_updated":"2026-08-05T09:14:22Z","snapshot_observed_at":"2026-08-16T09:15:44.445197Z","submitted_at":"2026-08-05T09:14:22Z","title":"On MUON optimization: From non-convergence to an error analysis with Polar Express and the Newton-Schulz polynomial from implementations","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T21:05:43.655554Z"},"links":{"cited_paper":"/paper/2208.09632","citing_paper":"/paper/2608.04607"},"observation_digest":"sha256:723ccbd1bd408195eb7d8f04038056fc428e2330720802058f0f882a7c3b87f0","observation_id":"916294df-843c-4430-9434-fcfc2c38a0e0","resolution":{"observed_at":"2026-08-06T21:05:43.655554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2208.09632/citation-record","integrity":"/paper/2208.09632/integrity","json":"/paper/2208.09632/citation-record.json","paper":"/paper/2208.09632"},"outbound":[],"paper":{"arxiv_id":"2208.09632","last_updated":"2023-01-13T15:06:19Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T16:38:01.727184Z","submitted_at":"2022-08-20T08:12:37Z","title":"Adam Can Converge Without Any Modification On Update Rules"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2208.09632."}