{"as_of":"2026-08-08T04:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ea35fc638b521a7252a8d404fcca9903640360eb16edad3e2bb96eb78f0f408","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:58:16.172148Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.23335/citation-record","integrity":"/paper/2506.23335/integrity","json":"/paper/2506.23335/citation-record.json","paper":"/paper/2506.23335"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:22.059199Z","title":"Katyusha: The first direct acceleration of stochastic gradient methods","venue":null,"work_id":"fdac76c7-3647-4f3b-8a38-c78efdaeb19d","year":2017},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:11.689519Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:a1dfa380c03d0eed31eb5d70bd51512d3fe0486189aa4c347e5d37fc2e85c7f3","observation_id":"117ef500-7b80-4c93-a9be-d1c2afd38f7e","resolution":{"observed_at":"2026-08-06T21:58:22.106772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:21.921037Z","title":"KatyushaX:Simplemomentummethodforstochasticsum-of-nonconvexoptimization","venue":null,"work_id":"c1b98e48-3e04-46ab-98c2-b6fc29c82a85","year":2018},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:11.759867Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:fd75277fc907df987c738fd7d839e52cbdff8c04d4d72cf7e26a8d86e68582b6","observation_id":"0d183afd-14f6-4ccf-a7d8-bc32c24ed996","resolution":{"observed_at":"2026-08-06T21:58:21.978349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:21.768263Z","title":"Variance reduction for faster non-convex optimization","venue":null,"work_id":"229ccd96-8be9-4c56-9dc5-46dc08a62297","year":2016},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:11.840048Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:b0a1a92702eeba9e0e814eb3b58d333b456b2a85c2a2ba4cd5b0f02596a7eb24","observation_id":"336989af-4568-4cbf-ad22-9ed042da6b3f","resolution":{"observed_at":"2026-08-06T21:58:21.872692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:21.643860Z","title":"On the convergence of nesterov’s accelerated gradient method in stochastic settings","venue":null,"work_id":"b62f8a53-0f31-4f97-8a1e-e65ad7e911a0","year":2020},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:11.898060Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:b668366281cf135806da9f62f4e44727c680b111aff3a3f21cb7b9d8efc14c99","observation_id":"9d060bd2-26d1-4406-88a2-1fb21b04b2cc","resolution":{"observed_at":"2026-08-06T21:58:21.706030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:21.456443Z","title":"Gradient convergence in gradient methods with errors","venue":null,"work_id":"ff7fdcef-a7b1-411f-a03c-12abbb075d96","year":2000},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:11.955255Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:3d1caa1a53f8151845a472d1d02820dcb217f5c26dcd1e2a924848f3c569849f","observation_id":"52b1b56d-17ae-4400-84a3-42c1730e2719","resolution":{"observed_at":"2026-08-06T21:58:21.552127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:12.040449Z","title":"Oxford University Press, 02 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:12.040449Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:c940fd575e69f6a8de2d30d00e56a158713622b5643d497df155cc1ce4b03323","observation_id":"b56cb8c7-d3d3-4599-bd8d-ca47679e4611","resolution":{"observed_at":"2026-08-06T21:58:12.040449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:12.128208Z","title":"High-probability bounds for non-convex stochastic optimization with heavy tails.Advances in Neural Information Processing Systems, 34:4883–4895, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:12.128208Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:325a48bc2e323c9cf32e27d6b263d9f705be3b485148ddb8260001537faa2893","observation_id":"b452b4b2-9706-490d-a945-a61ac8dcc115","resolution":{"observed_at":"2026-08-06T21:58:12.128208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:21.189934Z","title":"Stochastic first order methods in smooth convex optimization","venue":null,"work_id":"bc953e6e-e58b-4e4e-9842-1908cbb175d9","year":2011},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:12.190834Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:78d1cfc64435a1676645be6521884e535998d7ca2c778f2fb88200f54bda0334","observation_id":"e994e8cc-0776-4aa1-aae5-6409f56a9546","resolution":{"observed_at":"2026-08-06T21:58:21.315177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2002.06305","last_updated":"2020-02-15T02:40:10Z","snapshot_observed_at":"2026-08-07T15:45:43.952318Z","submitted_at":"2020-02-15T02:40:10Z","title":"Fine-Tuning Pretrained Language Models: Weight Initializations, Data Orders, and Early Stopping","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.06305","snapshot_observed_at":"2026-08-06T21:58:12.293683Z","title":"Fine-tuning pretrained language models: Weight initializations, data orders, and early stopping.arXiv preprint arXiv:2002.06305, 2020","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:12.293683Z"},"links":{"cited_paper":"/paper/2002.06305","citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:326b68b51f40f37172e55361a868a007e4ac266899363f64b85939a31483a795","observation_id":"022713d0-2942-4f9d-bdb6-55ae00c8bcbc","resolution":{"observed_at":"2026-08-06T21:58:12.293683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:20.977163Z","title":"The power of adaptivity in sgd: Self-tuning step sizes with unbounded gradients and affine variance","venue":null,"work_id":"6a4c6c2f-e02f-4dd8-b789-b2f9b0c855b5","year":2022},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:12.413393Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:4211e8465752644e1da5993a33a6f0fb929533a32ea42759cf691214970e6661","observation_id":"a280f997-54fc-4234-9fc9-6d2a9c6b5824","resolution":{"observed_at":"2026-08-06T21:58:21.051339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:20.752886Z","title":"Stochastic heavy ball.Electronic Journal of Statistics, 12(1):461–529, 2018","venue":null,"work_id":"a28e3ff8-5f61-44ee-92ee-26acfd9be9df","year":2018},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:12.523332Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:ed718371643e4b5e0c672db07534ed6f9ac338cb2ffad1799058e149f8a7f76f","observation_id":"653fa8dc-bd1f-4ecd-8751-d68ba5f14259","resolution":{"observed_at":"2026-08-06T21:58:20.866306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:20.562934Z","title":"Stabilized SVRG: Simple variance reduction for nonconvex optimization","venue":null,"work_id":"bee2b6d2-6e46-458f-9d92-bce5eb15835e","year":2019},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:12.661000Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:3b3d9cee7daba2fb0930924671d1430952ba0a071d0fbecb9afaf38d1d7d0bc3","observation_id":"c819efeb-4a34-45f0-b96e-e23394cda9b6","resolution":{"observed_at":"2026-08-06T21:58:20.676197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:20.439213Z","title":"Stochastic first-and zeroth-order methods for nonconvex stochastic programming","venue":null,"work_id":"ebba078a-6ca0-4b70-9c43-ca3f1c324080","year":2013},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:12.744758Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:e6a604368e8200dde6a616bf7a04987eb1751d33d6b597d3508c1e88d09ce614","observation_id":"8859b425-51c2-4f41-84bf-2de8b487ee51","resolution":{"observed_at":"2026-08-06T21:58:20.494280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:20.282349Z","title":"Understanding the role of momentum in stochastic gradient methods.Advances in Neural Information Processing Systems, 32, 2019","venue":null,"work_id":"736d9c9e-9d18-4a46-aeba-9c3fbb7374af","year":2019},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:12.853304Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:981ecdd584726f5ab3811c5f2a4ba6839828843284cf4ec21d2daca59aa54e66","observation_id":"9d6c863b-4a00-4435-8f73-94469f55cc1e","resolution":{"observed_at":"2026-08-06T21:58:20.367268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:12.949155Z","title":"Goodfellow, Yoshua Bengio, and Aaron Courville.Deep Learning","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:12.949155Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:77ce47ca091afaba79ff78da0297e876b5447d43e5574ce12cb669b45769c01b","observation_id":"7a2398fd-95ce-41b5-b67a-43ba9946d9e9","resolution":{"observed_at":"2026-08-06T21:58:12.949155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:20.127816Z","title":"Stochastic optimization with heavy- tailed noise via accelerated gradient clipping.Advances in Neural Information Processing Systems, 33:15042–15053, 2020","venue":null,"work_id":"7f51acf9-1761-4749-87c0-bcaabd81617c","year":2020},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:13.079058Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:a368fa87a2f92c5182d1e0b9698796f2f01c448bb997bb5db443736325add0d2","observation_id":"0b2434b3-f45d-43b0-b82a-28034f50a8a3","resolution":{"observed_at":"2026-08-06T21:58:20.178360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:13.205688Z","title":"Tight analyses for non-smooth stochastic gradient descent","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:13.205688Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:1756b761e9232f315f1268a174a6e4daf81a6aba46eae44fd207822699e77a3b","observation_id":"d9d7dddd-5078-410b-8ed2-3c827f8ee529","resolution":{"observed_at":"2026-08-06T21:58:13.205688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:19.930888Z","title":"Making the last iterate of SGD information theoretically optimal","venue":null,"work_id":"97454775-9a40-4780-92a9-b7ccdd8ea571","year":2021},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:13.278935Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:4eb2ae76ce9fc6f863719a380940fb8bd91b6f253d9b237c613b47d41561be27","observation_id":"c135eb54-c9f6-4b54-80ed-26f72a51579c","resolution":{"observed_at":"2026-08-06T21:58:20.007728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:13.341562Z","title":"Accelerating stochastic gradient descent using predictive variance reduction","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:13.341562Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:edf9fe7ee183abdbdad39aea9a1ea55379065998c2a7cbeaa4f3cebf0f73fa59","observation_id":"f51eeb78-f867-44ec-be48-971d6e0f55cf","resolution":{"observed_at":"2026-08-06T21:58:13.341562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:19.738397Z","title":"Linear convergence of gradient and proximal-gradient methods under the polyak-łojasiewicz condition","venue":null,"work_id":"eebbaca5-dd41-4eed-b999-ce64f3a8f421","year":2016},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:13.410175Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:9d6d45d4a8975972a2c9b6ca1e7e842451a5e9dd7fb401d2df5325c2229d8ad3","observation_id":"bf0716f3-ebd8-4b0b-a886-d898db2f3ae4","resolution":{"observed_at":"2026-08-06T21:58:19.834673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:19.556961Z","title":"High probability bounds for a class of nonconvex algorithms with adagrad stepsize","venue":null,"work_id":"254b9fd3-54de-40dd-b400-a5c2cc3e373a","year":2021},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:13.459711Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:a7c8d1c5c0c9b76f1414fdd6a8ae83c5a57ba4aaff6fe20c355fa61963009935","observation_id":"3503eb94-4bbc-40c4-8211-db993c7235a5","resolution":{"observed_at":"2026-08-06T21:58:19.621557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:19.385752Z","title":"On the insufficiency of existing momentum schemes for stochastic optimization","venue":null,"work_id":"3d948cf9-88cb-4020-b27a-65752c07cc04","year":2018},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:13.599031Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:fdb1dfc48a5e04e7011090e755f27f7e8eb826c47c916d06fa9a7856b6c77b0b","observation_id":"b4b09144-7881-43a7-a90e-d123f7b8335e","resolution":{"observed_at":"2026-08-06T21:58:19.475227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:19.171649Z","title":"Stochastic estimation of the maximum of a regression function.The Annals of Mathematical Statistics, pages 462–466, 1952","venue":null,"work_id":"f3628b8f-843f-4b00-963d-c2ad969c3588","year":1952},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:13.668389Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:74a26a44555468b6de64b31387c98e418580833a21e4004a88d8b9eb60749636","observation_id":"8b4d9f79-aefa-4a87-b501-87fe4f3f9e89","resolution":{"observed_at":"2026-08-06T21:58:19.298169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:19.011749Z","title":"Kushner and Hai Huang","venue":null,"work_id":"ebce6507-64c4-4d9a-bf28-ca2546717e6e","year":1981},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:13.735270Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:b6c2338322680655ba7178d0be785205fd9f9f478ddb2e44645aaa4827d532ab","observation_id":"8e9ff5cc-ea96-449b-9bc6-d8d068110a98","resolution":{"observed_at":"2026-08-06T21:58:19.099508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:18.861921Z","title":"An optimal method for stochastic composite optimization.Mathematical Programming, 133(1-2):365–397, 2012","venue":null,"work_id":"4e3adbb8-f0bc-40e8-a798-8e263e45a067","year":2012},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:13.843232Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:02d738c01ba9cc3194e0eaeb691f8e60265155086165b90e5cf81385fba7c7df","observation_id":"e08f7b85-d87e-4510-9692-eefc137a2f7e","resolution":{"observed_at":"2026-08-06T21:58:18.919139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:13.932964Z","title":"Springer, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:13.932964Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:4f2f42d35e39db19ec5383ce69ce9e0bbd9a9c3ef2fb365d10a7b9a39176425b","observation_id":"34ca3088-321c-429a-a5d2-98256491880e","resolution":{"observed_at":"2026-08-06T21:58:13.932964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:18.661617Z","title":"Validation analysis of mirror descent stochastic approximation method.Mathematical programming, 134(2):425–458, 2012","venue":null,"work_id":"5f52e6f2-c150-4d81-8d44-33463fce83ea","year":2012},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:14.061415Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:f45980ed27e3071166a53614cd7b875d3136ee53f4b0bc4bc7689f7bb0da4b99","observation_id":"1ec68be0-002f-4a53-895f-7c4dc824d941","resolution":{"observed_at":"2026-08-06T21:58:18.747676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:18.505729Z","title":"High probability guarantees for nonconvex stochastic gradient descent with heavy tails","venue":null,"work_id":"06a65eb1-59f0-4ff8-870d-09218952733b","year":2022},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:14.153123Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:1e8e158cf0be892420441cf1e33d467b5426af4286602b6d4cfe629b6f9e5a8d","observation_id":"cd07e7dc-bfec-4942-af74-64b295e3683d","resolution":{"observed_at":"2026-08-06T21:58:18.591134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:18.341477Z","title":"On the convergence of stochastic gradient descent with adaptive stepsizes","venue":null,"work_id":"6f1e7cb7-3b08-4021-b5e2-d539e35692ee","year":2019},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:14.244296Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:85bf1488190f8c8e615f59dea72dfc45700a5dd37fe78170725d1e2b257ac137","observation_id":"d63ad830-ed82-46c0-a991-62283bcb1ef1","resolution":{"observed_at":"2026-08-06T21:58:18.423525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:18.200370Z","title":"A high probability analysis of adaptive sgd with momentum","venue":null,"work_id":"648396a0-162f-43c3-ad83-6a2e28f4f2a2","year":2020},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:14.368710Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:d101d8971b5f9fc1abb6b5e85ebf785f79e1dbd07a9dd2543d371301045e96ea","observation_id":"0a494767-2a9d-4bd1-92ab-05990cd2e010","resolution":{"observed_at":"2026-08-06T21:58:18.246187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:14.473337Z","title":"An improved analysis of stochastic gradient descent with momentum","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:14.473337Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:6a7d4d08a01397ff9381832e4d20952339cddaa83e42ad8a97509cddda6f6c2a","observation_id":"41515cc5-7c9d-4229-97f9-f5cfb1401727","resolution":{"observed_at":"2026-08-06T21:58:14.473337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:14.623938Z","title":"High probability convergence of stochastic gradient methods","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:14.623938Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:cbf22c6d85245a54b8a16e7730e1b62130551c9b18ea4246611a000f6a84d1e3","observation_id":"e3c557e4-cc67-40b4-b68a-42ae1b54114d","resolution":{"observed_at":"2026-08-06T21:58:14.623938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:14.739761Z","title":"Revisiting the last-iterate convergence of stochastic gradient methods","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:14.739761Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:8dea000b5f054a5d14d14b3211c2825c7de0dc35afc2c94cd2fd9af3ea7c63ae","observation_id":"af95c303-fbb8-41ba-bde3-8d412c531fa2","resolution":{"observed_at":"2026-08-06T21:58:14.739761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:14.838195Z","title":"High-probability convergence bounds for non-convex stochastic gradient descent.arXiv preprint arXiv:2006.05610, 2020","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:14.838195Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:9ac02a3940d2fc4abb8f950955611c58a86db3bcd2c3ebbdc67fed9a727a2958","observation_id":"b5ee906e-0e1d-40cf-b860-a6d3b74a9939","resolution":{"observed_at":"2026-08-06T21:58:14.838195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:18.067947Z","title":"Algorithms of robust stochastic optimization based on mirror descent method.Automation and Remote Control, 80:1607–1627, 2019","venue":null,"work_id":"91d89f55-c6d7-457b-897b-b901d0861a5d","year":2019},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:14.934698Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:71596fb1c9fa9965b24ca33af4df947ade5a7f883dc6d622fd47b59df5a44041","observation_id":"36e44824-f084-4829-a26a-19c0c6400df5","resolution":{"observed_at":"2026-08-06T21:58:18.094461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:17.826577Z","title":"Robust stochastic approximation approach to stochastic programming.SIAM Journal on optimization, 19(4):1574–1609, 2009","venue":null,"work_id":"d5826fad-d545-4131-9748-1e74554a6912","year":2009},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:15.025410Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:05c2e3eb91845c0bb9db7cd73e083c2a6e082d355379abcb090ff27d02b6f5e1","observation_id":"e0d91a0c-4cac-4b0c-93ec-7569d6e2e4c4","resolution":{"observed_at":"2026-08-06T21:58:17.933716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:15.145389Z","title":"Early stopping-but when? InNeural Networks: Tricks of the trade, pages 55–69","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:15.145389Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:41759bfa0a52c43b04df0b6ae870d4e44d2ec4e01752e9ca372ad6b105c86876","observation_id":"24b9af45-a705-49cd-894e-4444cb898cd6","resolution":{"observed_at":"2026-08-06T21:58:15.145389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:17.552095Z","title":"Robbins and D","venue":null,"work_id":"8ecf0ef3-2154-4cea-bb38-25cc0c5477ca","year":null},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:15.280422Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:e49f53788ee59b5ac89e13152d7b41f6faa1584f740ff9577e56c1d2f303bfdc","observation_id":"f3d33cad-e170-40ee-a06e-29033d86e678","resolution":{"observed_at":"2026-08-06T21:58:17.654208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:17.380812Z","title":"Rustagi, editor,Optimizing Methods in Statistics, pages 233–257","venue":null,"work_id":"1a29a43b-9d76-46a1-97ef-491a9ddc92bc","year":1971},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:15.364727Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:73f57495aee5e0ef7202e21676f2ca1e8dd19bd102164a97e3ef81ac7ea4d70c","observation_id":"05b5e893-c7c2-4c2f-88fa-fab2bfec96c1","resolution":{"observed_at":"2026-08-06T21:58:17.472358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:15.441369Z","title":"A stochastic approximation method.The annals of mathematical statistics, pages 400–407, 1951","venue":null,"work_id":null,"year":1951},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:15.441369Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:678b13162e220adcd4359fc06ca04a0e73be744f9572cc5eaa721385952a7680","observation_id":"c26f7a77-da2b-4c85-a5b2-97657f3b7eea","resolution":{"observed_at":"2026-08-06T21:58:15.441369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:17.144729Z","title":"Almost sure convergence rates for stochastic gradient descent and stochastic heavy ball","venue":null,"work_id":"b355d8f3-1b00-4847-80e8-d1418d7d86b4","year":2021},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:15.511998Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:48e3a08970f1516b660d00fca42cc2019ef3e7f94c97bfa8d57c5841aac08923","observation_id":"0bd7bf79-e673-45a8-8eb9-29089aa0ac20","resolution":{"observed_at":"2026-08-06T21:58:17.258755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:16.958923Z","title":"Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes","venue":null,"work_id":"e107603e-89ed-411b-937c-03556068334f","year":2013},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:15.600986Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:6e73c5d4b981689a8a18cc0516d90c8580100ccecc931fc6ca2cce17300377f2","observation_id":"dd4c3791-d256-4deb-a187-d3147823b0a9","resolution":{"observed_at":"2026-08-06T21:58:17.063281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:15.722439Z","title":"High-dimensional probability: An introduction with applications in data science, volume 47","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:15.722439Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:9c9450f6d717b8ea1aed2c8ff1bb73e5c6cc4332357be42d2d251218a454417a","observation_id":"3c8b564d-4277-469b-9af9-faa8a7bab1ec","resolution":{"observed_at":"2026-08-06T21:58:15.722439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:15.794140Z","title":"Etude critique de la notion de collectif","venue":null,"work_id":null,"year":1939},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:15.794140Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:85c02641640ae18615b6d7f625b4cc48c0c270bcf19a3e47e750be9d17d7e2b3","observation_id":"550e24fe-f1ee-4dc0-8409-0c428820a33f","resolution":{"observed_at":"2026-08-06T21:58:15.794140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:16.751285Z","title":"Cambridge University Press, 2019","venue":null,"work_id":"03e34985-a1e2-420a-9a57-56a2ccfc593d","year":2019},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:15.933788Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:1bd1f44bc046b14c6d0e2584eaffcb177ba92b9c19b8c4513970e52c442bb11a","observation_id":"e7e5571a-5c34-4429-8a17-036b0f239bc5","resolution":{"observed_at":"2026-08-06T21:58:16.842013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:16.556569Z","title":"Adagrad stepsizes: Sharp convergence over nonconvex landscapes","venue":null,"work_id":"396f3377-3bc3-4cf4-9ea8-083724f3096d","year":2020},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:16.017353Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:00694ee541a90a39d368a5e4027699c18bf0aa2e477174893af551fe2bc1e7a6","observation_id":"b72bd498-2e07-4f0e-aad8-262445373e64","resolution":{"observed_at":"2026-08-06T21:58:16.655757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1808.10396","last_updated":"2018-08-30T17:00:03Z","snapshot_observed_at":"2026-08-07T22:34:26.463148Z","submitted_at":"2018-08-30T17:00:03Z","title":"A Unified Analysis of Stochastic Momentum Methods for Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.10396","snapshot_observed_at":"2026-08-06T21:58:16.108035Z","title":"A unified analysis of stochastic momentum methods for deep learning.arXiv preprint arXiv:1808.10396, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:16.108035Z"},"links":{"cited_paper":"/paper/1808.10396","citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:375553578ee3399da228ba3e432eb934de10007ab4af31c25bf5e23351c4bf27","observation_id":"d7bd50e3-7bb5-4320-bc73-88e7165168ee","resolution":{"observed_at":"2026-08-06T21:58:16.108035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:58:16.422013Z","title":"Why are adaptive methods good for attention models?Advances in Neural Information Processing Systems, 33:15383–15393, 2020","venue":null,"work_id":"0cb8d0c9-c48d-462f-8dbb-96438c48081d","year":2020},"citing_paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T21:58:16.172148Z"},"links":{"citing_paper":"/paper/2506.23335"},"observation_digest":"sha256:6602df8c7e1d32765cd10304152570c0d4cbffd59e32e0d0485482ace116cf7c","observation_id":"6718a9ae-6904-4004-ae2d-4056eadedc93","resolution":{"observed_at":"2026-08-06T21:58:16.472173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2506.23335","last_updated":"2025-07-16T16:03:51Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T21:43:05.910863Z","submitted_at":"2025-06-29T17:09:58Z","title":"Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":32},"total_outbound_references":48},"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 8 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2506.23335."}