{"as_of":"2026-08-12T04:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:402c401abed3d4fef770ec7b98acd64bd529e4dbb3dbc1b1f315ebd49ef1552d","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T06:00:16.605067Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2603.04940/citation-record","integrity":"/paper/2603.04940/integrity","json":"/paper/2603.04940/citation-record.json","paper":"/paper/2603.04940"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T06:00:12.932970Z","title":"Duchi, Dylan J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:12.932970Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:6cc903c5a96815e1a8bdea6e9491ee5c0ed6c73e4e9e5f00971ba21bcb8af01e","observation_id":"6ace8078-1ed4-409e-aea9-9f9e2d1cda6a","resolution":{"observed_at":"2026-08-04T06:00:12.932970Z","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-04T06:00:13.045035Z","title":"Alternating proximal-gra dient steps for (stochastic) nonconvex-concave minimax problems","venue":null,"work_id":null,"year":1913},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:13.045035Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:3a198a556601678889fc417ffe55bf09f04a5fddea567497b24101c36e66749d","observation_id":"caa2f337-9d39-498a-b9d7-f5e49af82c75","resolution":{"observed_at":"2026-08-04T06:00:13.045035Z","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-04T06:00:13.152341Z","title":"An efficient stochastic algorithm for decentralized nonconvex-strongly-concave minimax optimization","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:13.152341Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:d0a6bdc9713d6ddce34a9c5b2f5aa81f33342131cee1db55cb47bd0853ab7e5f","observation_id":"e5510f19-65b1-4cc8-be7f-aadf30dcd529","resolution":{"observed_at":"2026-08-04T06:00:13.152341Z","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-04T06:00:13.307116Z","title":"Genera lized-smooth nonconvex optimization is as efficient as smooth nonconvex optimizatio n","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:13.307116Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:cbbd5333862afdea2061b7bbd71bfed8f88ec952082f46cf95d97dbd636210b7","observation_id":"66a4052b-059e-43c9-9b72-99c0ec9371b5","resolution":{"observed_at":"2026-08-04T06:00:13.307116Z","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-04T06:00:13.409454Z","title":"Robustness to unbounded smoothness of generalized signSGD","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:13.409454Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:7cbf378c66cd33cd8105fb030ae4b7623edc01fda77ec4370f02bd503569ba05","observation_id":"18a1f584-474a-41be-82a3-17e1879f68fc","resolution":{"observed_at":"2026-08-04T06:00:13.409454Z","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-04T06:00:13.577636Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:13.577636Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:00ded0cb285e622e548add5213d797d713a8cd60ab03e2cea705cbc5682fdf13","observation_id":"b51dea28-0930-4c77-b175-0b3203e9134a","resolution":{"observed_at":"2026-08-04T06:00:13.577636Z","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-04T06:00:13.669546Z","title":"Momentum improves norma lized sgd","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:13.669546Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:fa938aa4e6f9d0c55341d4bcd018df8995cb2c5cbdb479be99a657ab79c9642c","observation_id":"71c8b5bb-0903-44d8-9433-ad7e19d28af2","resolution":{"observed_at":"2026-08-04T06:00:13.669546Z","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-04T06:00:13.803579Z","title":"Stochastic optimization under distributional drift","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:13.803579Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:a5f325a0cd33c0c7610ea90564c37d202e8cc21ceeeba189de9006b67b86d029","observation_id":"d60d6a9f-97f7-47f5-aa4d-e7f644941ecd","resolution":{"observed_at":"2026-08-04T06:00:13.803579Z","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-04T06:00:13.926090Z","title":"Beyond uniform smoothness: A stopped analysis of adaptive sgd","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:13.926090Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:3e0aefa1d85a919aded0801f5c0d50bc72db99d3e3ecbd67d49541a73584fbd2","observation_id":"e8164fa5-6f98-4ab8-923f-db6c797a999a","resolution":{"observed_at":"2026-08-04T06:00:13.926090Z","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-04T06:00:14.036116Z","title":"Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.036116Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:8663fe1ce09fa4a567d2d32918a5fe50e36d95202e8dd31d16c542b7e59895ae","observation_id":"57543c70-be62-4be8-9693-e03063b4e457","resolution":{"observed_at":"2026-08-04T06:00:14.036116Z","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-04T06:00:14.101118Z","title":"Long short-term memory","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.101118Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:d22b47a9b565f7c921629a811f2f9bc0340f22f3e8bf97a5d59440fccafef6a3","observation_id":"d3341b32-7b9b-4ac4-a206-91e8073c7be4","resolution":{"observed_at":"2026-08-04T06:00:14.101118Z","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-04T06:00:14.191939Z","title":"Ac celerated zeroth-order and first-order momentum methods from mini to minimax optimizat ion","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.191939Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:8bb73d2c3f90ea63e8fb7a1c051bb9d2c767fc3cc6a03b32c11cc9ba80d08334","observation_id":"35775c5c-c4a9-4ee4-bcc7-284a39b5575a","resolution":{"observed_at":"2026-08-04T06:00:14.191939Z","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-04T06:00:14.282699Z","title":"Adagda: Faste r adaptive gradient descent ascent methods for minimax optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.282699Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:47713ff1e80b2663ab9da7ae5902a1f125c3a5b89134d2f8437370c8b20ed9cb","observation_id":"a1e3c44c-2ab3-4872-9b74-e0709c495411","resolution":{"observed_at":"2026-08-04T06:00:14.282699Z","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-04T06:00:14.366244Z","title":"Parameter-agnostic optimization un- der relaxed smoothness","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.366244Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:9b8bb278fb84fa51ef1cb38e544c731939c16d702b0cb92bd7a470aea5d6b4d3","observation_id":"573f1598-3af2-43af-bafe-361e525fddaa","resolution":{"observed_at":"2026-08-04T06:00:14.366244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.03736","last_updated":"2019-02-11T05:41:28Z","snapshot_observed_at":"2026-08-01T10:38:57.624492Z","submitted_at":"2019-02-11T05:41:28Z","title":"A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.03736","snapshot_observed_at":"2026-08-04T06:00:14.440596Z","title":"A short note on concentration inequalities for random vectors with subg aussian norm","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.440596Z"},"links":{"cited_paper":"/paper/1902.03736","citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:93defb5630b2333df2e55813d6c851091819f380171df6ae9bdf5896308aa696","observation_id":"f94ba06f-7da6-455f-b7d6-1bba66c7dd80","resolution":{"observed_at":"2026-08-04T06:00:14.440596Z","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-04T06:00:14.503256Z","title":"N on-convex distributionally robust optimization: Non-asymptotic analysis","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.503256Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:cb8adc523af7e02342314f190a3cf15e3dbaaadbdf2223f11cf34fe3676ed8d4","observation_id":"b5a0be0a-82a6-4d17-a4c9-3d804515867c","resolution":{"observed_at":"2026-08-04T06:00:14.503256Z","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-04T06:00:14.596424Z","title":"Large-scale methods for dis- tributionally robust optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.596424Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:77a506cfbd65fc7b065354ce48ed9779acb9a0b3e33fd9ed217ce85453a3529f","observation_id":"7fc8b1bc-b870-4c52-aaa4-b84a377b9287","resolution":{"observed_at":"2026-08-04T06:00:14.596424Z","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-04T06:00:14.690174Z","title":"Convex and non-convex optimization under generalized smoothness","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.690174Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:987948f1bef9a4bbe739481761757ede31f8dc0ef2d3a61da0309e615772107e","observation_id":"b778f5c9-d52b-4d79-8f85-1e1f950ffb9a","resolution":{"observed_at":"2026-08-04T06:00:14.690174Z","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-04T06:00:14.769480Z","title":"Con vergence of adam under relaxed assumptions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.769480Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:b04c744eee9b48095e12a31627f5821c7633c88dbcdbd5fffe56fc03aceb8ce2","observation_id":"3070e8a6-38ec-4315-a775-6be6a81b08a0","resolution":{"observed_at":"2026-08-04T06:00:14.769480Z","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-04T06:00:14.856825Z","title":"Tiada: A time-scale a daptive algorithm for nonconvex minimax optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.856825Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:422a33bac27e193b1d815d42f318e3f488998f5752fa113fe4b07f8053c4afd8","observation_id":"09208392-7df5-4438-a58a-948dfcc2c5e3","resolution":{"observed_at":"2026-08-04T06:00:14.856825Z","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-04T06:00:14.941411Z","title":"On gradient descent ascent for nonconvex-concave minimax problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:14.941411Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:c445e8c6dd2dc285b0172b2771948a044db38680582990751117cbe13bd33db5","observation_id":"c1296c2a-6a37-4c19-9a84-1f9258f24df7","resolution":{"observed_at":"2026-08-04T06:00:14.941411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06032","last_updated":"2023-10-28T03:26:32Z","snapshot_observed_at":"2026-08-05T14:30:17.690868Z","submitted_at":"2023-02-13T00:22:28Z","title":"Near-Optimal Non-Convex Stochastic Optimization under Generalized Smoothness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.06032","snapshot_observed_at":"2026-08-04T06:00:15.003285Z","title":"Near-optimal non-convex stochastic optimization under generalized smoothness","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.003285Z"},"links":{"cited_paper":"/paper/2302.06032","citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:33b59785c2607c03bfc2cf33ebccd45abc7f09c62c79d5322421f3b39cfa18a9","observation_id":"485ee688-b87b-4323-b462-ac44b0fa8d2a","resolution":{"observed_at":"2026-08-04T06:00:15.003285Z","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-04T06:00:15.067237Z","title":"Stoc hastic recursive gradient descent ascent for stochastic nonconvex-strongly-concave minimax problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.067237Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:cc9e18263801c06222a203ce2a572ef14307a65509485eebe8801a45682d3763","observation_id":"a353d7b5-4670-4792-96fd-745b3026ee9a","resolution":{"observed_at":"2026-08-04T06:00:15.067237Z","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-04T06:00:15.130013Z","title":"Tight analysis of extra-gradient and optimistic gradient methods for nonc onvex minimax problems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.130013Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:ed3b08978325657a444e7c1f79aaf0d74ad2cb42df8985705384791e7ddb2833","observation_id":"354fb40d-90e9-445b-afb4-3e4e780729cb","resolution":{"observed_at":"2026-08-04T06:00:15.130013Z","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-04T06:00:15.191237Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.191237Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:fbeb80e2897dfc86403676a040f329fca70191e67777fc1450031f3b17f935ee","observation_id":"c34c33e6-812c-48be-9f46-d40903fe1a23","resolution":{"observed_at":"2026-08-04T06:00:15.191237Z","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-04T06:00:15.240598Z","title":"Weakly-convex–concave min– max optimization: provable algorithms and applications in machine learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.240598Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:849c38c55b85eb8362a53f97ad18218e146c5ab7ae723167dfa61b05efe74a3d","observation_id":"3345060f-5907-4dcc-9d7b-a37a2a7684b2","resolution":{"observed_at":"2026-08-04T06:00:15.240598Z","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-04T06:00:15.312124Z","title":"Variance-reduced clipping for non-convex optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.312124Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:72997114ab8fd60e00e72216fed0ea77d13799cdad0c4699819986095fda4964","observation_id":"c712cdea-021f-405a-958d-d2f40ddbdc2b","resolution":{"observed_at":"2026-08-04T06:00:15.312124Z","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-04T06:00:15.349137Z","title":"Federated minimax optimization: Improved convergence analyses and algorith ms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.349137Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:bbc517fc1fd36829093789da50c68910915e3c00140d02aae66758a990d50d17","observation_id":"c18cf2e8-4163-462c-9fe2-fb64192496c4","resolution":{"observed_at":"2026-08-04T06:00:15.349137Z","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-04T06:00:15.410808Z","title":"Certifia ble distributional robustness with principled adversarial training","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.410808Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:8c60505bca7783cb07544cef61bccd19ed4be19f497dd64082a6a68a0260a447","observation_id":"2efd21ef-6773-4671-8426-e4ad1db56974","resolution":{"observed_at":"2026-08-04T06:00:15.410808Z","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-04T06:00:15.455881Z","title":"Mome ntum ensures convergence of signsgd under weaker assumptions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.455881Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:fe02cc938e2df4855bba9da9f9149b19d5cf512bf0c271cbbde546d1fb9f2ad7","observation_id":"afc1d014-831b-4bd4-b042-430aa4b5bce6","resolution":{"observed_at":"2026-08-04T06:00:15.455881Z","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-04T06:00:15.509726Z","title":"Theoretical ana lysis of adversarial learning: A minimax approach","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.509726Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:5d5f41367ec3b52fa4af5d1f1a1072a4edab9bf966bc6ecc2326072e33d295d6","observation_id":"87a76c4a-1162-4af1-9c54-c5a181d543e9","resolution":{"observed_at":"2026-08-04T06:00:15.509726Z","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-04T06:00:15.570979Z","title":"Co nvergence of adagrad for non-convex objectives: Simple proofs and relaxed assumpti ons","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.570979Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:6318f78e23e54ecd7e026fb2c9d34ec59385f27d9ba03647581ec19be7658790","observation_id":"237b0748-7994-4ccb-90fc-6673fe8a762f","resolution":{"observed_at":"2026-08-04T06:00:15.570979Z","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-04T06:00:15.633289Z","title":"Solving a class of non-convex minimax optimization in federated lear ning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.633289Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:d8082b2b85ebb0913c085eba40228ee04cd15ba7eee643d0698700dd8356eabc","observation_id":"96c07a68-7f5e-43d8-8bc8-caf93adffe81","resolution":{"observed_at":"2026-08-04T06:00:15.633289Z","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-04T06:00:15.692795Z","title":"Delving into the convergence of generalized smooth minimax optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.692795Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:5a7b7a8e7cf652e997b7781e1c0f4fea9e611ed7a143102be70020ca33b0cc83","observation_id":"0d41dfd5-02bb-48b0-a217-bdd640cc4c3e","resolution":{"observed_at":"2026-08-04T06:00:15.692795Z","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-04T06:00:15.756191Z","title":"A stochastic gda method with backtracking for solving nonconvex (strongly) concave minimax problems, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.756191Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:e52622c11c9cc559feab2542d7b72384af0c2accc49865b2f1d17b1dd41c9d27","observation_id":"59be80d6-7009-4a07-a8de-11f1cb86354c","resolution":{"observed_at":"2026-08-04T06:00:15.756191Z","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-04T06:00:15.803276Z","title":"Vincent Poor","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.803276Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:783c62072e915adde60f9e1f152d2e043ca14bbc9d32d619dd9bbbb9bb8ce587","observation_id":"015a9eb0-4823-4ff5-b736-1a50763d16b9","resolution":{"observed_at":"2026-08-04T06:00:15.803276Z","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-04T06:00:15.872440Z","title":"Nest your adaptive al gorithm for parameter-agnostic nonconvex minimax optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.872440Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:48893307fc29b25a6b7c7136fea2c5ed73ae8aa2654645fec01ad9d8c6f09794","observation_id":"7e9f76df-d641-467c-afed-5b70b2af225f","resolution":{"observed_at":"2026-08-04T06:00:15.872440Z","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-04T06:00:15.911646Z","title":"Faster single-loop algo- rithms for minimax optimization without strong concavity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.911646Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:c83ee393adde89462cbde8434f500743a1405b63796d163b441fa5092e37a27b","observation_id":"21b3340b-141b-4aac-851d-cd2eadc77469","resolution":{"observed_at":"2026-08-04T06:00:15.911646Z","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-04T06:00:15.970819Z","title":"Impr oved analysis of clipping algo- rithms for non-convex optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:15.970819Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:42ae41981a241c5a68b7e3b2b00bfde641418faf09995db62bfe9607efbca191","observation_id":"0567047a-827e-42c1-91d1-a9c9969e6286","resolution":{"observed_at":"2026-08-04T06:00:15.970819Z","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-04T06:00:16.094499Z","title":"Why gradient clipping accel- erates training: A theoretical justification for adaptivit y","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:16.094499Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:e552d540251040645ca7f3dc2f67163d599f314139023d09ef5e5e48199f8320","observation_id":"883e9134-c96f-43c8-b2db-7e57b4b90c0a","resolution":{"observed_at":"2026-08-04T06:00:16.094499Z","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-04T06:00:16.191988Z","title":"Sapd+: An accelerated stochastic method for nonconvex-concave minimax problems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:16.191988Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:3749ab743d6619960b7efaf00eaad43898d7e1cda12598bcf7804ae9b22a4e49","observation_id":"c226fc11-e701-442d-a730-f29e56abf253","resolution":{"observed_at":"2026-08-04T06:00:16.191988Z","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-04T06:00:16.324332Z","title":"Finding second-order stationary points for generalized-smooth nonconvex minimax optimization via gradient-based algorithm, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:16.324332Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:4251c75dc9faf21a61c7d24a60e86ea6958bc5282c5960c8ffe5fa929b2c718b","observation_id":"db5cbf90-fb2e-47c2-8b9f-bf3a343f9154","resolution":{"observed_at":"2026-08-04T06:00:16.324332Z","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-04T06:00:16.474094Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:16.474094Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:29e283ca9e21a84e5e11eeacac516a2af16743fc88b49e0ba748c65faea7be75","observation_id":"c11c32b7-316f-409e-a0a2-27531a57c037","resolution":{"observed_at":"2026-08-04T06:00:16.474094Z","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-04T06:00:16.605067Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T06:00:16.605067Z"},"links":{"citing_paper":"/paper/2603.04940"},"observation_digest":"sha256:5e0ea32692295bab1677a4450908a71b1e6e7e2b5f6464df126b7f55f9708fa0","observation_id":"22e68fc8-12b0-4c75-bffc-17765f2524ad","resolution":{"observed_at":"2026-08-04T06:00:16.605067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.04940","last_updated":"2026-08-03T03:22:53Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-11T08:59:32.610776Z","submitted_at":"2026-03-05T08:39:35Z","title":"An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":44},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2603.04940."}