{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:U6GXDVKEFOQF4EM4FYROMS4CFS","short_pith_number":"pith:U6GXDVKE","schema_version":"1.0","canonical_sha256":"a78d71d5442ba05e119c2e22e64b822c968407651b6c9ce7c2134feebb45f01f","source":{"kind":"arxiv","id":"2210.04440","version":1},"attestation_state":"computed","paper":{"title":"An Approximation-Based Regularized Extra-Gradient Method for Monotone Variational Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kevin Huang, Shuzhong Zhang","submitted_at":"2022-10-10T05:13:07Z","abstract_excerpt":"In this paper, we propose a general extra-gradient scheme for solving monotone variational inequalities (VI), referred to here as Approximation-based Regularized Extra-gradient method (ARE). The first step of ARE solves a VI subproblem with an approximation operator satisfying a $p^{th}$-order Lipschitz bound with respect to the original mapping, further coupled with the gradient of a $(p+1)^{th}$-order regularization. The optimal global convergence is guaranteed by including an additional extra-gradient step, while a $p^{th}$-order superlinear local convergence is shown to hold if the VI is s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2210.04440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-10T05:13:07Z","cross_cats_sorted":[],"title_canon_sha256":"5f2a924d4d92ff9c84794bcf21da888838b35bc0d6c86e7be0f613c2f406c773","abstract_canon_sha256":"de5e94e68f29a2ff47b444061db70f8c9c6da4158e73db0a71e93e62f6dfdbfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:53.470896Z","signature_b64":"BwciUdE7deRzCo6bbHOxSYwkFxN717i4Riip3BkAubbKyFiBw9kzGxjodnXxfeCw6rF0BEJS2K6pE5QFGguaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a78d71d5442ba05e119c2e22e64b822c968407651b6c9ce7c2134feebb45f01f","last_reissued_at":"2026-07-05T05:04:53.470490Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:53.470490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Approximation-Based Regularized Extra-Gradient Method for Monotone Variational Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kevin Huang, Shuzhong Zhang","submitted_at":"2022-10-10T05:13:07Z","abstract_excerpt":"In this paper, we propose a general extra-gradient scheme for solving monotone variational inequalities (VI), referred to here as Approximation-based Regularized Extra-gradient method (ARE). The first step of ARE solves a VI subproblem with an approximation operator satisfying a $p^{th}$-order Lipschitz bound with respect to the original mapping, further coupled with the gradient of a $(p+1)^{th}$-order regularization. The optimal global convergence is guaranteed by including an additional extra-gradient step, while a $p^{th}$-order superlinear local convergence is shown to hold if the VI is s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.04440","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.04440/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2210.04440","created_at":"2026-07-05T05:04:53.470548+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.04440v1","created_at":"2026-07-05T05:04:53.470548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04440","created_at":"2026-07-05T05:04:53.470548+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6GXDVKEFOQF","created_at":"2026-07-05T05:04:53.470548+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6GXDVKEFOQF4EM4","created_at":"2026-07-05T05:04:53.470548+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6GXDVKE","created_at":"2026-07-05T05:04:53.470548+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08362","citing_title":"Solving Convex-Concave Problems with $\\tilde{\\mathcal{O}}(\\epsilon^{-4/7})$ Second-Order Oracle Complexity","ref_index":2019,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U6GXDVKEFOQF4EM4FYROMS4CFS","json":"https://pith.science/pith/U6GXDVKEFOQF4EM4FYROMS4CFS.json","graph_json":"https://pith.science/api/pith-number/U6GXDVKEFOQF4EM4FYROMS4CFS/graph.json","events_json":"https://pith.science/api/pith-number/U6GXDVKEFOQF4EM4FYROMS4CFS/events.json","paper":"https://pith.science/paper/U6GXDVKE"},"agent_actions":{"view_html":"https://pith.science/pith/U6GXDVKEFOQF4EM4FYROMS4CFS","download_json":"https://pith.science/pith/U6GXDVKEFOQF4EM4FYROMS4CFS.json","view_paper":"https://pith.science/paper/U6GXDVKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.04440&json=true","fetch_graph":"https://pith.science/api/pith-number/U6GXDVKEFOQF4EM4FYROMS4CFS/graph.json","fetch_events":"https://pith.science/api/pith-number/U6GXDVKEFOQF4EM4FYROMS4CFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6GXDVKEFOQF4EM4FYROMS4CFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6GXDVKEFOQF4EM4FYROMS4CFS/action/storage_attestation","attest_author":"https://pith.science/pith/U6GXDVKEFOQF4EM4FYROMS4CFS/action/author_attestation","sign_citation":"https://pith.science/pith/U6GXDVKEFOQF4EM4FYROMS4CFS/action/citation_signature","submit_replication":"https://pith.science/pith/U6GXDVKEFOQF4EM4FYROMS4CFS/action/replication_record"}},"created_at":"2026-07-05T05:04:53.470548+00:00","updated_at":"2026-07-05T05:04:53.470548+00:00"}