{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OB4VK2KZJMXMVHB7WEP7LLJFFC","short_pith_number":"pith:OB4VK2KZ","schema_version":"1.0","canonical_sha256":"70795569594b2eca9c3fb11ff5ad25288f5ed80acf737f56ba6cb6d982246ea3","source":{"kind":"arxiv","id":"2608.08463","version":1},"attestation_state":"computed","paper":{"title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Chengchang Liu, Hengyu Wang, Jingzhao Zhang, Lesi Chen, Xinliang Zhang, Yongchao Chen","submitted_at":"2026-08-09T04:13:20Z","abstract_excerpt":"We study second- and higher-order methods for solving smooth monotone variational inequalities (MVI). Monteiro and Svaiter (SIAM J. Optim., 2012) showed that a second-order method, NPE, converges at the rate of $\\mathcal{O}(T^{-1.5})$. For convex-concave minimax optimization, a subset of MVI problems, Chen, Liu, Luo, and Zhang (COLT 2025) recently improved the complexity to $\\tilde{\\mathcal{O}}( T^{-1.75})$ . However, it is open whether the conjectured complexity for MVI can be improved. In this paper, by using a large-step inexact Halpern iteration, we propose a novel Halpern-NPE method that "},"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":"2608.08463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-09T04:13:20Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ead3ec94ff34e12468d7b03df54a31fcb9afa5d050f187d822cbf8427c4541d1","abstract_canon_sha256":"14a725a3d29f7e89a2b4b75d20c7da4ad977139b107f68f1e3326993e9faa3d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:22:41.844739Z","signature_b64":"Q+UHFn65oQmbVeC3cmoOOwl22aXd3kYgJmGboXzCjvbwtx83jMZByTNpgkEVRyPxDWEiAOqs90jlJQk+4Sz+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70795569594b2eca9c3fb11ff5ad25288f5ed80acf737f56ba6cb6d982246ea3","last_reissued_at":"2026-08-11T01:22:41.842369Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:22:41.842369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Halpern Iteration Achieves $\\tilde{\\mathcal{O}}(\\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Chengchang Liu, Hengyu Wang, Jingzhao Zhang, Lesi Chen, Xinliang Zhang, Yongchao Chen","submitted_at":"2026-08-09T04:13:20Z","abstract_excerpt":"We study second- and higher-order methods for solving smooth monotone variational inequalities (MVI). Monteiro and Svaiter (SIAM J. Optim., 2012) showed that a second-order method, NPE, converges at the rate of $\\mathcal{O}(T^{-1.5})$. For convex-concave minimax optimization, a subset of MVI problems, Chen, Liu, Luo, and Zhang (COLT 2025) recently improved the complexity to $\\tilde{\\mathcal{O}}( T^{-1.75})$ . However, it is open whether the conjectured complexity for MVI can be improved. In this paper, by using a large-step inexact Halpern iteration, we propose a novel Halpern-NPE method that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08463","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/2608.08463/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":"2608.08463","created_at":"2026-08-11T01:22:41.843143+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.08463v1","created_at":"2026-08-11T01:22:41.843143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08463","created_at":"2026-08-11T01:22:41.843143+00:00"},{"alias_kind":"pith_short_12","alias_value":"OB4VK2KZJMXM","created_at":"2026-08-11T01:22:41.843143+00:00"},{"alias_kind":"pith_short_16","alias_value":"OB4VK2KZJMXMVHB7","created_at":"2026-08-11T01:22:41.843143+00:00"},{"alias_kind":"pith_short_8","alias_value":"OB4VK2KZ","created_at":"2026-08-11T01:22:41.843143+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OB4VK2KZJMXMVHB7WEP7LLJFFC","json":"https://pith.science/pith/OB4VK2KZJMXMVHB7WEP7LLJFFC.json","graph_json":"https://pith.science/api/pith-number/OB4VK2KZJMXMVHB7WEP7LLJFFC/graph.json","events_json":"https://pith.science/api/pith-number/OB4VK2KZJMXMVHB7WEP7LLJFFC/events.json","paper":"https://pith.science/paper/OB4VK2KZ"},"agent_actions":{"view_html":"https://pith.science/pith/OB4VK2KZJMXMVHB7WEP7LLJFFC","download_json":"https://pith.science/pith/OB4VK2KZJMXMVHB7WEP7LLJFFC.json","view_paper":"https://pith.science/paper/OB4VK2KZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.08463&json=true","fetch_graph":"https://pith.science/api/pith-number/OB4VK2KZJMXMVHB7WEP7LLJFFC/graph.json","fetch_events":"https://pith.science/api/pith-number/OB4VK2KZJMXMVHB7WEP7LLJFFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OB4VK2KZJMXMVHB7WEP7LLJFFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OB4VK2KZJMXMVHB7WEP7LLJFFC/action/storage_attestation","attest_author":"https://pith.science/pith/OB4VK2KZJMXMVHB7WEP7LLJFFC/action/author_attestation","sign_citation":"https://pith.science/pith/OB4VK2KZJMXMVHB7WEP7LLJFFC/action/citation_signature","submit_replication":"https://pith.science/pith/OB4VK2KZJMXMVHB7WEP7LLJFFC/action/replication_record"}},"created_at":"2026-08-11T01:22:41.843143+00:00","updated_at":"2026-08-11T01:22:41.843143+00:00"}