{"as_of":"2026-08-16T20:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:81f6b9cc9b1b649212262c5d9377371336d4675b0b1d30bf2217390ca7850a66","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:48:52.476890Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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.08463/citation-record","integrity":"/paper/2608.08463/integrity","json":"/paper/2608.08463/citation-record.json","paper":"/paper/2608.08463"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.06167","last_updated":"2022-05-31T04:37:34Z","snapshot_observed_at":"2026-08-16T17:00:44.804689Z","submitted_at":"2022-05-12T15:43:53Z","title":"Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.06167","snapshot_observed_at":"2026-08-14T04:48:52.226992Z","title":"Optimal methods for higher-order smooth monotone variational inequalities.arXiv preprint arXiv:2205.06167, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.226992Z"},"links":{"cited_paper":"/paper/2205.06167","citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:d5d580c521e89a83b7aca70ade052f1b7a051009ada30180d8fa79427585b6ff","observation_id":"6751dfe0-1cae-4c8c-be37-b6d77fb4472a","resolution":{"observed_at":"2026-08-14T04:48:52.226992Z","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-14T04:48:53.077911Z","title":"Lower bounds for higher-order convex optimization","venue":null,"work_id":"23a754f6-780a-4cd5-8551-a3ccc69aca02","year":2018},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.232380Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:e79dc07afa4b08426a8aec415341acdcaccdc6949100b6c9d2288ab0f593a18a","observation_id":"f8b72d3d-a5a6-424c-928f-a65e84e6ce44","resolution":{"observed_at":"2026-08-14T04:48:53.081398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:53.068088Z","title":null,"venue":null,"work_id":"77a9fd68-1edf-48e2-a2e2-b32b4effdf20","year":2024},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.236962Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:aba4abe520b1f032c620b18870667f6a637e21c9aa6ff2591a1bb9430bbd3ca8","observation_id":"3d5186ae-59d8-4dce-b4a3-f6cac05ea11e","resolution":{"observed_at":"2026-08-14T04:48:53.071643Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:53.058578Z","title":"Optimal black-box reductions between optimization objectives","venue":null,"work_id":"933290b2-3950-40c8-8824-1b27610f7ecc","year":2016},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.240843Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:1e26d12c8502162e9cc5e5018d272a425560ee51d2507b978ad98b0a7b9e5b94","observation_id":"16ad43aa-fdd8-4a68-8e56-c260523715ab","resolution":{"observed_at":"2026-08-14T04:48:53.061901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:53.049034Z","title":"Marques Alves and Benar F","venue":null,"work_id":"3c275833-83cc-4cf3-a78b-957e1442ace9","year":2024},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.245596Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:b3009bdb917e14ec764f792707347900a6a9308e0f7f48184ad82e02a57417ae","observation_id":"01d65b41-f393-456f-9337-00cd6e6d8941","resolution":{"observed_at":"2026-08-14T04:48:53.052399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.250121Z","title":"Oracle complexity of second-order methods for smooth convex optimization.Mathematical Programming, 178(1):327–360, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.250121Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:2fa7683fb9ebb5aa15ae3cf7167636e9b5b38316d42a42121f2418818f1b38ac","observation_id":"11e06a67-843e-4580-88da-dbaa4e495c00","resolution":{"observed_at":"2026-08-14T04:48:52.250121Z","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-14T04:48:53.033269Z","title":"Doubly optimal no-regret online learning in strongly monotone games with bandit feedback.Operations Research, 73(6):3219–3244, 2025","venue":null,"work_id":"7c182fe8-8f2b-4321-929a-355e933f8800","year":2025},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.254212Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:ffb99f3ad1113765c17bdc2a1370f7ad0c5b9bd1dc1f5f041558367e27dceb76","observation_id":"a8ef53db-2a20-4590-b951-dc8434cadf87","resolution":{"observed_at":"2026-08-14T04:48:53.036964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.257958Z","title":"Near-optimal method for highly smooth convex optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.257958Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:34dc346cffc74e533c5f015651121fffc3c56ed76d7d845396a2431de4a170d0","observation_id":"e2c52b43-bf74-4bef-a64a-b26ef15f51ab","resolution":{"observed_at":"2026-08-14T04:48:52.257958Z","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-14T04:48:52.261563Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.261563Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:f31a03dc97a34595538fab4103d2d0396f792c88add72b9f5de8b7926b5675c8","observation_id":"2230f036-9414-42e2-8fb1-4fa1b7d5b3cb","resolution":{"observed_at":"2026-08-14T04:48:52.261563Z","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-14T04:48:53.011340Z","title":"Variance reduced halpern iteration for finite-sum monotone inclusions","venue":null,"work_id":"3733872c-fef4-4827-89cb-dad30ddc1a3a","year":2024},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.266450Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:37dbc74b5e83d253c1eb0fa2d2fbbaab05179efe1f12537b16e7a5cf6f2b4b6a","observation_id":"dc8333c9-910b-4ccf-9be4-708159631591","resolution":{"observed_at":"2026-08-14T04:48:53.014747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:53.001251Z","title":"Accelerated single-call methods for constrained min-max optimization","venue":null,"work_id":"189525c3-d30b-47be-867d-93bd25d6c568","year":2023},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.270311Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:aa34f0d4fdbebe05e35be8a224476d2a7a917266fbd336e6d6b851816a173897","observation_id":"821ad6e1-e363-476d-b924-a2df923c8fc2","resolution":{"observed_at":"2026-08-14T04:48:53.004944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.274420Z","title":"Finite-time last-iterate convergence for learning in multi-player games","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.274420Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:93ce5ced74ff19ae707eebe743e4c2463255db708522edb363717efd41b9f392","observation_id":"42d27d12-5964-472a-a786-3508de52dae2","resolution":{"observed_at":"2026-08-14T04:48:52.274420Z","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-14T04:48:52.986197Z","title":"Accelerated algorithms for constrained nonconvex- noncancave min-max optimization and comonotone inclusion","venue":null,"work_id":"6146e4e5-96d3-404a-bea7-36ed8dcf56da","year":2024},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.278054Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:46ee8a9e7ec2981a35d7601e637557f274e18dd26070d94e8e136e487745ffb3","observation_id":"91b9cf0e-f254-4a4e-a51f-7933b28238bd","resolution":{"observed_at":"2026-08-14T04:48:52.989597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.281850Z","title":"Distributionally robust optimization via ball oracle acceleration","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.281850Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:ddce2ac66abb79ba40b7ecbb3de113a14a1f66169d9b7cf72bad014bb2347889","observation_id":"786db073-0ee3-4a61-ae5c-650434f9c265","resolution":{"observed_at":"2026-08-14T04:48:52.281850Z","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-14T04:48:52.286053Z","title":"Optimal and adaptive monteiro-svaiter acceleration","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.286053Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:0e34cfe48dd34a23cfb6bcfe9450771fa2d5043a41fbc5e75c27169fa32d10fa","observation_id":"d7621a83-59e8-4af4-aa97-cc2a693f8af7","resolution":{"observed_at":"2026-08-14T04:48:52.286053Z","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-14T04:48:52.289650Z","title":"Cambridge university press, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.289650Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:767704b152c66cce2efdb6b4dc9632b2329683ac77a1cd9bdcfb0b55e631bc87","observation_id":"fc880f0c-9fe6-4283-8992-2320715cb709","resolution":{"observed_at":"2026-08-14T04:48:52.289650Z","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-14T04:48:52.955052Z","title":"Near-optimal algorithms for making the gradient small in stochastic minimax optimization.JMLR, 25(387):1–44, 2024","venue":null,"work_id":"1b2f1d69-6af0-44c2-90d6-0cf64113ed08","year":2024},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.293241Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:3b6ff48169c4522f2d582c3fbfc27cfa080ce1f2ed634d8a72ae03e6d953a811","observation_id":"582c6eb1-ed76-4a1c-a8d4-a55fdffaf801","resolution":{"observed_at":"2026-08-14T04:48:52.961719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.297292Z","title":"Solving convex-concave problems with O(ϵ−4/7)second-order oracle complexity","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.297292Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:d0b8a1735466c0327a9bdcae384a0453dba5b46dac27b0152cfce85f8e2fa8f1","observation_id":"b467d901-6d10-488e-bf0f-d75bd0e2bd39","resolution":{"observed_at":"2026-08-14T04:48:52.297292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.19462","last_updated":"2026-04-21T13:38:36Z","snapshot_observed_at":"2026-08-15T06:52:10.029322Z","submitted_at":"2026-04-21T13:38:36Z","title":"Solving Convex-Concave Problems with $\\tilde{\\mathcal{O}}(\\epsilon^{-4/(3p+1)})$ $p$th-Order Oracle Complexity","version":1},"cited_work":{"arxiv_id":"2604.19462","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.19462","snapshot_observed_at":"2026-08-14T04:48:52.534650Z","title":"Solving Convex-Concave Problems with $\\tilde{\\mathcal{O}}(\\epsilon^{-4/(3p+1)})$ $p$th-Order Oracle Complexity","venue":"math.OC","work_id":"46b5f5be-1d7f-4ea2-b8cd-3b26e2623aa3","year":2026},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.300829Z"},"links":{"cited_paper":"/paper/2604.19462","citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:532ed4644e4d271aee4cc0c9132f499949e19b1fbba6ec4e6071fc3b2e7f1fcb","observation_id":"f0d6b584-f92d-43a3-b077-76576f864069","resolution":{"observed_at":"2026-08-14T04:48:52.541021Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.938293Z","title":"Monotone operator theory in convex optimization: Pl combettes.Mathematical Programming, 170(1):177–206, 2018","venue":null,"work_id":"9bd11042-faa1-44b0-92a2-7c16dc805038","year":2018},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.304870Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:a2146bb7b0c1692aa65d88ff5f57a766c470fad04634b5b2bc6fdfc995e20536","observation_id":"b36f62ab-3936-4540-ab45-2a3d01fdc0f2","resolution":{"observed_at":"2026-08-14T04:48:52.942479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.926923Z","title":"Fast linear algebra is stable.Numerische Mathematik, 108(1):59–91, 2007","venue":null,"work_id":"a789ffa4-cdb1-4cd2-9cd1-86caf0b776d0","year":2007},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.308769Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:259ac85353d325e68cfd204226234b1676e8eecfdad95d7be1f4be3a04d1a6b7","observation_id":"9615faf5-86cb-4fe9-a4b8-ef55f586c96b","resolution":{"observed_at":"2026-08-14T04:48:52.931538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.914743Z","title":"Halpern iteration for near-optimal and parameter-free monotone inclusion and strong solutions to variational inequalities","venue":null,"work_id":"5b9fb88a-d143-40b0-b315-c6ca62b7e3ea","year":2020},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.312688Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:34510d2f7ce37bf721d9ad583e685cb397ad0d14376ddd4870cb7e6dc468bb6c","observation_id":"cb5fd2a5-c100-431c-b7b6-fd178b1a20dc","resolution":{"observed_at":"2026-08-14T04:48:52.919428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.901353Z","title":"Faster matrix multiplication via asymmetric hashing","venue":null,"work_id":"6f3a0bfa-9d27-4c64-9f5c-7b9ef71154e6","year":2023},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.316264Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:c228c4685b92bc9f7d8cbe8e9caf4e4dc30850f35d4bf06d2457c56f40ccd192","observation_id":"d87fbbbf-34c7-4fa1-a75e-410f28b7f68e","resolution":{"observed_at":"2026-08-14T04:48:52.906096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.320095Z","title":"Springer, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.320095Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:bf19973e67ed7d215c8a4e858d45a93542d770971ebdd0d083f4bacdb57b1c84","observation_id":"3fa4d584-ecd7-4803-bc83-8115f95fefa6","resolution":{"observed_at":"2026-08-14T04:48:52.320095Z","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-14T04:48:52.883261Z","title":"Near-optimal lower bounds for convex optimization for all orders of smoothness","venue":null,"work_id":"08db02a5-d6a5-4c9a-8ce8-0374f87ee968","year":2021},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.323788Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:cc22ed9c0c2dbb0c442fdcca33c654be3016efcd2595039004999b2cdda01b93","observation_id":"2526c670-392f-40a4-9ec9-ca65fd7b8584","resolution":{"observed_at":"2026-08-14T04:48:52.888089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.327846Z","title":"Optimal tensor methods in smooth convex and uniformly convexoptimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.327846Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:abf4d6995487676c396f2b594c669197c1c39e73746924d5341defa52e594e78","observation_id":"c39f46b2-b5d0-4dbd-a9df-4586b5d05ace","resolution":{"observed_at":"2026-08-14T04:48:52.327846Z","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-14T04:48:52.866733Z","title":"Springer, 1995","venue":null,"work_id":"2dd0798c-9b25-4209-b24f-382bdac30053","year":1995},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.331431Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:33ed3057220cc9a29d5bf863082e8b97080afd7e47c19f12ef74f2ed1a518077","observation_id":"d91c81ba-e442-4706-a90f-68a903e0069e","resolution":{"observed_at":"2026-08-14T04:48:52.870566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.335163Z","title":"Generative adversarial networks.Communications of the ACM, 63(11): 139–144, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.335163Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:f5f06ad9c9c6aa88bbefa172ca653507ce1296512817ed016df62f7a8eb2caa1","observation_id":"7cd89899-0532-4eba-ab5c-50e310ccc473","resolution":{"observed_at":"2026-08-14T04:48:52.335163Z","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-14T04:48:52.339964Z","title":"Fixed points of nonexpanding maps","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.339964Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:501c454d5705654810c69e973363eb1a6880ee418bd2990749d87a68d81e4737","observation_id":"0e467dcc-726a-4e3e-acbd-f654b710d173","resolution":{"observed_at":"2026-08-14T04:48:52.339964Z","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-14T04:48:52.844928Z","title":"On some non-linear elliptic differential-functional equations","venue":null,"work_id":"38362157-a50a-4b4c-89a6-b4ce5b3a19f0","year":1966},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.343650Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:3c556b9c859630ccc9466e0c94e421caa3add4376f3946cc8103d67750d07524","observation_id":"a784532a-15bb-42f7-bc52-d25397834e51","resolution":{"observed_at":"2026-08-14T04:48:52.849030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.347189Z","title":"An approximation-based regularized extra-gradient method for monotone variational inequalities.SIAM Journal on Optimization, 35(3):1469–1497, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.347189Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:ac857904cc92ea164db36b4750440f118ac9bbe70b66b55ef76025d0ffcb6b40","observation_id":"39c4babd-a939-4ccd-b938-f29564d43e6c","resolution":{"observed_at":"2026-08-14T04:48:52.347189Z","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-14T04:48:52.826992Z","title":"An optimal high-order tensor method for convex optimization.Mathematics of Operations Research, 46(4):1390–1412, 2021","venue":null,"work_id":"bbd6b111-c8d6-4af0-8c53-53271c307ff3","year":2021},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.350827Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:4b30edbe81d020797736ab1a9b675e17fdad4afa185a4463a98d2199ae67e83c","observation_id":"56f44cbb-f82b-407d-9e70-c7cbc94bef34","resolution":{"observed_at":"2026-08-14T04:48:52.831707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.354566Z","title":"An improved cutting plane method for convex optimization, convex-concave games, and its applications","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.354566Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:a0e3248276cb69a21813ae1ca93160b0cc4522f579dfd417507223213b9eb392","observation_id":"03226114-d0e1-4552-b3e2-b1c2e21e65e7","resolution":{"observed_at":"2026-08-14T04:48:52.354566Z","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-14T04:48:52.809504Z","title":"Generalized optimistic methods for convex-concave saddle point problems.SIAM Journal on Optimization, 35(3):2066–2097, 2025","venue":null,"work_id":"6cda0643-9b07-4ff4-93e1-d792044f3258","year":2025},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.358416Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:7731470980a43cdc84a0c0316757aa172896cb77a30b4b9e283a56696f2f0cd6","observation_id":"d38432af-03ce-4a87-94e6-a2501baf2d5e","resolution":{"observed_at":"2026-08-14T04:48:52.813914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.362164Z","title":"Adaptive and optimal second-order optimistic methods for minimax optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.362164Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:0930f78aa4c1ee1c79ef81df256dce90614a69d002f3ea37349e2f990b73e4d8","observation_id":"5d420d32-89ed-404b-aa86-c49ca2b1a915","resolution":{"observed_at":"2026-08-14T04:48:52.362164Z","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-14T04:48:52.791944Z","title":"Adaptive, doubly optimal no-regret learning in strongly monotone and exp-concave games with gradient feedback.Operations Research, 73(3):1675–1702, 2025","venue":null,"work_id":"10284e12-59b5-4a69-8d2c-bde5480b8e4f","year":2025},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.365919Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:26d5dc9d97a50dd29721b1050878400049cc166d85802a8f69ea19c5cf7b5bcc","observation_id":"3f240907-7ca1-4ae9-b3f4-aee3ca064dde","resolution":{"observed_at":"2026-08-14T04:48:52.795839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.780104Z","title":"An introduction to variational inequalities and their applications","venue":null,"work_id":"1f065270-54c3-4db2-b1da-873292109977","year":2000},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.369731Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:726ca68db5cde187766f3fefc75a7bd2167840252a0e2230c7b6954745b4ee93","observation_id":"2e0e4609-1757-4892-8a46-c8b5444afab5","resolution":{"observed_at":"2026-08-14T04:48:52.784284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.374400Z","title":"The extragradient method for finding saddle points and other problems.Matecon, 12:747–756, 1976","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.374400Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:75c879979d5aaeda64629592b30f3559bd2ee0896b3091fd19489b34ec97caff","observation_id":"2a52b7d0-40bc-4481-ae2f-a50c10def9f1","resolution":{"observed_at":"2026-08-14T04:48:52.374400Z","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-14T04:48:52.378003Z","title":"The first optimal acceleration of high-order methods in smooth convex optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.378003Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:3ff608a1e03063ab649dea9a19ee38d4aace514d7d1fc4bd7b98c221133938a8","observation_id":"27c8628e-31ab-4c87-9ddf-c76820adc3d5","resolution":{"observed_at":"2026-08-14T04:48:52.378003Z","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-14T04:48:52.753912Z","title":"Fast extra gradient methods for smooth structured nonconvex- nonconcave minimax problems","venue":null,"work_id":"e6e9b9b3-2929-47a2-9daf-7792ef4e65b9","year":2021},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.381739Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:e72acdbfc6b39db787ff58dc9ccedbcbf0e8a307b26226cf50eaf02a93811042","observation_id":"241d9968-b2dc-42dd-acdd-4fb6192603f1","resolution":{"observed_at":"2026-08-14T04:48:52.759649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.742048Z","title":"On the convergence rate of the halpern-iteration.Optimization letters, 15(2):405–418, 2020","venue":null,"work_id":"a2d658ce-e040-4662-a7ed-ec49bcf403e1","year":2020},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.385327Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:e01ebc04a55989bfb1e8783fbed8e53be0028d71803b56a5b581a67043e0be0f","observation_id":"52f6c246-0af5-4952-9051-84607ea45cdb","resolution":{"observed_at":"2026-08-14T04:48:52.746718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.389138Z","title":"Monotone inclusions, acceleration, and closed-loop control.Mathematics of Operations Research, 48(4):2353–2382, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.389138Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:e1880d26d7dcf02c0ba5247aad03f282464bfa4e6a1ccfc1ae11be38604b1348","observation_id":"2c7427bd-1bd5-4542-ac6f-eaaea92f5b7d","resolution":{"observed_at":"2026-08-14T04:48:52.389138Z","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-14T04:48:52.392748Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.392748Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:995d66d270506e2dab5e38ecbe87ae3158867f9e2192bb39496f053204be7965","observation_id":"f1287e5f-8995-4733-b8df-375bc4e0afc0","resolution":{"observed_at":"2026-08-14T04:48:52.392748Z","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-14T04:48:52.717786Z","title":"Monotone (nonlinear) operators in hilbert space","venue":null,"work_id":"cbafaf69-8441-4a86-ac2d-6e6a11d5aaf3","year":1962},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.396467Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:e5f92bcda5a3882dcdebfde0badb31d0f836120c7f69086a9196ca046d2a650b","observation_id":"1bdec612-f3b8-4d6a-8f09-62ecfb3c4411","resolution":{"observed_at":"2026-08-14T04:48:52.721890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.705566Z","title":"A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach","venue":null,"work_id":"6226ea5c-7de3-4bf0-8170-6f44b190b209","year":2020},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.400246Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:08705cf6ee996cb6fadf72aff8fd81cba7366b807b176f1295a2f4856818f45f","observation_id":"264768f8-2e09-4894-8713-630568765150","resolution":{"observed_at":"2026-08-14T04:48:52.710693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.403763Z","title":"Iteration-complexity of a newton proximal extragradient method for monotone variational inequalities and inclusion problems.SIAM Journal on Optimization, 22(3):914–935, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.403763Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:28371c20bc151f6f15a7f56caca95d04667d2cfb2c40d5e1fbfaebf2db81d1c4","observation_id":"e16336c3-b205-4324-a02d-f50d7424cfc8","resolution":{"observed_at":"2026-08-14T04:48:52.403763Z","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-14T04:48:52.407357Z","title":"An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods.SIAM Journal on Optimization, 23 (2):1092–1125, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.407357Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:0a14ff2d3756e2b60dc05dac07dd9a1b40b37cbfad945e11213c6ff151b13f76","observation_id":"261718dc-9060-45f5-b39f-c6a86e55071c","resolution":{"observed_at":"2026-08-14T04:48:52.407357Z","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-14T04:48:52.683217Z","title":null,"venue":null,"work_id":"903c1c0b-16f4-4a9c-8e04-db9b03306be1","year":2004},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.411209Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:21cbb98efd0b569be91d0b097af44c55ca7c20e9162cd8e9cda8025f9223d91d","observation_id":"40081a6b-1444-4d52-9567-78721d1824e3","resolution":{"observed_at":"2026-08-14T04:48:52.687356Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.414929Z","title":"Problem complexity and method efficiency in optimization","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.414929Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:ef237abed4f4b19f41c7dec8d3f5efc9c4725bb1e27573e0dd883f0e90cc57d5","observation_id":"7a79c995-b8a3-45c7-9977-8ee2c1812fb6","resolution":{"observed_at":"2026-08-14T04:48:52.414929Z","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-14T04:48:52.665081Z","title":"A method for solving the convex programming problem with convergence rateO(1/k2)","venue":null,"work_id":"b3079b15-4d10-4026-8ce1-8d9ec396daf5","year":1983},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.418754Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:9b3a9912440ee1570a1aa7049f34addd49510ba075e8bee24ff029cd2cd381a6","observation_id":"8be7eda2-78b8-434f-b600-dc0773b7fd28","resolution":{"observed_at":"2026-08-14T04:48:52.669663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.652835Z","title":"Dual extrapolation and its applications to solving variational inequalities and related problems.Mathematical Programming, 109(2-3):319–344, 2007","venue":null,"work_id":"1e3734e5-33dd-4693-a8c4-9bd25291c72b","year":2007},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.422400Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:e57d8f2d24f8ae47b1f219626a694ba7e9a6647bcb6b1efca77e7cd292ecd291","observation_id":"7edc0a7e-8307-48bf-9106-a9e09cb35149","resolution":{"observed_at":"2026-08-14T04:48:52.656814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.426274Z","title":"Accelerating the cubic regularization of newton’s method on convex problems.Mathe- matical Programming, 112(1):159–181, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.426274Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:ca41685793e4b1f41d9ed39641ea30614807d628210dd0d75d478e746cff4aa9","observation_id":"c2702443-bd4f-4dde-b83e-36bc52e316f1","resolution":{"observed_at":"2026-08-14T04:48:52.426274Z","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-14T04:48:52.430127Z","title":"Lectures on convex optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.430127Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:0c7fd8f01c5a6bc39df52baaa8a7f3d2b4444a99aa8813f430b17971c7975443","observation_id":"6c04920b-bbd3-4211-9f37-153df2770cd2","resolution":{"observed_at":"2026-08-14T04:48:52.430127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.15154","last_updated":"2023-12-02T07:07:57Z","snapshot_observed_at":"2026-08-16T14:40:23.520110Z","submitted_at":"2023-11-26T01:09:23Z","title":"High-Order Reduced-Gradient Methods for Composite Variational Inequalities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.15154","snapshot_observed_at":"2026-08-14T04:48:52.433933Z","title":"High-order reduced-gradient methods for composite variational inequalities.arXiv preprint arXiv:2311.15154, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.433933Z"},"links":{"cited_paper":"/paper/2311.15154","citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:981c9964ff80a81d9c90285be2c989d7a999c6d968ac08682916ee219797fd4e","observation_id":"1d13b401-4551-40eb-a193-d4e4c39bced3","resolution":{"observed_at":"2026-08-14T04:48:52.433933Z","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-14T04:48:52.438170Z","title":"Cubic regularization of newton method and its global performance","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.438170Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:747482632e93bb62f8022226e9593cb28695fa39f49f0662f651e7c90d3d4a24","observation_id":"4b65352b-7f49-4473-82ee-0c71a6c1f41a","resolution":{"observed_at":"2026-08-14T04:48:52.438170Z","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-14T04:48:52.622587Z","title":"Numerical optimization","venue":null,"work_id":"e6512094-5b16-4ab7-b3ca-74a8d01a42e9","year":1999},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.441657Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:98a121c96c3347d0b8e980934611f75459dd905d41daa6eecb3617339891ec93","observation_id":"2c2f0b53-96e3-4c24-9b17-4e446366fc5d","resolution":{"observed_at":"2026-08-14T04:48:52.627877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.15595","last_updated":"2021-04-13T15:51:01Z","snapshot_observed_at":"2026-08-16T18:55:06.480322Z","submitted_at":"2020-12-31T13:14:26Z","title":"Tensor methods for strongly convex strongly concave saddle point problems and strongly monotone variational inequalities","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.15595","snapshot_observed_at":"2026-08-14T04:48:52.445327Z","title":"Tensor methods for strongly convex strongly concave saddle point problems and strongly monotone variational inequalities","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.445327Z"},"links":{"cited_paper":"/paper/2012.15595","citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:ccf4b61dc045999dd7b9abdcef015b62e95f7a92fa7a0ef4ab3aa2039ffcd20d","observation_id":"03e73654-a56a-4a70-a153-6d524f4dbf88","resolution":{"observed_at":"2026-08-14T04:48:52.445327Z","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-14T04:48:52.449384Z","title":"Smoothing functions and smoothing newton method for complementarity and variational inequality problems.Journal of Optimization Theory and Applications, 113:121–147, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.449384Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:2525775e1c1155b79aaae79707dfe621a411c9acb4bf355bea5ad747e4412147","observation_id":"1c493fb5-d56c-4122-b6ea-b37e8e3b3383","resolution":{"observed_at":"2026-08-14T04:48:52.449384Z","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-14T04:48:52.453022Z","title":"Superlinear convergence of an interior-point method despite dependent constraints.Mathematics of Operations Research, 25(2):179–194, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.453022Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:84c71f51a79dacd1294d80044cc1ec34279565272e370a5eebd721f54aa94b2a","observation_id":"5e3729d7-7c9a-4c7f-8c04-7d840cfb9345","resolution":{"observed_at":"2026-08-14T04:48:52.453022Z","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-14T04:48:52.598080Z","title":"Tyrrell Rockafellar","venue":null,"work_id":"7c08930a-aa6f-4129-8b57-cf4e84b9bada","year":1976},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.456907Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:bd993b1f1460578f436999cbfea3a7cb8835a75b14917aeeee599e337793b810","observation_id":"7a0deacd-fd27-40e3-9efe-c3e6d910d4c2","resolution":{"observed_at":"2026-08-14T04:48:52.602016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.585924Z","title":"Ryu and Stephen Boyd","venue":null,"work_id":"be7b7e31-d159-41d7-afc9-e7afe505efe2","year":2016},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.460895Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:edfe446c9a30ce4d5abfff014fb294655466b869920ea6d8e6aac9f2587fc861","observation_id":"b63b472b-6e15-4f8f-a246-08e69d2cb606","resolution":{"observed_at":"2026-08-14T04:48:52.590027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.464760Z","title":"Ode analysis of stochastic gradient methods with optimism and anchoring for minimax problems.arXiv preprint arXiv:1905.10899, 2019","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.464760Z"},"links":{"cited_paper":"/paper/1905.10899","citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:c97dca66a10703d4bd031796e5559bfcf10a7c6d4e690ef95d929e2398ab9d69","observation_id":"c0f45aec-8c72-42d0-b3cd-b79c5aab2530","resolution":{"observed_at":"2026-08-14T04:48:52.464760Z","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-14T04:48:52.468629Z","title":"Stochastic online auc maximization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.468629Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:869233435d1870f38b03e2b5a81bf50cc9f972a2797b8c6bcffb4a7cdfe416d5","observation_id":"5e9d48f6-b951-4d0f-96f4-a04192a254e9","resolution":{"observed_at":"2026-08-14T04:48:52.468629Z","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-14T04:48:52.568798Z","title":null,"venue":null,"work_id":"c5dc3c82-c471-47db-9e06-acd82887fe8a","year":2021},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.473102Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:5447fd44eae36a16fb0e9594395bab998c8beebd6163faa3746d58ffdfa3f880","observation_id":"ffab9f99-944d-4132-ac62-1b1a31bb558e","resolution":{"observed_at":"2026-08-14T04:48:52.572492Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T04:48:52.557706Z","title":"Mitigating unwanted biases with adversarial learning","venue":null,"work_id":"1ad93d94-61b3-40a5-b6ef-0b1dc728c96e","year":2018},"citing_paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T04:48:52.476890Z"},"links":{"citing_paper":"/paper/2608.08463"},"observation_digest":"sha256:86f94acc53234461214265f4d0c14804ab0b5dcfd28efca6b76e4f7291625018","observation_id":"39579fbf-d456-40d5-abca-9ec8fad2d8eb","resolution":{"observed_at":"2026-08-14T04:48:52.562014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.08463","last_updated":"2026-08-09T04:13:20Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T16:04:24.991190Z","submitted_at":"2026-08-09T04:13:20Z","title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":1,"verified_fuzzy":29},"total_outbound_references":65},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2608.08463."}