{"as_of":"2026-08-09T19:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9c2ba8245c7a6bdf0242cea11512bea0841cbe4aa3f5dd07bd983c1166e22d7a","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:45:07.761309Z","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-13T20:58:15.734279Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.04592","last_updated":"2025-06-06T04:08:17Z","snapshot_observed_at":"2026-08-04T05:13:14.227897Z","submitted_at":"2024-06-07T02:55:57Z","title":"Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04592","snapshot_observed_at":"2026-08-06T21:45:07.761309Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23803","last_updated":"2025-06-30T12:47:10Z","snapshot_observed_at":"2026-08-09T12:25:14.601906Z","submitted_at":"2025-06-30T12:47:10Z","title":"SGD with Adaptive Preconditioning: Unified Analysis and Momentum Acceleration","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T21:45:07.761309Z"},"links":{"cited_paper":"/paper/2406.04592","citing_paper":"/paper/2506.23803"},"observation_digest":"sha256:99f582a563c2072ef3413d4751e610937a267fa61f1fbfea96526f85ee757aae","observation_id":"d7452adf-7dba-458a-a72c-1b33a7ef44c3","resolution":{"observed_at":"2026-08-06T21:45:07.761309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04592","last_updated":"2025-06-06T04:08:17Z","snapshot_observed_at":"2026-08-04T05:13:14.227897Z","submitted_at":"2024-06-07T02:55:57Z","title":"Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04592","snapshot_observed_at":"2026-08-03T22:20:05.547507Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.11466","last_updated":"2026-06-22T13:35:19Z","snapshot_observed_at":"2026-08-07T16:29:00.257881Z","submitted_at":"2025-11-14T16:38:15Z","title":"Non-Euclidean SGD for Structured Optimization: Unified Analysis and Improved Rates","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-03T22:20:05.547507Z"},"links":{"cited_paper":"/paper/2406.04592","citing_paper":"/paper/2511.11466"},"observation_digest":"sha256:ec7dee3feb3221d0cf2c412037881bd7d0589ada465e3e2c782b7f2f65191e67","observation_id":"cb405e5a-dfea-42ed-b37a-658bd3181d3d","resolution":{"observed_at":"2026-08-03T22:20:05.547507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04592","last_updated":"2025-06-06T04:08:17Z","snapshot_observed_at":"2026-08-04T05:13:14.227897Z","submitted_at":"2024-06-07T02:55:57Z","title":"Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization","version":3},"cited_work":{"arxiv_id":"2406.04592","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.04592","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Provable complexity improvement of adagrad over sgd: Upper and lower bounds in stochastic non-convex optimization","venue":null,"work_id":"cdbc19d9-63d7-4304-9fc2-b65420a15f1d","year":2024},"citing_paper":{"arxiv_id":"2604.02505","last_updated":"2026-04-02T21:02:10Z","snapshot_observed_at":"2026-07-06T22:51:53.458444Z","submitted_at":"2026-04-02T21:02:10Z","title":"Optimal Projection-Free Adaptive SGD for Matrix Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-13T20:56:41.466669Z"},"links":{"cited_paper":"/paper/2406.04592","citing_paper":"/paper/2604.02505"},"observation_digest":"sha256:e0ef1ec3776ee29bc1d7612bc490f36675f32700f23ccd93e32a62de11d3b22e","observation_id":"1fbab019-480c-4942-9966-a31379e52df6","resolution":{"observed_at":"2026-05-13T20:58:15.735847Z","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":"2406.04592","last_updated":"2025-06-06T04:08:17Z","snapshot_observed_at":"2026-08-04T05:13:14.227897Z","submitted_at":"2024-06-07T02:55:57Z","title":"Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization","version":3},"cited_work":{"arxiv_id":"2406.04592","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.04592","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Provable complexity improvement of adagrad over sgd: Upper and lower bounds in stochastic non-convex optimization","venue":null,"work_id":"cdbc19d9-63d7-4304-9fc2-b65420a15f1d","year":2024},"citing_paper":{"arxiv_id":"2604.17423","last_updated":"2026-05-01T14:46:49Z","snapshot_observed_at":"2026-08-02T20:20:49.115675Z","submitted_at":"2026-04-19T13:07:51Z","title":"A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T07:19:59.335184Z"},"links":{"cited_paper":"/paper/2406.04592","citing_paper":"/paper/2604.17423"},"observation_digest":"sha256:f3004524be0b4f4da34574ad01569587dfc16c07d45343f8f4da54bcd3a488c4","observation_id":"143d654f-2f15-4a05-99a1-b8169616974c","resolution":{"observed_at":"2026-05-10T07:26:59.838893Z","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":"2406.04592","last_updated":"2025-06-06T04:08:17Z","snapshot_observed_at":"2026-08-04T05:13:14.227897Z","submitted_at":"2024-06-07T02:55:57Z","title":"Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization","version":3},"cited_work":{"arxiv_id":"2406.04592","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.04592","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Provable complexity improvement of adagrad over sgd: Upper and lower bounds in stochastic non-convex optimization","venue":null,"work_id":"cdbc19d9-63d7-4304-9fc2-b65420a15f1d","year":2024},"citing_paper":{"arxiv_id":"2605.06654","last_updated":"2026-05-07T17:57:02Z","snapshot_observed_at":"2026-07-06T23:19:05.764765Z","submitted_at":"2026-05-07T17:57:02Z","title":"Optimizer-Model Consistency: Full Finetuning with the Same Optimizer as Pretraining Forgets Less","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T12:00:49.127471Z"},"links":{"cited_paper":"/paper/2406.04592","citing_paper":"/paper/2605.06654"},"observation_digest":"sha256:05889dcf866b530bd16f92df21b5d90d980e3c1c22332cf4d8a95af16ca764ed","observation_id":"7ee54a71-d2e5-47f8-929b-96ac55cfdafa","resolution":{"observed_at":"2026-05-11T19:26:08.606390Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2406.04592/citation-record","integrity":"/paper/2406.04592/integrity","json":"/paper/2406.04592/citation-record.json","paper":"/paper/2406.04592"},"outbound":[],"paper":{"arxiv_id":"2406.04592","last_updated":"2025-06-06T04:08:17Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-04T05:13:14.227897Z","submitted_at":"2024-06-07T02:55:57Z","title":"Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization"},"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 5 inbound Pith citation observations for arXiv:2406.04592."}