{"as_of":"2026-08-10T23:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:46479bcaa635a888361c00694d8260884f1f0e9a82a8334eb394eb7bfaf6832a","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-10T06:31:04.303077+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-09T13:53:06.189659Z","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-03T17:08:43.625139Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent","version":2},"cited_work":{"arxiv_id":"1910.09529","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09529","snapshot_observed_at":"2026-07-03T17:08:43.625139Z","title":"Malitsky and K","venue":null,"work_id":"bf1c8cf8-795b-4d6b-8359-6e5a2ad1ee1e","year":1910},"citing_paper":{"arxiv_id":"2412.14291","last_updated":"2026-05-14T16:58:17Z","snapshot_observed_at":"2026-07-06T20:09:33.491422Z","submitted_at":"2024-12-18T19:34:16Z","title":"Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-23T06:23:51.617737Z"},"links":{"cited_paper":"/paper/1910.09529","citing_paper":"/paper/2412.14291"},"observation_digest":"sha256:fb19d217a4f3abc1ba5b06e2c68510e53be0eb1c7208b56c29ead7aad891b64e","observation_id":"b34d58b7-f29d-407e-bfd4-cfcb9efb822d","resolution":{"observed_at":"2026-05-23T06:25:28.054965Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.09529","snapshot_observed_at":"2026-08-09T13:53:06.189659Z","title":"and Mishchenko, K","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2502.02002","last_updated":"2025-07-30T08:25:58Z","snapshot_observed_at":"2026-08-09T15:36:50.248580Z","submitted_at":"2025-02-04T04:30:03Z","title":"The Ball-Proximal (=\"Broximal\") Point Method: a New Algorithm, Convergence Theory, and Applications","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-09T13:53:06.189659Z"},"links":{"cited_paper":"/paper/1910.09529","citing_paper":"/paper/2502.02002"},"observation_digest":"sha256:1ac0cdbf4b421b8cab535d33b7d643d7709fd6899750a865b6ff45e4f49628ba","observation_id":"f9dc7316-4bab-41f3-bc89-2464c4775933","resolution":{"observed_at":"2026-08-09T13:53:06.189659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.09529","snapshot_observed_at":"2026-08-07T13:30:26.665057Z","title":"Adaptive gradient descent without descent","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2505.21651","last_updated":"2025-05-27T18:25:21Z","snapshot_observed_at":"2026-08-09T01:27:09.066156Z","submitted_at":"2025-05-27T18:25:21Z","title":"AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T13:30:26.665057Z"},"links":{"cited_paper":"/paper/1910.09529","citing_paper":"/paper/2505.21651"},"observation_digest":"sha256:cbe1b9970a560289050345791c44c86235ff05786dd2dc75cb759283d29a010c","observation_id":"62a50b7a-aa01-4eb5-a9bc-605cdc44fc4f","resolution":{"observed_at":"2026-08-07T13:30:26.665057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent","version":2},"cited_work":{"arxiv_id":"1910.09529","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09529","snapshot_observed_at":"2026-07-03T17:08:43.625139Z","title":"Malitsky and K","venue":null,"work_id":"bf1c8cf8-795b-4d6b-8359-6e5a2ad1ee1e","year":1910},"citing_paper":{"arxiv_id":"2509.11043","last_updated":"2026-04-03T14:30:55Z","snapshot_observed_at":"2026-07-06T22:29:48.011706Z","submitted_at":"2025-09-14T02:17:01Z","title":"A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-18T17:20:09.257391Z"},"links":{"cited_paper":"/paper/1910.09529","citing_paper":"/paper/2509.11043"},"observation_digest":"sha256:621b6404588915cb0aefc54df93112f8c5f7cdfc2700a7b8c8af7d7dd151e627","observation_id":"9891b890-8270-49dd-bbcb-f56b37101bb1","resolution":{"observed_at":"2026-05-18T17:21:40.039733Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent","version":2},"cited_work":{"arxiv_id":"1910.09529","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09529","snapshot_observed_at":"2026-07-03T17:08:43.625139Z","title":"Malitsky and K","venue":null,"work_id":"bf1c8cf8-795b-4d6b-8359-6e5a2ad1ee1e","year":1910},"citing_paper":{"arxiv_id":"2510.04988","last_updated":"2026-05-10T14:57:23Z","snapshot_observed_at":"2026-08-04T04:12:48.359316Z","submitted_at":"2025-10-06T16:24:57Z","title":"Adaptive Memory Momentum via a Model-Based Framework for Deep Learning Optimization","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-18T09:44:53.004293Z"},"links":{"cited_paper":"/paper/1910.09529","citing_paper":"/paper/2510.04988"},"observation_digest":"sha256:26891137612e8823f7c53d02d4f9ef621ef099f48a1113813ca6e1a2b8b725f6","observation_id":"9eee0448-b46f-4849-a241-1e1fe04fb079","resolution":{"observed_at":"2026-05-18T09:46:12.506790Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent","version":2},"cited_work":{"arxiv_id":"1910.09529","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09529","snapshot_observed_at":"2026-07-03T17:08:43.625139Z","title":"Malitsky and K","venue":null,"work_id":"bf1c8cf8-795b-4d6b-8359-6e5a2ad1ee1e","year":1910},"citing_paper":{"arxiv_id":"2605.00711","last_updated":"2026-07-21T18:21:04Z","snapshot_observed_at":"2026-08-02T15:08:47.548007Z","submitted_at":"2026-05-01T14:55:31Z","title":"A Line-search-free Method for Adaptive Decentralized Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-09T18:46:27.131380Z"},"links":{"cited_paper":"/paper/1910.09529","citing_paper":"/paper/2605.00711"},"observation_digest":"sha256:bf518a140c4f61df842fa13d51619aefdcb7811cbc61121b05443cb948ae7959","observation_id":"00548390-d239-4fe5-9b46-251ccdecd4a2","resolution":{"observed_at":"2026-05-11T16:06:08.514692Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.09529","snapshot_observed_at":"2026-08-02T15:08:50.234110Z","title":"Adaptive gradient descent without descent,","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2605.00711","last_updated":"2026-07-21T18:21:04Z","snapshot_observed_at":"2026-08-02T15:08:47.548007Z","submitted_at":"2026-05-01T14:55:31Z","title":"A Line-search-free Method for Adaptive Decentralized Optimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T15:08:50.234110Z"},"links":{"cited_paper":"/paper/1910.09529","citing_paper":"/paper/2605.00711"},"observation_digest":"sha256:4d73a0c331df6d4558b7b1126d448fe69ebe3826db90b1ba880652080131fb0d","observation_id":"5c7e3382-9bd2-4a33-a1ca-e54a8ea31160","resolution":{"observed_at":"2026-08-02T15:08:50.234110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent","version":2},"cited_work":{"arxiv_id":"1910.09529","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09529","snapshot_observed_at":"2026-07-03T17:08:43.625139Z","title":"Malitsky and K","venue":null,"work_id":"bf1c8cf8-795b-4d6b-8359-6e5a2ad1ee1e","year":1910},"citing_paper":{"arxiv_id":"2606.02787","last_updated":"2026-06-01T18:51:26Z","snapshot_observed_at":"2026-07-06T23:43:07.940839Z","submitted_at":"2026-06-01T18:51:26Z","title":"Adaptive Accelerated Mirror Descent in Primal and Dual Spaces","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T13:17:11.219557Z"},"links":{"cited_paper":"/paper/1910.09529","citing_paper":"/paper/2606.02787"},"observation_digest":"sha256:1ad44f8a6bf6778d6a8e2af3107151207ed77ff6e8678472499f26db97e30e5e","observation_id":"0f0305af-9b63-440a-a380-3bcc4202f81c","resolution":{"observed_at":"2026-07-02T00:46:24.653275Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent","version":2},"cited_work":{"arxiv_id":"1910.09529","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09529","snapshot_observed_at":"2026-07-03T17:08:43.625139Z","title":"Malitsky and K","venue":null,"work_id":"bf1c8cf8-795b-4d6b-8359-6e5a2ad1ee1e","year":1910},"citing_paper":{"arxiv_id":"2606.11515","last_updated":"2026-06-09T23:29:00Z","snapshot_observed_at":"2026-08-06T08:57:39.755851Z","submitted_at":"2026-06-09T23:29:00Z","title":"Exponential Adaptive Smoothing and Importance Sampling for Optimization of the Conditional Value-at-Risk","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T11:57:40.571364Z"},"links":{"cited_paper":"/paper/1910.09529","citing_paper":"/paper/2606.11515"},"observation_digest":"sha256:b3e26f73b8114bd1858be450901bdd22cd9be5f5cf63bed20c0aa8a60a37df48","observation_id":"1ba67e0f-3b71-4ede-be2e-5bd6a7cecc95","resolution":{"observed_at":"2026-07-03T07:37:45.448569Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent","version":2},"cited_work":{"arxiv_id":"1910.09529","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09529","snapshot_observed_at":"2026-07-03T17:08:43.625139Z","title":"Malitsky and K","venue":null,"work_id":"bf1c8cf8-795b-4d6b-8359-6e5a2ad1ee1e","year":1910},"citing_paper":{"arxiv_id":"2606.14970","last_updated":"2026-06-22T08:40:27Z","snapshot_observed_at":"2026-07-06T23:52:28.557859Z","submitted_at":"2026-06-12T21:46:54Z","title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-27T04:33:10.554853Z"},"links":{"cited_paper":"/paper/1910.09529","citing_paper":"/paper/2606.14970"},"observation_digest":"sha256:d0b65a0089a3286957510c6d412dc73417524eb0f35f63dc081edfdf1a868caf","observation_id":"6094c44e-4506-4b44-b9cf-67cddb096819","resolution":{"observed_at":"2026-07-03T17:08:43.626648Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent","version":2},"cited_work":{"arxiv_id":"1910.09529","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09529","snapshot_observed_at":"2026-07-03T17:08:43.625139Z","title":"Malitsky and K","venue":null,"work_id":"bf1c8cf8-795b-4d6b-8359-6e5a2ad1ee1e","year":1910},"citing_paper":{"arxiv_id":"2606.30930","last_updated":"2026-06-29T21:32:58Z","snapshot_observed_at":"2026-08-06T09:55:08.155994Z","submitted_at":"2026-06-29T21:32:58Z","title":"SGD at the Edge of Stability: Stochastic Stabilization with Large Learning Rates","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-07-01T01:05:17.842447Z"},"links":{"cited_paper":"/paper/1910.09529","citing_paper":"/paper/2606.30930"},"observation_digest":"sha256:fc65839ddd9ba4849ee3ea79d70329de707f37f824eedf0bb9e13cdb9939e725","observation_id":"4f49e547-105f-4237-984f-6c14e670d271","resolution":{"observed_at":"2026-07-01T13:05:45.497060Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1910.09529/citation-record","integrity":"/paper/1910.09529/integrity","json":"/paper/1910.09529/citation-record.json","paper":"/paper/1910.09529"},"outbound":[],"paper":{"arxiv_id":"1910.09529","last_updated":"2020-08-15T20:00:34Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T08:31:14.032674Z","submitted_at":"2019-10-21T17:49:29Z","title":"Adaptive Gradient Descent without Descent"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:1910.09529."}