{"as_of":"2026-08-17T07:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db043519ee04b35e60572576e43d3fb9f9b4fcedd98c8dfe127a327d93161482","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:26:56.651885Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2608.12043/citation-record","integrity":"/paper/2608.12043/integrity","json":"/paper/2608.12043/citation-record.json","paper":"/paper/2608.12043"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.12359","last_updated":"2025-06-01T16:32:24Z","snapshot_observed_at":"2026-08-16T15:06:17.319740Z","submitted_at":"2023-08-23T18:04:18Z","title":"Moving Anchor Extragradient Methods For Smooth Structured Minimax Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12359","snapshot_observed_at":"2026-08-16T00:26:56.382692Z","title":"Moving anchor extragradient methods for smooth structured minimax problems.arXiv:2308.12359, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.382692Z"},"links":{"cited_paper":"/paper/2308.12359","citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:76eb1d57995b8297c9908d945506e7d3994a73b359807edcb17072ce271044d7","observation_id":"9ca48e5d-e259-44c3-9b4f-c9b9d05da8b7","resolution":{"observed_at":"2026-08-16T00:26:56.382692Z","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-16T00:26:56.388400Z","title":"Katyusha: The first direct acceleration of stochastic gradient methods.Journal of Machine Learning Research, 18(221):1–51, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.388400Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:72ebc50dd2c5d8c816f4d0dc0bfcbd30845a529df612a0c33688ae3f3f11f984","observation_id":"4f2f753d-4999-4148-94e1-8777a8d14147","resolution":{"observed_at":"2026-08-16T00:26:56.388400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.489071Z","title":"Bauschke and Patrick L","venue":null,"work_id":"504305ce-eb61-44a6-8e9b-bc40743050e8","year":2017},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.394264Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:555cc62cebc579dd2f443dd28fde83d0985990380e36fbf037de00981992434d","observation_id":"19a5d371-edb7-4c91-85f7-21883b0b0b31","resolution":{"observed_at":"2026-08-16T00:26:57.493517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.399662Z","title":"Stochastic gradient descent-ascent: Unified theory and new efficient methods.International Conference on Artificial Intelligence and Statistics, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.399662Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:212366ac3e4d22c93f1f898bca79f99d852b2d01c945f9d0c79b69166248ad89","observation_id":"0968775c-7506-4dd4-a8cf-8023e8dc68ca","resolution":{"observed_at":"2026-08-16T00:26:56.399662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.463817Z","title":"Bot ¸ and Enis Chenchene","venue":null,"work_id":"46103abe-b690-4687-a409-4da4c9e16ef1","year":2026},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.404427Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:d686b517524d62413142f4b1cd3ab1c0c12a3f14b4e0e363e70f7ff32ba5b8e0","observation_id":"c010fa8d-08fc-43ec-879b-0d7f4328aef3","resolution":{"observed_at":"2026-08-16T00:26:57.468942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.448560Z","title":"Fast Optimistic Gradient De- scent Ascent (OGDA) method in continuous and discrete time.Foundations of Computational Mathematics, 2023","venue":null,"work_id":"a86aae35-3ccc-433e-bd04-cb3c5613cfa9","year":2023},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.409327Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:127cfbe64aadc960ccf8aefabc2af007b129d687b09f1e7388a14fb92102ec15","observation_id":"b9dee892-0d6f-43d2-aafd-af0c48620dcf","resolution":{"observed_at":"2026-08-16T00:26:57.453364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.414445Z","title":"Stochastic fixed-point iterations for nonexpansive maps: Convergence and error bounds.SIAM Journal on Control and Optimization, 62(1):191–219, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.414445Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:2e4755788fd4539171424859cf95369e8922c589972fa5a66a1a7bf493aabe60","observation_id":"1075a698-88e3-4b0c-8264-0428b1809114","resolution":{"observed_at":"2026-08-16T00:26:56.414445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.422431Z","title":"Stochastic Halpern iteration in normed spaces and appli- cations to reinforcement learning.Mathematical Programming, 2026","venue":null,"work_id":"29c98ec3-5930-476d-ba0b-79b8b4c38efb","year":2026},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.419137Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:d4afc467bf611add9146ec03659ec728dd569123aa65b9262edffe638ddf055f","observation_id":"dcdff90e-0306-4569-acd3-20baafe255e7","resolution":{"observed_at":"2026-08-16T00:26:57.427235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.423849Z","title":"Stochastic halpern iteration with variance reduction for stochastic monotone inclusions.Neural Information Processing Systems, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.423849Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:d0bfafa2c5a8642382cbab0e4d065decacd032ce0e83bfc62e1cb6a580da61b9","observation_id":"0dfd8b07-87ce-46a7-8c0a-f5ab11d6fb1f","resolution":{"observed_at":"2026-08-16T00:26:56.423849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.395065Z","title":"Variance reduced halpern iteration for finite-sum monotone inclusions.International Conference on Learning Representations, 2024","venue":null,"work_id":"4986af9d-58c3-4a8d-8732-99d69080416f","year":2024},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.428523Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:d064cad3d3337dccb2c10465338dcd68b8a3294d6d6513cec419a88cbd645475","observation_id":"07cd6030-aef7-4138-bfc9-d0ee991d5383","resolution":{"observed_at":"2026-08-16T00:26:57.400866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.379436Z","title":"Accelerated single-call methods for constrained min-max optimiza- tion.International Conference on Learning Representations, 2023","venue":null,"work_id":"6d3bbca5-5b89-44e2-8932-627c975dbf08","year":2023},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.433133Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:b0db5560b6ea46080bd33eb3a5146581c5d7676f28409b5c23b9577bf6ab8eac","observation_id":"05ede653-4c07-4d4f-b534-bf5962988ffd","resolution":{"observed_at":"2026-08-16T00:26:57.384118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.364382Z","title":"Near-optimal algorithms for making the gradient small in stochastic minimax optimization.Journal of Machine Learning Research, 25(387):1–44, 2024","venue":null,"work_id":"0f3486f6-c8f4-48ae-a6cf-c9b95f9defe3","year":2024},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.437705Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:9d2fc13a8901ae12021c7b0e58337bbab66a0d987100898052bab01dab3acd5c","observation_id":"6657cf94-628b-4a60-afdf-b87bae7509a4","resolution":{"observed_at":"2026-08-16T00:26:57.369301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.349762Z","title":"Training GANs with optimism.International Conference on Learning Representations, 2018","venue":null,"work_id":"098cf75a-6ebc-4871-bf86-0f02bb49fead","year":2018},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.442248Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:2ef06e45b0fd11b186c12b17bdd41d5c3ddaeba17faed15da21abd434f7334f4","observation_id":"a5b13463-1cb6-41b7-b5ad-d95ae82959a0","resolution":{"observed_at":"2026-08-16T00:26:57.354587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.335192Z","title":"Variance reduction for root-finding problems.Mathematical Programming, 197(1): 375–410, 2023","venue":null,"work_id":"c24ed300-68fa-4fa3-b611-1ababc440b2f","year":2023},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.446764Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:ecd179f751a02f1de57984d90f168f903bf263847a2e3353a965ad38da9fdd40","observation_id":"bc69296a-bac9-406f-9d90-a8d6ba6df40d","resolution":{"observed_at":"2026-08-16T00:26:57.339998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.319023Z","title":"First-order methods of smooth convex optimization with inexact oracle.Mathematical Programming, 146(1):37–75, 2014","venue":null,"work_id":"a2e1b36f-e463-49c9-bc78-16d0847d32f4","year":2014},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.451285Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:51dc0fbe3d1c996a3d78c35c9803f7cbee254afaca7820662a9935799722c560","observation_id":"9e453e6e-020f-46b2-b71f-9a0644e7ba28","resolution":{"observed_at":"2026-08-16T00:26:57.324903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.455970Z","title":"Halpern iteration for near-optimal and parameter-free monotone inclusion and strong solutions to variational inequalities.Conference on Learning Theory, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.455970Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:3c6fca63ebed466efa01162f4607f49c00bbd2ce299ca4f2c9e9dcb5a46670ce","observation_id":"8f35f8b8-8485-45ce-9772-63c452f74990","resolution":{"observed_at":"2026-08-16T00:26:56.455970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.294181Z","title":"Springer-Verlag, 2003","venue":null,"work_id":"d5d210d2-6f24-4f50-b09c-d8af3dc4c6ef","year":2003},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.460305Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:17a9e045b49ac2243f65114dec820a37c1e91a8cc6ae00a314e5066a48babbb7","observation_id":"b733cfbb-7c63-4c5a-b088-914c58d2d5da","resolution":{"observed_at":"2026-08-16T00:26:57.298896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.465010Z","title":"Accelerated gradient methods for nonconvex nonlinear and stochastic programming.Mathematical Programming, 156(1):59–99, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.465010Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:78d9faee7b5023e2a9cf87d40feafe5b0ea3952849f61528982b0fe8f0ca6cee","observation_id":"5d1eddbd-f8d9-49f0-b8fd-88e06ccf6a64","resolution":{"observed_at":"2026-08-16T00:26:56.465010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.268577Z","title":"Generative adversarial nets.Neural Information Processing Systems, 2014","venue":null,"work_id":"a262250e-4537-4ace-b65d-92a917447a3e","year":2014},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.469415Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:c086c139098cb1a1901d61fb4c8d7396dbdac72e32b13f0d0162e920c58f0dd7","observation_id":"c8efa343-914a-4ecb-a17f-fa76b07040bf","resolution":{"observed_at":"2026-08-16T00:26:57.273524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.252765Z","title":"Stochastic extragradient: General analysis and improved rates.International Conference on Artificial Intelligence and Statis- tics, 2022","venue":null,"work_id":"dfc1f748-e93c-41ba-a018-bc642e977990","year":2022},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.474540Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:bc23b35ad982764ed1c2b81fda1acbff965f7321989cf9807978bf766063e5b4","observation_id":"6de432b0-ef02-413c-8c90-750925592e3a","resolution":{"observed_at":"2026-08-16T00:26:57.258072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.479040Z","title":"Fixed points of nonexpanding maps.Bulletin of the American Mathematical Society, 73(6):957–961, 1967","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.479040Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:efa2b47754ded4b3a115c92953deb83d46ffbab11dc57ed7b986328f3bbb4002","observation_id":"1070d2f6-f4a0-483a-b51b-e6130815421d","resolution":{"observed_at":"2026-08-16T00:26:56.479040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.226836Z","title":"Accelerated proximal point method for maximally monotone operators.Mathe- matical Programming, 190(1–2):57–87, 2021","venue":null,"work_id":"c9277b7f-7054-4690-b39b-cf7c61d3a120","year":2021},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.483720Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:247dccecc27f2da477a9fb452119899638805bba0662220ffd282bd2fcaaee54","observation_id":"4fe22a57-fa47-43da-93aa-8a62c2f50034","resolution":{"observed_at":"2026-08-16T00:26:57.231702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.210136Z","title":null,"venue":null,"work_id":"30fb0377-cf60-4387-9133-e27f659cf5e5","year":1976},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.488531Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:5916d37971f0b29b3e8bc069395d941df4128310ef95d437ab8cfe7636f3a457","observation_id":"e906fb94-afb9-44ef-a09a-1c31b4f46ea5","resolution":{"observed_at":"2026-08-16T00:26:57.215546Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.194098Z","title":null,"venue":null,"work_id":"bb02a2b8-972c-45d1-b013-8a9b0b9ca5cf","year":1955},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.493341Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:6be3574df6a1e028288341d9940190e751e4b62b2bf8c3bfe3c15bfef91d09a7","observation_id":"3d67c067-54d5-43db-b4f2-eb10f26b89f7","resolution":{"observed_at":"2026-08-16T00:26:57.198927Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.179344Z","title":null,"venue":null,"work_id":"725ebb62-adfa-40d4-b0b1-9cd99753d1e8","year":2023},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.497799Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:6226fd7fa45147cae67acda9510e9f8f2816d1ffbabc8b1387617e4139a0e457","observation_id":"658c1c17-9d54-4389-a09b-c067cb3facc7","resolution":{"observed_at":"2026-08-16T00:26:57.184083Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.162753Z","title":"Near-optimal sample complexity for MDPs via anchoring.Proceedings of the 42nd international conference on machine learning, 2025","venue":null,"work_id":"f4eddd08-939c-4e46-8347-36385449deac","year":2025},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.502391Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:ea96fbcbbd30c4cd05a697546e0924e5ae2ee39eb25425d59cbe8e41f6291c48","observation_id":"5829444e-f5de-4214-9f77-acc31bc9c702","resolution":{"observed_at":"2026-08-16T00:26:57.168893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.147345Z","title":"Fast extra gradient methods for smooth structured nonconvex– nonconcave minimax problems.Neural Information Processing Systems, 2021","venue":null,"work_id":"f3f82a0e-b707-48ed-94e1-b10be1af8b1b","year":2021},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.507000Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:c336ebfc02f6a2bdfce2712f90182b60da85abb87b0181dfdef614b1e0937a2b","observation_id":"0d113d78-1513-45a7-9639-0a3ce569dbb6","resolution":{"observed_at":"2026-08-16T00:26:57.152019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.131832Z","title":"PAGE: A simple and optimal probabilistic gradient estimator for nonconvex optimization.International Conference on Machine Learning, 2021","venue":null,"work_id":"00798d29-3197-4bb2-85e2-c9255abcc066","year":2021},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.511791Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:f400b815d021c1d9046c5f1aecadb6e15a6fe60bdff8172ad69a286336986cea","observation_id":"5122a7b6-5683-42a1-8f75-3374fe71fe08","resolution":{"observed_at":"2026-08-16T00:26:57.137076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.516279Z","title":"On the convergence rate of the Halpern-iteration.Optimization Letters, 15(2):405– 418, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.516279Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:bd75b36255e0664370c85e33ff9ebf7af46bffcbb49089eb896e56ca35952cb2","observation_id":"b6b60c5f-5faa-4aa4-a916-f2bb52e6852e","resolution":{"observed_at":"2026-08-16T00:26:56.516279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.102991Z","title":"A universal catalyst for first-order optimization","venue":null,"work_id":"3ea9f33c-2cb8-4806-8388-224d089b7381","year":2015},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.520617Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:0790fce962a54248fafed013d542351262d59755a5077392a571ac79ef844f7d","observation_id":"b9786d49-2796-4ff0-8dc1-ab35a39297e3","resolution":{"observed_at":"2026-08-16T00:26:57.108169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.086915Z","title":null,"venue":null,"work_id":"8b76d100-1703-4edb-a9fe-2fcddb2f9317","year":2020},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.525315Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:47ad6c6366581e75348ce280e902ea5ffa9f574103074534b0fb04466f9f21ec","observation_id":"9a515f79-22f0-46ca-a1d2-750d0c127cce","resolution":{"observed_at":"2026-08-16T00:26:57.092289Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.070056Z","title":"Stochastic gradient descent-ascent and consensus optimization for smooth games: Convergence analysis under expected co-coercivity.Neural Information Processing Systems, 2021","venue":null,"work_id":"474a8eb5-df48-454b-ae3c-04731594ce33","year":2021},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.530044Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:c9506e14388ae064c9f45d0b375d4195f588bc001b6d61da264059d2e08cbaaa","observation_id":"aa174ebd-eca1-42e5-bc18-13ed823eaa34","resolution":{"observed_at":"2026-08-16T00:26:57.076008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.052204Z","title":"To- wards deep learning models resistant to adversarial attacks.International Conference on Learning Representations, 2018","venue":null,"work_id":"55375788-6269-4520-817d-9646b0f764c2","year":2018},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.534787Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:c0323d7f42aebf102e2f097d7e8082c03a7683cb557bb472a3a222378a8e1b9d","observation_id":"21630d7f-f6f8-4f16-b76e-60986c01d4e1","resolution":{"observed_at":"2026-08-16T00:26:57.057820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.036463Z","title":"Mean value methods in iteration.Proceedings of the American Mathematical Society, 4(3):506–510, 1953","venue":null,"work_id":"e27d2a39-7734-4348-a486-9e78d9e4ce0b","year":1953},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.539068Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:df8fff777c1d12a1aa82e01f0cf3705ccf0c00626c0f1ced636aa7f2aa01a563","observation_id":"69ac14be-22d9-4050-9e43-a23073f9bc4d","resolution":{"observed_at":"2026-08-16T00:26:57.041576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.543541Z","title":"Foo, Vijay Chandrasekhar, and Georgios Piliouras","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.543541Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:0e68b0973fafa070407f575841e96c1017573ac88e9660b5f26772f809035f15","observation_id":"5037ba4e-3bdf-40c6-9af0-5b892468da50","resolution":{"observed_at":"2026-08-16T00:26:56.543541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:57.009657Z","title":null,"venue":null,"work_id":"0c846f0e-a4cb-4b03-b9d8-da38ddcc1457","year":1962},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.548196Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:cdf331011edcbc09a2b997b70ab47016f09541db474eb353816104b1ce613036","observation_id":"68a09a9e-3ea0-410a-b0a9-43603d56006b","resolution":{"observed_at":"2026-08-16T00:26:57.014715Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.992146Z","title":"Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods.Numerical Algorithms, 91(2):749–772, 2022","venue":null,"work_id":"ee2b2638-2df5-4e61-aee8-cbc84d4d3e39","year":2022},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.552500Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:4d0d3cc70abd6bbf5939487bc46960f8b7cb63fd35aa5ea983431995c4ede260","observation_id":"fd586ae2-44e8-4b8e-b384-f54aa3318bcd","resolution":{"observed_at":"2026-08-16T00:26:56.997984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.975658Z","title":null,"venue":null,"work_id":"895ba286-3d22-4d8a-bd39-6d3fe9655f41","year":2004},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.557550Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:cf5e85f2ee98dbc21eaeff530fb2da366c554c1812210b77b69442dc3619629c","observation_id":"813f6fb5-018f-40be-b1e5-5281450bb682","resolution":{"observed_at":"2026-08-16T00:26:56.981250Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.959016Z","title":"Nguyen, Jie Liu, Katya Scheinberg, and Martin Tak´ aˇ c","venue":null,"work_id":"913027e1-4f1e-43ec-9f4c-780bedfb99d1","year":2017},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.562616Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:647d7aee190404b47bbd8ad97a74768ace3fe406cfc9b95fd760265bf22b21ed","observation_id":"712a8ae9-39c0-4da8-91f1-09a8265fec21","resolution":{"observed_at":"2026-08-16T00:26:56.964753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.567174Z","title":"Exact optimal accelerated complexity for fixed-point iterations","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.567174Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:720b1b998f64d76f6bc78ba5dcd2e9bb25f8adeedf8377929aa8dfb97291373c","observation_id":"3c1d2767-aa5d-411b-908e-a45f00873e8d","resolution":{"observed_at":"2026-08-16T00:26:56.567174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.933489Z","title":"Asymptotic Regularity of a Generalised Stochastic Halpern Scheme.Journal of Optimization Theory and Applications, 210(1):3, 2026","venue":null,"work_id":"9cf25505-5250-46b0-9dbb-57ddaefc5e28","year":2026},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.571798Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:00bde27d8231fa61fb18da3952e42b877b3a73637a8c1cbb87cc0c9ec500ab8d","observation_id":"3ebdc605-9956-4ea2-a444-239ce510bd7e","resolution":{"observed_at":"2026-08-16T00:26:56.938535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.576237Z","title":"Tyrrell Rockafellar","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.576237Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:eec664dc20f8ed507c30442bea81b9741d76f9d2bd956cdc866b880a88ee44d0","observation_id":"e887f767-9197-4054-b36d-90d0bd62bc79","resolution":{"observed_at":"2026-08-16T00:26:56.576237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.907743Z","title":"Cam- bridge University Press, 2022","venue":null,"work_id":"1d17acae-3708-4f81-b111-b47545d0c8c8","year":2022},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.581119Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:7b33e3d3068ba0b1089d8248cd0e3f48ae87ce1021b9deeb2dcb1afd5e1e173b","observation_id":"f12effb2-b58d-4529-9409-b7dae2bff6af","resolution":{"observed_at":"2026-08-16T00:26:56.912954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10899","last_updated":"2020-10-12T01:00:58Z","snapshot_observed_at":"2026-08-16T18:59:15.718972Z","submitted_at":"2019-05-26T23:05:13Z","title":"ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10899","snapshot_observed_at":"2026-08-16T00:26:56.586164Z","title":"Ryu, Kun Yuan, and Wotao Yin","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.586164Z"},"links":{"cited_paper":"/paper/1905.10899","citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:5beb78852999089bcf779e8b76e01e7331a8a4d6e0c0a6b410c45e98d95a3093","observation_id":"537882a6-227c-4629-8378-c86820f1b1d7","resolution":{"observed_at":"2026-08-16T00:26:56.586164Z","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-16T00:26:56.590801Z","title":"A first order method for solving convex bilevel optimization problems.SIAM Journal on Optimization, 27(2):640–660, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.590801Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:0313e103901c44acb283813911f43f8326fdfca6114f60bf096ebe111bb2a834","observation_id":"c1cf30be-8c97-4371-abf5-48020c28c9cb","resolution":{"observed_at":"2026-08-16T00:26:56.590801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.883500Z","title":null,"venue":null,"work_id":"06fb586d-7605-4325-9308-a478f65ec329","year":2014},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.595166Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:a87276486d055a95969a8b10462c0cfbf612d61bb73506d8094b98a5ed9ae9d4","observation_id":"a4acb349-eacd-41d0-8284-79cc34e631a0","resolution":{"observed_at":"2026-08-16T00:26:56.888058Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.869575Z","title":"Formes bilineaires coercitives sur les ensembles convexes.Comptes Rendus Hebdomadaires Des Seances De L Academie Des Sciences, 258(18):4413, 1964","venue":null,"work_id":"955c8206-608d-4224-90f0-d4dca638d3b2","year":1964},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.600270Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:ae79a672ff00100e6167b488e3f26d4925bc96f0413a6d07379406a0c8349ad6","observation_id":"0ff27ff5-8155-4111-bfd4-20de5915ca36","resolution":{"observed_at":"2026-08-16T00:26:56.874206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.853995Z","title":"Suh, Jisun Park, and Ernest K","venue":null,"work_id":"9173f30c-d755-4cb4-984e-f8e5d1f129e3","year":2023},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.604840Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:68f0ed86c03e7c1544719bfdcd3b7caa41de9e3fea130b0375ecdc3f9fa5c62f","observation_id":"45d43a3d-16a4-40ac-9fbc-3aafa5820003","resolution":{"observed_at":"2026-08-16T00:26:56.859060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.609479Z","title":"From Halpern’s fixed-point iterations to Nesterov’s accelerated interpretations for root-finding problems.Computational Optimization and Applications, 87(1):181–218, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.609479Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:5c3115e4b48d305502340ea046d535494dca5d24da7c5c90f078f2ee439bf503","observation_id":"b0ba7c0d-5d15-41b7-ab3f-8f2783d15d5f","resolution":{"observed_at":"2026-08-16T00:26:56.609479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.08150","last_updated":"2021-12-06T22:01:02Z","snapshot_observed_at":"2026-08-16T17:48:59.398620Z","submitted_at":"2021-10-15T15:26:32Z","title":"Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.08150","snapshot_observed_at":"2026-08-16T00:26:56.614725Z","title":"Halpern-type accelerated and splitting algorithms for monotone inclusions.arXiv:2110.08150, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.614725Z"},"links":{"cited_paper":"/paper/2110.08150","citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:0f38a4e649a34014e71f6c338e896087fad2dbb607a77e089ef6af0d8bb79b08","observation_id":"b882eafd-41f2-46cd-bb4d-ad0e13bc0908","resolution":{"observed_at":"2026-08-16T00:26:56.614725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.828360Z","title":"Approximation of fixed points of nonexpansive mappings.Archiv der Mathe- matik, 58(5):486–491, 1992","venue":null,"work_id":"a36d1d13-46d1-4ea9-81ec-61f81cb38932","year":1992},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.619760Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:249119c68aabe2b8339df7fda92f4a9e5b916a80ce807b0ee12c9ad35cef0ce7","observation_id":"e6cf40e1-0f8a-4504-9a8d-3fcb85c4d45e","resolution":{"observed_at":"2026-08-16T00:26:56.833375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.02231","last_updated":"2026-08-06T21:04:18Z","snapshot_observed_at":"2026-08-12T23:09:45.959082Z","submitted_at":"2026-05-04T05:04:35Z","title":"A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.02231","snapshot_observed_at":"2026-08-16T00:26:56.624497Z","title":"A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms.arXiv:2605.02231, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.624497Z"},"links":{"cited_paper":"/paper/2605.02231","citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:1f5aa2d654718bdd76e8345aa8772e74ba3d6b856e3d429d0d314b9510aecfe3","observation_id":"450a733d-1099-415c-befd-8beda267b948","resolution":{"observed_at":"2026-08-16T00:26:56.624497Z","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-16T00:26:56.629267Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.629267Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:c8b9e19370e4bbb83c0098d43e30b43fd42c7c6907969117edb5d8317ae5a4ca","observation_id":"dda1ab64-2737-41a9-beaa-af95a431f9e1","resolution":{"observed_at":"2026-08-16T00:26:56.629267Z","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-16T00:26:56.633854Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.633854Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:1c7b3c8cf5e73ebc9907e4ee12eb6c6962072448fada00f2cc428354db6d8ea3","observation_id":"4c5d9ed4-54af-46e9-8a35-8e00f2a88173","resolution":{"observed_at":"2026-08-16T00:26:56.633854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.793553Z","title":"Suh, and Ernest K","venue":null,"work_id":"ce18e78e-e1d8-4bdf-80b4-65a534b4fa82","year":2024},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.638224Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:dae38c774a620887960368c86dffa3b6c3f6ceeb6ce3ab5f6d1b4db7d502813a","observation_id":"e0c7fc16-1dec-4a02-a35a-e66eccb66e38","resolution":{"observed_at":"2026-08-16T00:26:56.798096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.778667Z","title":"H-invariance theory: A complete charac- terization of minimax optimal fixed-point algorithms.Accepted for publication in Mathematical Programming, 2025","venue":null,"work_id":"9c4b40e6-277a-41d6-a944-b3c97b12f8b3","year":2025},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.642671Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:918df8c93daf1b6bebbc559b9657caaff6b80c8d584cdfdf991dbc92ac8f527b","observation_id":"3d0f78d9-6e79-4e9b-9904-65cb12ecb9c0","resolution":{"observed_at":"2026-08-16T00:26:56.783479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.762954Z","title":"Multiplayer federated learning: Reaching equilibrium with less communication.Advances in Neural Information Processing Systems, 2026","venue":null,"work_id":"c14b8935-a2da-46f7-b19b-c31a0244d402","year":2026},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.647223Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:0535c9312346c12d8b51e15d2319db174d1a4acc67f223aad03dd86dfdc8f5f7","observation_id":"69cd4e41-be33-453f-ad95-62f74678a47a","resolution":{"observed_at":"2026-08-16T00:26:56.768884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:26:56.746337Z","title":null,"venue":null,"work_id":"5506fd9a-bdb7-4794-ada2-ba654e63265c","year":2024},"citing_paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:56.651885Z"},"links":{"citing_paper":"/paper/2608.12043"},"observation_digest":"sha256:07c7dc07950be0b7646d2fb52010c94f879fcc6de1e3d153e0017f430fd2640f","observation_id":"804b15de-0304-417e-947a-4e29e94d109c","resolution":{"observed_at":"2026-08-16T00:26:56.751765Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.12043","last_updated":"2026-08-12T13:25:55Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T16:03:05.169529Z","submitted_at":"2026-08-12T13:25:55Z","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":0,"verified_fuzzy":31},"total_outbound_references":58},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2608.12043."}