{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2F3DRGZ2TOVWXC4UWD6H6YIEWW","short_pith_number":"pith:2F3DRGZ2","schema_version":"1.0","canonical_sha256":"d176389b3a9bab6b8b94b0fc7f6104b5950f8a12d9ec3f23a5a93b92fd46c914","source":{"kind":"arxiv","id":"2408.06606","version":2},"attestation_state":"computed","paper":{"title":"An extra gradient Anderson-accelerated algorithm for pseudomonotone variational inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Wei Bian, Xiaojun Chen, Xin Qu","submitted_at":"2024-08-13T03:39:31Z","abstract_excerpt":"This paper proposes an extra gradient Anderson-accelerated algorithm for solving pseudomonotone variational inequalities, which uses the extra gradient scheme with line search to guarantee the global convergence and Anderson acceleration to have fast convergent rate. We prove that the sequence generated by the proposed algorithm from any initial point converges to a solution of the pseudomonotone variational inequality problem without assuming the Lipschitz continuity and contractive condition, which are used for convergence analysis of the extra gradient method and Anderson-accelerated method"},"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":"2408.06606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-13T03:39:31Z","cross_cats_sorted":[],"title_canon_sha256":"32cc57daa53ba5b04d98ead1d5d322b8daedeb42f33723df95dc2cfdfe4733a1","abstract_canon_sha256":"c672d00930c219c9328cb39ac45fbf90feb3640f503dc814345039e09f322d70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:04:47.141262Z","signature_b64":"RGZ0c7J0s5m/bd4vjefrVDmgXL+TcA63BpjkhK7xU6gPd/VvfIEEmHmZy1P2doPeSxLLjSbWT4H7UrwJvdqBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d176389b3a9bab6b8b94b0fc7f6104b5950f8a12d9ec3f23a5a93b92fd46c914","last_reissued_at":"2026-05-27T01:04:47.140706Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:04:47.140706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An extra gradient Anderson-accelerated algorithm for pseudomonotone variational inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Wei Bian, Xiaojun Chen, Xin Qu","submitted_at":"2024-08-13T03:39:31Z","abstract_excerpt":"This paper proposes an extra gradient Anderson-accelerated algorithm for solving pseudomonotone variational inequalities, which uses the extra gradient scheme with line search to guarantee the global convergence and Anderson acceleration to have fast convergent rate. We prove that the sequence generated by the proposed algorithm from any initial point converges to a solution of the pseudomonotone variational inequality problem without assuming the Lipschitz continuity and contractive condition, which are used for convergence analysis of the extra gradient method and Anderson-accelerated method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.06606","kind":"arxiv","version":2},"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/2408.06606/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":"2408.06606","created_at":"2026-05-27T01:04:47.140792+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.06606v2","created_at":"2026-05-27T01:04:47.140792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.06606","created_at":"2026-05-27T01:04:47.140792+00:00"},{"alias_kind":"pith_short_12","alias_value":"2F3DRGZ2TOVW","created_at":"2026-05-27T01:04:47.140792+00:00"},{"alias_kind":"pith_short_16","alias_value":"2F3DRGZ2TOVWXC4U","created_at":"2026-05-27T01:04:47.140792+00:00"},{"alias_kind":"pith_short_8","alias_value":"2F3DRGZ2","created_at":"2026-05-27T01:04:47.140792+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16262","citing_title":"Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2F3DRGZ2TOVWXC4UWD6H6YIEWW","json":"https://pith.science/pith/2F3DRGZ2TOVWXC4UWD6H6YIEWW.json","graph_json":"https://pith.science/api/pith-number/2F3DRGZ2TOVWXC4UWD6H6YIEWW/graph.json","events_json":"https://pith.science/api/pith-number/2F3DRGZ2TOVWXC4UWD6H6YIEWW/events.json","paper":"https://pith.science/paper/2F3DRGZ2"},"agent_actions":{"view_html":"https://pith.science/pith/2F3DRGZ2TOVWXC4UWD6H6YIEWW","download_json":"https://pith.science/pith/2F3DRGZ2TOVWXC4UWD6H6YIEWW.json","view_paper":"https://pith.science/paper/2F3DRGZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.06606&json=true","fetch_graph":"https://pith.science/api/pith-number/2F3DRGZ2TOVWXC4UWD6H6YIEWW/graph.json","fetch_events":"https://pith.science/api/pith-number/2F3DRGZ2TOVWXC4UWD6H6YIEWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2F3DRGZ2TOVWXC4UWD6H6YIEWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2F3DRGZ2TOVWXC4UWD6H6YIEWW/action/storage_attestation","attest_author":"https://pith.science/pith/2F3DRGZ2TOVWXC4UWD6H6YIEWW/action/author_attestation","sign_citation":"https://pith.science/pith/2F3DRGZ2TOVWXC4UWD6H6YIEWW/action/citation_signature","submit_replication":"https://pith.science/pith/2F3DRGZ2TOVWXC4UWD6H6YIEWW/action/replication_record"}},"created_at":"2026-05-27T01:04:47.140792+00:00","updated_at":"2026-05-27T01:04:47.140792+00:00"}