{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XFFMEF2AGFBSY3KIEU5WXJ3BI5","short_pith_number":"pith:XFFMEF2A","schema_version":"1.0","canonical_sha256":"b94ac2174031432c6d48253b6ba7614778144a03680dbc147ddddc4a4e3daece","source":{"kind":"arxiv","id":"2605.16262","version":1},"attestation_state":"computed","paper":{"title":"Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Belal A. Alashqar, Fedor S. Stonyakin, Mohammad S. Alkousa, Seydamet S. Ablaev","submitted_at":"2026-02-24T18:56:00Z","abstract_excerpt":"Variational inequalities play a key role in machine learning research, such as generative adversarial networks, reinforcement learning, adversarial training, and generative models. This paper is devoted to the constrained variational inequality problems with functional constraints (inequality-type constraints). We propose some mirror descent-type algorithms that switch between productive and non-productive steps depending on the values of the functional constraints at iterations, with many different step size rules and stopping criteria. We analyze the proposed algorithms and prove their optim"},"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":"2605.16262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-02-24T18:56:00Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7e8639c8b37d5388aed5d13adea231df216a92e716fd00485f8b44ff1b58968d","abstract_canon_sha256":"4ca957a034f7569a94f4ad3c0313dfd72d58db617f86cfcb47c842837cc2ebc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:14.008530Z","signature_b64":"f82oHMEGp1rQGxk4FRtvC48XYt03rVsGZykD+GJmW94T3PXWcq/qtdCzYVk/7kKqPRaF7HSFP0zTycDpbJdLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b94ac2174031432c6d48253b6ba7614778144a03680dbc147ddddc4a4e3daece","last_reissued_at":"2026-05-20T00:02:14.007754Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:14.007754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Belal A. Alashqar, Fedor S. Stonyakin, Mohammad S. Alkousa, Seydamet S. Ablaev","submitted_at":"2026-02-24T18:56:00Z","abstract_excerpt":"Variational inequalities play a key role in machine learning research, such as generative adversarial networks, reinforcement learning, adversarial training, and generative models. This paper is devoted to the constrained variational inequality problems with functional constraints (inequality-type constraints). We propose some mirror descent-type algorithms that switch between productive and non-productive steps depending on the values of the functional constraints at iterations, with many different step size rules and stopping criteria. We analyze the proposed algorithms and prove their optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16262","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/2605.16262/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":"2605.16262","created_at":"2026-05-20T00:02:14.007882+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16262v1","created_at":"2026-05-20T00:02:14.007882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16262","created_at":"2026-05-20T00:02:14.007882+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFFMEF2AGFBS","created_at":"2026-05-20T00:02:14.007882+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFFMEF2AGFBSY3KI","created_at":"2026-05-20T00:02:14.007882+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFFMEF2A","created_at":"2026-05-20T00:02:14.007882+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/XFFMEF2AGFBSY3KIEU5WXJ3BI5","json":"https://pith.science/pith/XFFMEF2AGFBSY3KIEU5WXJ3BI5.json","graph_json":"https://pith.science/api/pith-number/XFFMEF2AGFBSY3KIEU5WXJ3BI5/graph.json","events_json":"https://pith.science/api/pith-number/XFFMEF2AGFBSY3KIEU5WXJ3BI5/events.json","paper":"https://pith.science/paper/XFFMEF2A"},"agent_actions":{"view_html":"https://pith.science/pith/XFFMEF2AGFBSY3KIEU5WXJ3BI5","download_json":"https://pith.science/pith/XFFMEF2AGFBSY3KIEU5WXJ3BI5.json","view_paper":"https://pith.science/paper/XFFMEF2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16262&json=true","fetch_graph":"https://pith.science/api/pith-number/XFFMEF2AGFBSY3KIEU5WXJ3BI5/graph.json","fetch_events":"https://pith.science/api/pith-number/XFFMEF2AGFBSY3KIEU5WXJ3BI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFFMEF2AGFBSY3KIEU5WXJ3BI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFFMEF2AGFBSY3KIEU5WXJ3BI5/action/storage_attestation","attest_author":"https://pith.science/pith/XFFMEF2AGFBSY3KIEU5WXJ3BI5/action/author_attestation","sign_citation":"https://pith.science/pith/XFFMEF2AGFBSY3KIEU5WXJ3BI5/action/citation_signature","submit_replication":"https://pith.science/pith/XFFMEF2AGFBSY3KIEU5WXJ3BI5/action/replication_record"}},"created_at":"2026-05-20T00:02:14.007882+00:00","updated_at":"2026-05-20T00:02:14.007882+00:00"}