{"as_of":"2026-08-10T17:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:61c792f9dad8469bfc29b1a0d702f1a5f3a0d1de3762f0f2658c4d5500b849e7","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T10:16:45.420814Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2604.15526/citation-record","integrity":"/paper/2604.15526/integrity","json":"/paper/2604.15526/citation-record.json","paper":"/paper/2604.15526"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"40a1b0ee-d662-4ee1-923a-2bbebcb0465a","year":2020},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:5d9d35eb9c23c784db34a7628a2feb6076c04d3664c2a5d4c6b9d2a056b371af","observation_id":"53a2135b-1ab9-4af7-b98f-5102c1f98586","resolution":{"observed_at":"2026-05-20T00:53:18.624739Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems.SIAM journal on imaging sciences, 2(1):183–202","venue":null,"work_id":"ba0e1a0d-409a-40c5-9955-4ec173dd77c4","year":2009},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:b2f2b2aaea6a6453aece0d05e3c970e54483d2eee8d6ef1a38dbe8eb701aab5a","observation_id":"8a6fa82e-361b-4370-8b01-27385b06bb50","resolution":{"observed_at":"2026-05-20T00:53:18.639447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A stochastic cubic regu- larisation method with inexact function evaluations and random derivatives for finite sum minimisation","venue":null,"work_id":"4b2253b9-24bb-4a31-acf8-b604e6e6957b","year":2020},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:a190d1ab1d805dbb4557c2b9628d8f3f6194e1a080a5b266903209aa5673e5ad","observation_id":"b2bfa153-8bc1-4c6f-b1a1-dd1d8392dae1","resolution":{"observed_at":"2026-05-20T00:53:18.621066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives.Journal of Complexity, 68:101591","venue":null,"work_id":"b9ea4243-ba5c-436f-aa54-305148b0baf4","year":2022},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:34b6d9bea6f3a15bb6d7862928e60988901bec825b5994e7f33ab724fcc9c4cf","observation_id":"afe17fb2-7e03-441c-b744-41f412e4903c","resolution":{"observed_at":"2026-05-20T00:53:18.632113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cao, and Katya Scheinberg","venue":null,"work_id":"452ed213-2eb4-4026-8cad-2cf8aa55e359","year":2021},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:05c979e6992bd674fdf1167fe4341a9af9edf611927a70c0c4dd482bfd3b258c","observation_id":"b7423766-f180-4b6e-9b11-4f2b8dcca8d3","resolution":{"observed_at":"2026-05-20T00:53:18.635565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Berahas, Liyuan Cao, Krzysztof Choromanski, and Katya Scheinberg","venue":null,"work_id":"f1e6198c-8715-401a-b549-0d543c541287","year":2022},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:047a455ef8f0e5a82dcd8b990c7b408be183e2effad185b9c40702d58cfa011b","observation_id":"d1c5c774-7d66-4bb7-a508-5cf1957ae32b","resolution":{"observed_at":"2026-05-20T00:53:18.628361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Berahas, Miaolan Xie, and Baoyu Zhou","venue":null,"work_id":"d26c8a68-4fd7-4f8b-bd08-db47bad94b4c","year":2025},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:7fef1af207690ecef4c3c22d45a548a08c8a3fd2a1b496a915bff61b7314a8c8","observation_id":"f2320731-0d54-4322-8d86-c098633028ab","resolution":{"observed_at":"2026-05-20T00:53:18.616835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On biased compression for distributed learning.Journal of Machine Learning Research, 24(276):1–50","venue":null,"work_id":"2659f1cc-2348-4044-a51c-d083b4883a36","year":2023},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:d412c2df83a5f3520930356d602552c36a7110d1d611a23e853790e118f58768","observation_id":"a3e9f37f-a0ff-4955-9391-0da94fd635ed","resolution":{"observed_at":"2026-05-20T00:53:18.588143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Convergence rate analysis of a stochastic trust-region method via supermartingales.INFORMS Journal on Optimization, 1(2):92–119","venue":null,"work_id":"42474001-867a-4418-a3f3-26208c458073","year":2019},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:955087e96aaafa29119ed93836bacf6df8449b63e6f7afc08ffea2716e8f16af","observation_id":"7c2a81ff-0041-4210-8670-23c400c419a4","resolution":{"observed_at":"2026-05-20T00:53:18.611027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Backtracking strategies for accelerated descent methods with smooth composite objectives.SIAM Journal on Optimization, 29(3):1772–1798","venue":null,"work_id":"53962984-9ce5-46f9-b88a-1548521179cb","year":2019},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:23e7b6c5dfac7fe59e879d586d559b2f7c5904d31a29d4eed443f6e32fc98460","observation_id":"cd028814-7a43-469a-9f04-189e98b4c7a5","resolution":{"observed_at":"2026-05-20T00:53:18.591545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Berahas, and Katya Scheinberg","venue":null,"work_id":"adacacc1-8438-49c5-a319-6ee570af5ab1","year":2024},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:d22d9ddc3b7d448f2cbd82d3aa042db6ebd577e563f8ef2331f91e986a1cabc7","observation_id":"354d4bbf-17d2-456c-8a6a-f5085cffa788","resolution":{"observed_at":"2026-05-20T00:53:18.601225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cartis and K Scheinberg","venue":null,"work_id":"03b1bd7e-57d5-4f55-a8de-6b810f75d604","year":2018},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:060cc89ea694f19b10d37feb97ebf13b13dc210b73d8cd42fe52c9c4ade40b51","observation_id":"2a830a8d-3745-49f0-ba69-ea300d3131f1","resolution":{"observed_at":"2026-05-20T00:53:18.643134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Convergence analysis of accelerated stochastic gradient descent under the growth condition.Mathematics of Operations Research, 49(4):2492–2526","venue":null,"work_id":"c9d30132-0a13-4e5b-a845-40897d64ec16","year":2023},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:61e1a1b2b38479872ad53ebef5eebbf2caa117fdfc859f2f5edd5d3ec97a2441","observation_id":"415069a8-d4b6-4c35-b3dc-edb2707d2942","resolution":{"observed_at":"2026-05-20T00:53:18.613042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Smooth optimization with approximate gradient.SIAM Journal on Optimiza- tion, 19(3):1171–1183","venue":null,"work_id":"41830da4-1329-4d4f-b8c3-349161d08916","year":2008},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:b0392ace198aab6f707ca422ef9a0d7b4597ae6c977a0f4c577687c6b8681685","observation_id":"26557d0e-b1ee-4a39-afe3-2ebf44f66865","resolution":{"observed_at":"2026-05-20T00:53:18.584969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Intermediate gradient methods for smooth convex problems with inexact oracle","venue":null,"work_id":"d03cdcb2-6622-42bc-b87f-0909c59ee256","year":2013},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:cbc27e17fcddcf2c04eb32a51700d9e31eb9f6c66b7470bd010ec4668d318e83","observation_id":"1e2fefe6-a82f-4d1b-8406-c0140820d114","resolution":{"observed_at":"2026-05-20T00:53:18.595738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"First-order methods of smooth convex opti- mization with inexact oracle.Mathematical Programming, 146:37–75","venue":null,"work_id":"4014560e-3bbd-4f57-80c7-cdcf10d920f7","year":2014},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:51938afbbfb397a9aa3b4f5ad426763fe33efa6cd89382a180f1911bf16ebe70","observation_id":"e3dd1ec1-5564-4428-b0c6-940cba2b42cb","resolution":{"observed_at":"2026-05-20T00:53:18.604881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fallah, K","venue":null,"work_id":"586b2e32-1c7c-4740-9278-5f1d4c331a10","year":2022},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:edc0113a15b538a032302299c2286ced6dbe5d38eb837845244dfe95dc97b710","observation_id":"aee3452a-a85a-4441-9ee3-33eb08543a79","resolution":{"observed_at":"2026-05-20T00:53:18.550571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deviation inequalities for martingales with applications","venue":null,"work_id":"021890d5-5b3b-456d-a8aa-660f17765811","year":2017},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:ae92d1d9be9123a859fd7c5df7ff97d302c1dbe92705ae2842730e52e9baf835","observation_id":"7af3ab92-f6f3-41f1-aa93-dd5a9d096f0f","resolution":{"observed_at":"2026-05-20T00:53:18.576965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"High probability complexity bounds of trust-region stochastic sequential quadratic programming with heavy-tailed noise","venue":null,"work_id":"8fbb128f-733c-42fb-9f76-8c6b40a91b00","year":2025},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:cf784c4b081fff19cb7a7c439a9bd03aca6411e9fe5f40a7b200524347a12ab6","observation_id":"d09ad99f-ef07-41a4-a492-5f4d641af822","resolution":{"observed_at":"2026-05-20T00:53:18.587624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stochastic optimization with heavy- tailed noise via accelerated gradient clipping.Advances in Neural Information Processing Systems, 33:15042–15053","venue":null,"work_id":"122c542f-84e6-44e6-9a99-cabb16a5549f","year":2020},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:180c44b3262e63fc1ab9f460105de57351b386fca7591957a61b2fcb356ccf0a","observation_id":"54c1361b-b568-4d76-89d4-a6d7eddcdaa6","resolution":{"observed_at":"2026-05-20T00:53:18.573639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Siegel, and Stephan Wojtowytsch","venue":null,"work_id":"03ce64f3-5651-4ff3-8dfc-62a335abdcaf","year":2024},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:742b85ffbb433c37434d8d5de69374a2a05a2f84722c1a80642e64c59e9741ed","observation_id":"7cb5e0be-998f-4188-9348-0a9340ea4c18","resolution":{"observed_at":"2026-05-20T00:53:18.519441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robustly stable accelerated momentum methods with a near-optimal l2 gain and h∞ performance","venue":null,"work_id":"f7da2ee0-caf3-46fa-9166-379ddca5b807","year":2023},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:b3c36f10062d3a56a4b6dffb74c2eb2f697e35b5d94e8f22cf6c946cc95d8ad9","observation_id":"ca63d36e-824a-4c1f-9b54-8fc6304f554c","resolution":{"observed_at":"2026-05-20T00:53:18.604432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Accelerated gradient methods with biased gradient estimates: Risk sensitivity, high-probability guarantees, and large deviation bounds","venue":null,"work_id":"0b3b1326-83b8-40e9-9987-1f13c72626c8","year":2025},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:881091674bad8c65180fefc40a09d74026a5970704efe489f2282fd5ab21e84b","observation_id":"7bd0451f-1700-4f50-8d75-a1d837c398b4","resolution":{"observed_at":"2026-05-20T00:53:18.557764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"High probability complexity bounds for adaptive step search based on stochastic oracles.SIAM Journal on Optimization, 34(3):2411–2439","venue":null,"work_id":"7b735667-f27a-4ef7-b258-cf687dcecd02","year":2024},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:2dc60d0d2813bcc895d1e77b5d8fbfbc7c5f79f606d7404b1b59d899d20da3eb","observation_id":"e9c5beed-f20d-4f22-86c2-eccba99cdc81","resolution":{"observed_at":"2026-05-20T00:53:18.534191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sample complexity analysis for adaptive optimization algorithms with stochastic oracles.Mathematical Programming, pages 1–29","venue":null,"work_id":"08925540-f2cb-46d3-8482-9dfcb55af760","year":2024},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:a84ee5347d7ebbcfb6f38f3700904fecfa1aacb9655c4bcb01e90ed596ccb384","observation_id":"777a5cd9-fb62-4300-9659-7988588ba4f4","resolution":{"observed_at":"2026-05-20T00:53:18.505853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Error feedback fixes signsgd and other gradient compression schemes","venue":null,"work_id":"5b2c3ec7-a81a-4601-9109-89d0d70109ea","year":2019},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:ae2471057d7ffdc48c4f2e4e000ce2006261cb3f9ef45841c16ea3b1faa50200","observation_id":"9c50df80-37bd-4f00-b7d4-d9752524e25c","resolution":{"observed_at":"2026-05-20T00:53:18.565181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Intermediate gradient methods with relative inexactness.Journal of Optimization Theory and Applications, 207(3):62","venue":null,"work_id":"e2ee5183-1298-492b-bc96-aab25aca6f11","year":2025},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:a100c43ff9f59752ac5b9bf7868edf5b2926fab02026320ee7baaf32b667492e","observation_id":"29368b10-ba51-4b58-bc70-6f8265bea357","resolution":{"observed_at":"2026-05-20T00:53:18.548750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Estimate sequences for stochastic composite optimization: variance reduction, acceleration, and robustness to noise.J","venue":null,"work_id":"c74d1190-1cb8-459f-ab5a-b5f17b6a784f","year":2020},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:294788dadb0349a1706cda4af46bd88299c235e342633aa18a9baed86186e090","observation_id":"00880e8a-fad5-4cc4-9c8d-b0d45a9b2257","resolution":{"observed_at":"2026-05-20T00:53:18.544883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"undefinedlker Birbil, Mert G¨ urb¨ uzbalaban, and Sinan Yildirim","venue":null,"work_id":"e37e205b-cae2-4721-b1cd-b1c44aadae1e","year":2022},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:2eb228669a9fc2400da1377f453a9392fbfddfc40c4ca3672a891515e5fd0366","observation_id":"0cb26e7e-b33e-48ec-a53a-19eb75260370","resolution":{"observed_at":"2026-05-20T00:53:18.581285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Shanbhag","venue":null,"work_id":"07ba03dc-1022-41d6-9600-8862682f55a2","year":2024},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:4ceea8c67fc5857b01e50f0a8157e9cfdcbc1cbc3d5342debc8f31e8e7998f5e","observation_id":"7eedfd48-b28f-4ce4-b94c-213333aee052","resolution":{"observed_at":"2026-05-20T00:53:18.600903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nonasymptotic analysis of accelerated methods with inexact oracle under absolute error bound","venue":null,"work_id":"16188054-d5f7-4474-a2a2-5ffa0bed4158","year":2025},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:9849de7a16d348d0ffa96c001b40cf25086403342be772c0bad6844bd305c698","observation_id":"73d06288-0abf-4958-bac1-4625ecf60c6a","resolution":{"observed_at":"2026-05-20T00:53:18.561609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Accelerated first-order methods for convex optimization with locally lipschitz continuous gradient.SIAM Journal on Optimization, 33(3):2275–2310","venue":null,"work_id":"4edfe4d7-01e1-4026-9755-b9aff7d4f62b","year":2023},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:3c5c32c42f3a9f34bea2a915cc4cc34a08b0bc57fd016e239b2cbc1be55cde1c","observation_id":"c903d119-b251-4a83-845f-7c01a5d5cc3d","resolution":{"observed_at":"2026-05-20T00:53:18.564647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Jovanovi´ c","venue":null,"work_id":"95645bff-0621-4a57-9308-7422e20ece3c","year":2025},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:a14c66523a332f4b2cca98eaeb99bfd91f20882ef478d407a9200d36d206dc33","observation_id":"b7f1afbd-b72a-4fbb-b80e-3a85d68dc241","resolution":{"observed_at":"2026-05-20T00:53:18.569915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gradient methods for minimizing composite functions.Mathematical programming, 140(1):125–161","venue":null,"work_id":"7c9d2714-8e0f-4fdf-9003-d68aae1e2cad","year":2013},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:9f410c13b3056a0806e6ef826b82ef243c22e84411fa34b4fde548d14ef86589","observation_id":"fa2a74aa-cf92-428a-bfc3-b5f9f612ded0","resolution":{"observed_at":"2026-05-20T00:53:18.518911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A method for solving the convex programming problem with convergence rateo(1/k 2)","venue":null,"work_id":"427296a4-1d37-475c-bf70-a656f9c43b36","year":1983},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:e4c0dbc45d9f2f2bfc4fb5509904930ab9cb0a2342ea369e04de72062db1060b","observation_id":"c1f8d595-f112-41e8-a5fe-087f2b69f6ac","resolution":{"observed_at":"2026-05-20T00:53:18.526715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2402.15646","last_updated":"2025-02-13T04:24:32Z","snapshot_observed_at":"2026-08-10T09:10:59.219592Z","submitted_at":"2024-02-23T23:07:59Z","title":"Stochastic ISTA/FISTA Adaptive Step Search Algorithms for Convex Composite Optimization","version":2},"cited_work":{"arxiv_id":"2402.15646","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.15646","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stochastic ista/fista adaptive step search algorithms for convex composite optimization","venue":null,"work_id":"29c08887-c56a-4bc5-b98a-03824f83085a","year":2024},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"cited_paper":"/paper/2402.15646","citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:109cc9fe1f4dcb06f4233de251b9df96f2b8ea78e0a090b2e6656dad8fe40032","observation_id":"1aa08b33-3f43-4d09-adff-8f88fb5da22e","resolution":{"observed_at":"2026-05-10T10:19:20.663097Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nguyen and Trang H","venue":null,"work_id":"b2f4ad09-d0c8-4e1f-96fb-0ee593ea4fbf","year":2023},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:404f78c3569d1800415e062492d4e92e18f3d08d09391e78dc0081f0a94812d0","observation_id":"5f9289ac-9040-419b-83c1-43b87dc8a945","resolution":{"observed_at":"2026-05-20T00:53:18.573012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improved convergence in high prob- ability of clipped gradient methods with heavy tailed noise","venue":null,"work_id":"11527180-d520-4bf7-910f-b947da619936","year":2023},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:1660d54dad36d986cf31ecd7b8af8111a9580417eeb9ffaf754700fabf55f240","observation_id":"3883bce0-0593-44bd-a25a-9bec2bb86d37","resolution":{"observed_at":"2026-05-20T00:53:18.581068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A stochastic line search method with expected complexity analysis.SIAM Journal on Optimization, 30(1):349–376","venue":null,"work_id":"34138102-e3c6-40ae-9d5d-4a099ee09f7b","year":2020},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:3872fc74c547067c307e479af2d022a984804c464f8f55d54fd2a71bf187dfe7","observation_id":"81d667e8-842b-459e-bb41-0990bd462254","resolution":{"observed_at":"2026-05-20T00:53:18.488481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Moment inequalities for sums of dependent random variables under projective condi- tions.Journal of Theoretical Probability, 22(1):146–163","venue":null,"work_id":"9a7701fb-3c97-45e9-8704-8da5adb562fd","year":2009},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:8402d9bfc073348bc9019dc16f3ccc7f6bdf8dfe917bfa9b54b8cca3cede4798","observation_id":"011e8674-f28d-441f-bf67-b72667de3d5b","resolution":{"observed_at":"2026-05-20T00:53:18.547229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast first-order methods for composite convex opti- mization with backtracking.Foundations of Computational Mathematics, 14:389–417","venue":null,"work_id":"f90968eb-2503-4ddd-8daf-751226382e19","year":2014},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:ca4922a482871faf3caa366b3689c50402b24d313c3ddbbfd0787f19c25fc08d","observation_id":"8af25a41-7ff1-4e04-ace8-5536932ee04d","resolution":{"observed_at":"2026-05-20T00:53:18.481260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stochastic adaptive regularization method with cubics: A high probability complexity bound","venue":null,"work_id":"5bdc1a2e-948e-4a11-aa70-ed426cd9637f","year":2023},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:8f92c99e9f67f066307b4c1e1a1f0de557a5cd29564a85db6a73c785991ff632","observation_id":"4db857de-5ae7-4a42-816b-266f100f60c9","resolution":{"observed_at":"2026-05-20T00:53:18.538146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stochastic adaptive optimization with unreliable inputs: A unified framework for high-probability complexity analysis","venue":null,"work_id":"bbc92457-5fe1-4ae3-8c75-43d94b538e70","year":2025},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:8d7e2df185e6adea4f172533fab26bda21b1e5e5e504c8fc03275f6201677fc7","observation_id":"5cb85e3e-a744-4f80-b898-4b543c4fb1dc","resolution":{"observed_at":"2026-05-20T00:53:18.473490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast convergence of stochastic gradient descent under a strong growth condition","venue":null,"work_id":"8a1010e8-7f52-4b2f-b094-cf525d9b2174","year":2013},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:1430d5e931f9dd854d52b9b5ba5a06ddc99bae0488b6e0b5e729042a96cb59cf","observation_id":"7b988c09-1a23-4702-9f23-50daa619de7d","resolution":{"observed_at":"2026-05-20T00:53:18.514891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Convergence rates of inexact proximal-gradient methods for convex optimization","venue":null,"work_id":"b1169660-e6b0-413c-aed5-d390c53d150e","year":2011},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:b86ab16241323b923cb2b4411adb1f9e3e6a71d50f3fc4a14e0d75cad8e35a8d","observation_id":"9bb4bce4-49ea-4e4d-b1f6-a7da8e01e3f2","resolution":{"observed_at":"2026-05-20T00:53:18.476562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Understanding the acceleration phenomenon via high-resolution differential equations.Mathematical Programming, 195(1):79–148","venue":null,"work_id":"d300ae47-c701-4b1d-8b7e-5fb22d5e8604","year":2022},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:bcd31027197659f3ccbd77393e39031666642a980190365a29b825f891f240fe","observation_id":"675cd7a7-5dd9-4fc0-9e63-a0a0e4c98c18","resolution":{"observed_at":"2026-05-20T00:53:18.467915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A tail-index analysis of stochastic gradient noise in deep neural networks","venue":null,"work_id":"e3b0d083-4e87-47c0-8c67-53be1c4b6049","year":2019},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:3f67660f124a8a972e3f806c09dcc8efbbff8db3fa40336bd3ba30c28cf302f3","observation_id":"4beea5a0-47dd-4ec2-b54c-3e3d2733025b","resolution":{"observed_at":"2026-05-20T00:53:18.504008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A differential equation for modeling Nesterov’s ac- celerated gradient method: theory and insights.The Journal of Machine Learning Research, 17(1):5312– 5354","venue":null,"work_id":"d53fbeaf-ccca-4138-821e-c643c5cc0449","year":2016},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:bbfc1eb781f80ad52946b82bcb2965435c6693328c50be9715f03429b9b9376c","observation_id":"fa02e1d1-170b-4dfa-a1dc-9997bea712ac","resolution":{"observed_at":"2026-05-20T00:53:18.507697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tran, Katya Scheinberg, and Lam M","venue":null,"work_id":"67a5f0d6-04d5-498f-89fb-fe09d9e972bb","year":2022},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:f066dc53e46a72ef0d5c14cece366a58678c6ac3f9e6585ea64c34e43b631972","observation_id":"2c233374-6a99-4a54-b48b-6ce23c99c78e","resolution":{"observed_at":"2026-05-20T00:53:18.510898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On accelerated proximal gradient methods for convex-concave optimization.SIAM journal on optimization","venue":null,"work_id":"a7b18885-dc67-4116-a284-255a0c6dc5ad","year":2008},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:0e3929644c7d7485d95fb36ac314416aa3b6aecc73912c286d85592e8cf544ac","observation_id":"ef569a0d-e882-457e-803e-7f706355d894","resolution":{"observed_at":"2026-05-20T00:53:18.554247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Inequalities for therth absolute moment of a sum of random variables, 1≤r≤2.The Annals of Mathematical Statistics, 36(1):299–303","venue":null,"work_id":"6d6edd7b-d67b-466d-a8e6-28014bab8c91","year":1965},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:087fff63e7612ecf8d1e35ecbca7f6f53f2f010441d14e8b9b31e77b0319ba63","observation_id":"ad26b349-54af-48ea-b647-7f793c8ee37a","resolution":{"observed_at":"2026-05-20T00:53:18.496094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zhang, N","venue":null,"work_id":"7396caaa-8f7d-43e0-a522-b9a6a134c3a9","year":2024},"citing_paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-10T10:16:45.420814Z"},"links":{"citing_paper":"/paper/2604.15526"},"observation_digest":"sha256:407eb76eae904d49686a934d31e35e93bef322f5561abfc1488df2db8bef2832","observation_id":"f51cbdf6-030e-4cda-b0a4-44bd14b36f85","resolution":{"observed_at":"2026-05-20T00:53:18.500120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2604.15526","last_updated":"2026-04-16T21:11:22Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T23:03:02.938732Z","submitted_at":"2026-04-16T21:11:22Z","title":"Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":50},"total_outbound_references":52},"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 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2604.15526."}