{"as_of":"2026-08-09T07:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:002e75cadac89f47c428b52e3b678ee07245ed8c4ee3a50c00f2fd79c7aca0fa","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":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":15,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:10:09.962195Z","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-04T06:59:37.573960Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":"1905.00313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-07-04T06:59:37.573960Z","title":"Hazan and S","venue":null,"work_id":"1fafe5d3-69fe-46c5-b51a-9dfe1038d907","year":1905},"citing_paper":{"arxiv_id":"2412.06319","last_updated":"2026-04-16T15:15:47Z","snapshot_observed_at":"2026-07-06T20:03:47.277630Z","submitted_at":"2024-12-09T09:13:54Z","title":"Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-23T07:42:25.733968Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2412.06319"},"observation_digest":"sha256:0fded77273c34cc150f617ec71378c4efb09a3ede11480b7b9b1fbe350634fef","observation_id":"646bff14-c432-4b12-8f50-d88818f8d5d7","resolution":{"observed_at":"2026-05-23T07:42:42.941700Z","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":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-08-07T13:10:09.962195Z","title":"Revisiting the polyak step size.arXiv preprint arXiv:1905.00313, 2019","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.23081","last_updated":"2025-09-05T02:19:47Z","snapshot_observed_at":"2026-08-08T05:47:28.129882Z","submitted_at":"2025-05-29T04:35:21Z","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:09.962195Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2505.23081"},"observation_digest":"sha256:d8380fbc4b0ea54a61b4b311ad082821f1645e4d1078b7f9ad7899dd2cf88e3b","observation_id":"830e8eff-9523-47ee-986c-3c8d79cc32c5","resolution":{"observed_at":"2026-08-07T13:10:09.962195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":"1905.00313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-07-04T06:59:37.573960Z","title":"Hazan and S","venue":null,"work_id":"1fafe5d3-69fe-46c5-b51a-9dfe1038d907","year":1905},"citing_paper":{"arxiv_id":"2507.05482","last_updated":"2026-05-18T13:49:11Z","snapshot_observed_at":"2026-08-04T11:02:25.358000Z","submitted_at":"2025-07-07T21:14:27Z","title":"Stein Diffusion Guidance: Training-Free Posterior Correction for Sampling Beyond High-Density Regions","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-22T00:13:51.383775Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2507.05482"},"observation_digest":"sha256:3b40e7be4babf711816be2bd2bd69d95b72c4b99173a03fdb60c82c52e4ac615","observation_id":"e4b572fb-421f-4531-bfde-433b0ebf10b9","resolution":{"observed_at":"2026-05-22T00:14:27.745331Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-08-06T17:59:06.331920Z","title":"and Kakade, S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T03:45:24.611655Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.331920Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:74103665c260224f1f4571de2666dfeb81f5c1ee76a4f95d189ba2343b3da5a6","observation_id":"bbd06d20-371f-4e35-8d39-f5a4d6d8f595","resolution":{"observed_at":"2026-08-06T17:59:06.331920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-08-05T05:05:47.733519Z","title":"Revisiting the polyak step size","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2509.05811","last_updated":"2025-09-06T19:08:35Z","snapshot_observed_at":"2026-08-09T06:27:44.649848Z","submitted_at":"2025-09-06T19:08:35Z","title":"Simple Optimizers for Convex Aligned Multi-Objective Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T05:05:47.733519Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2509.05811"},"observation_digest":"sha256:223a76f02509ba922c7f866d74d29fdd265393f408cc46017da82194300b4551","observation_id":"e607a1ba-7829-44b6-bd5f-047daea1bc44","resolution":{"observed_at":"2026-08-05T05:05:47.733519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":"1905.00313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-07-04T06:59:37.573960Z","title":"Hazan and S","venue":null,"work_id":"1fafe5d3-69fe-46c5-b51a-9dfe1038d907","year":1905},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:fa0b001a099112f0367dea22963d5d29bc83bb8019e9bedaae75f0dd02f96424","observation_id":"ad572987-0329-47f2-9c3a-459330515b2e","resolution":{"observed_at":"2026-05-17T23:20:27.652905Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-08-03T19:10:48.457152Z","title":"Revisiting the polyak step size.arXiv preprint arXiv:1905.00313,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2512.02342","last_updated":"2026-06-01T07:48:25Z","snapshot_observed_at":"2026-08-06T14:41:54.013603Z","submitted_at":"2025-12-02T02:24:32Z","title":"Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients","version":3},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-03T19:10:48.457152Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2512.02342"},"observation_digest":"sha256:981f7bcbd13552f7e9451d931b1c19415707599d7e641b20e853cbf0fcf8371f","observation_id":"e5d28cd5-7d6b-49d0-af3e-c23073758738","resolution":{"observed_at":"2026-08-03T19:10:48.457152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":"1905.00313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-07-04T06:59:37.573960Z","title":"Hazan and S","venue":null,"work_id":"1fafe5d3-69fe-46c5-b51a-9dfe1038d907","year":1905},"citing_paper":{"arxiv_id":"2604.13393","last_updated":"2026-04-15T01:43:24Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-15T01:43:24Z","title":"A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T13:36:38.113470Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2604.13393"},"observation_digest":"sha256:0dc0a6c5a73a4b40789bc6e78031a59e877303418f8cdcf634b15cd4667519d2","observation_id":"ec352a9b-0355-4212-901d-d28eb70854dd","resolution":{"observed_at":"2026-05-10T13:40:27.350076Z","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":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":"1905.00313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-07-04T06:59:37.573960Z","title":"Hazan and S","venue":null,"work_id":"1fafe5d3-69fe-46c5-b51a-9dfe1038d907","year":1905},"citing_paper":{"arxiv_id":"2605.10183","last_updated":"2026-05-11T08:34:36Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:34:36Z","title":"Fix the Loss, Not the Radius: Rethinking the Adversarial Perturbation of Sharpness-Aware Minimization","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-12T04:19:02.464399Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2605.10183"},"observation_digest":"sha256:e0eeebd5b0c6f6f9e3540cd8c795aa3e986d50991aab7b2d4e47ebbc6d10379c","observation_id":"cd5a610b-f887-4b19-b775-5744e014afc7","resolution":{"observed_at":"2026-05-12T06:26:23.386341Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":"1905.00313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-07-04T06:59:37.573960Z","title":"Hazan and S","venue":null,"work_id":"1fafe5d3-69fe-46c5-b51a-9dfe1038d907","year":1905},"citing_paper":{"arxiv_id":"2606.01827","last_updated":"2026-06-01T07:42:01Z","snapshot_observed_at":"2026-08-06T22:37:29.644562Z","submitted_at":"2026-06-01T07:42:01Z","title":"Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T13:37:44.255971Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2606.01827"},"observation_digest":"sha256:8dfaad84b0fcbe76a5fc92473c71f3694198cabb5bb3904cb565cac1b5d78c5b","observation_id":"17bd5c80-0287-4cdb-8ad1-9f77f7e14573","resolution":{"observed_at":"2026-07-02T00:06:23.893278Z","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":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":"1905.00313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-07-04T06:59:37.573960Z","title":"Hazan and S","venue":null,"work_id":"1fafe5d3-69fe-46c5-b51a-9dfe1038d907","year":1905},"citing_paper":{"arxiv_id":"2606.03953","last_updated":"2026-06-02T17:40:46Z","snapshot_observed_at":"2026-07-06T23:44:09.692359Z","submitted_at":"2026-06-02T17:40:46Z","title":"Introduction to stochastic gradient methods","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:30.792951Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2606.03953"},"observation_digest":"sha256:f7b032eb3c91f85317f23c9790870f3bbda91305cca13642c1a91cc18de0d5cc","observation_id":"da2944f6-952c-4281-a30d-bb0e37acee2c","resolution":{"observed_at":"2026-07-02T04:56:38.507896Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":"1905.00313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-07-04T06:59:37.573960Z","title":"Hazan and S","venue":null,"work_id":"1fafe5d3-69fe-46c5-b51a-9dfe1038d907","year":1905},"citing_paper":{"arxiv_id":"2606.07841","last_updated":"2026-06-05T21:04:12Z","snapshot_observed_at":"2026-08-06T11:32:52.174083Z","submitted_at":"2026-06-05T21:04:12Z","title":"Large-scale empirical tuning and comparison of default optimizers for variational inference","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-27T20:02:53.485837Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2606.07841"},"observation_digest":"sha256:07154062079861698e9948945b7d2776fcef6bd8408401c290761f1a142b37da","observation_id":"55cc2e41-8829-4821-a7d7-c4d5910f1f3f","resolution":{"observed_at":"2026-07-02T20:57:23.296734Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":"1905.00313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-07-04T06:59:37.573960Z","title":"Hazan and S","venue":null,"work_id":"1fafe5d3-69fe-46c5-b51a-9dfe1038d907","year":1905},"citing_paper":{"arxiv_id":"2606.21354","last_updated":"2026-06-19T11:54:49Z","snapshot_observed_at":"2026-07-06T23:56:21.824303Z","submitted_at":"2026-06-19T11:54:49Z","title":"Restart and Adaptive Acceleration in Stochastic Gradient Methods","version":1},"reference_index":133,"source":"arxiv_source","source_observed_at":"2026-06-26T14:00:19.385619Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2606.21354"},"observation_digest":"sha256:006891bfad1e6cd04ba597f62d4bd6e57b8dde5ad2aae894fd6d6d792fb27dd1","observation_id":"ec36a56a-3b9c-4b04-b1ce-99fe9d0269b8","resolution":{"observed_at":"2026-07-04T06:59:37.575443Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-07-30T15:28:01.799579Z","title":"arXiv preprint arXiv:1905.00313 (2019),https://arxiv.org/abs/1905.00313","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2607.26969","last_updated":"2026-08-04T19:16:45Z","snapshot_observed_at":"2026-08-09T00:33:59.582101Z","submitted_at":"2026-07-29T14:31:24Z","title":"Normalized First-Order Methods for Convex (L0, L1)-Smooth Optimization with Inexact Gradients","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-30T15:28:01.799579Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2607.26969"},"observation_digest":"sha256:d059e523776f29dd5cd76754dffe4c2d51237a0741fb383933f70c32c5eb29c8","observation_id":"5b556308-7a59-4df8-abee-42a4691812e6","resolution":{"observed_at":"2026-07-30T15:28:01.799579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-08-04T10:42:02.988308Z","title":"Revisiting the polyak step size,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2608.02256","last_updated":"2026-08-03T14:03:21Z","snapshot_observed_at":"2026-08-06T23:37:06.146623Z","submitted_at":"2026-08-03T14:03:21Z","title":"Discrete-Time Adaptive Control in High Dimensions: Near Dimension-Free Performance via Mirror Descent","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T10:42:02.988308Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2608.02256"},"observation_digest":"sha256:685a84e48da0c09e4476c4febbf4a800ab1ce9bc98c472cb49f617ac6dda5d7a","observation_id":"200ba93d-aced-47b3-aef4-d3b88a3665b7","resolution":{"observed_at":"2026-08-04T10:42:02.988308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1905.00313/citation-record","integrity":"/paper/1905.00313/integrity","json":"/paper/1905.00313/citation-record.json","paper":"/paper/1905.00313"},"outbound":[],"paper":{"arxiv_id":"1905.00313","last_updated":"2022-08-02T17:48:25Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size"},"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 15 inbound Pith citation observations for arXiv:1905.00313."}