{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:N5RY3VQSZ3LIFX3ULG5NJ7YY4A","short_pith_number":"pith:N5RY3VQS","schema_version":"1.0","canonical_sha256":"6f638dd612ced682df7459bad4ff18e01e806964496281f7384017b8f861cdc7","source":{"kind":"arxiv","id":"2201.12206","version":2},"attestation_state":"computed","paper":{"title":"A Unified Analysis of Variational Inequality Methods: Variance Reduction, Sampling, Quantization and Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aleksandr Beznosikov, Alexander Gasnikov, Alexander Maslovskiy, Dmitry Pasechnyuk, Karina Zainulina","submitted_at":"2022-01-28T16:01:18Z","abstract_excerpt":"In this paper, we present a unified analysis of methods for such a wide class of problems as variational inequalities, which includes minimization problems and saddle point problems. We develop our analysis on the modified Extra-Gradient method (the classic algorithm for variational inequalities) and consider the strongly monotone and monotone cases, which corresponds to strongly-convex-strongly-concave and convex-concave saddle point problems. The theoretical analysis is based on parametric assumptions about Extra-Gradient iterations. Therefore, it can serve as a strong basis for combining th"},"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":"2201.12206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-01-28T16:01:18Z","cross_cats_sorted":[],"title_canon_sha256":"78e7be2cd4f64881134cb84060e284bc55e4fd4ee2dd9adcb66aced63814a873","abstract_canon_sha256":"eacfcb93d33fd9efce5e17429b8988c281a74022b8fa8a5dafc03e7573e3fcad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:10.455753Z","signature_b64":"XZO+mM1KO4Flyi4UZJ2PWIZaRKby3cw1U3s9hc5BRFX7bAw082YJQzstDOfgK/r1mBWgZIAUvNKR+uXM4/bICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f638dd612ced682df7459bad4ff18e01e806964496281f7384017b8f861cdc7","last_reissued_at":"2026-07-05T06:01:10.455189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:10.455189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Analysis of Variational Inequality Methods: Variance Reduction, Sampling, Quantization and Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aleksandr Beznosikov, Alexander Gasnikov, Alexander Maslovskiy, Dmitry Pasechnyuk, Karina Zainulina","submitted_at":"2022-01-28T16:01:18Z","abstract_excerpt":"In this paper, we present a unified analysis of methods for such a wide class of problems as variational inequalities, which includes minimization problems and saddle point problems. We develop our analysis on the modified Extra-Gradient method (the classic algorithm for variational inequalities) and consider the strongly monotone and monotone cases, which corresponds to strongly-convex-strongly-concave and convex-concave saddle point problems. The theoretical analysis is based on parametric assumptions about Extra-Gradient iterations. Therefore, it can serve as a strong basis for combining th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12206","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/2201.12206/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":"2201.12206","created_at":"2026-07-05T06:01:10.455257+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12206v2","created_at":"2026-07-05T06:01:10.455257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12206","created_at":"2026-07-05T06:01:10.455257+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5RY3VQSZ3LI","created_at":"2026-07-05T06:01:10.455257+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5RY3VQSZ3LIFX3U","created_at":"2026-07-05T06:01:10.455257+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5RY3VQS","created_at":"2026-07-05T06:01:10.455257+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14935","citing_title":"Effective Method with Compression for Distributed and Federated Cocoercive Variational Inequalities","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N5RY3VQSZ3LIFX3ULG5NJ7YY4A","json":"https://pith.science/pith/N5RY3VQSZ3LIFX3ULG5NJ7YY4A.json","graph_json":"https://pith.science/api/pith-number/N5RY3VQSZ3LIFX3ULG5NJ7YY4A/graph.json","events_json":"https://pith.science/api/pith-number/N5RY3VQSZ3LIFX3ULG5NJ7YY4A/events.json","paper":"https://pith.science/paper/N5RY3VQS"},"agent_actions":{"view_html":"https://pith.science/pith/N5RY3VQSZ3LIFX3ULG5NJ7YY4A","download_json":"https://pith.science/pith/N5RY3VQSZ3LIFX3ULG5NJ7YY4A.json","view_paper":"https://pith.science/paper/N5RY3VQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12206&json=true","fetch_graph":"https://pith.science/api/pith-number/N5RY3VQSZ3LIFX3ULG5NJ7YY4A/graph.json","fetch_events":"https://pith.science/api/pith-number/N5RY3VQSZ3LIFX3ULG5NJ7YY4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5RY3VQSZ3LIFX3ULG5NJ7YY4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5RY3VQSZ3LIFX3ULG5NJ7YY4A/action/storage_attestation","attest_author":"https://pith.science/pith/N5RY3VQSZ3LIFX3ULG5NJ7YY4A/action/author_attestation","sign_citation":"https://pith.science/pith/N5RY3VQSZ3LIFX3ULG5NJ7YY4A/action/citation_signature","submit_replication":"https://pith.science/pith/N5RY3VQSZ3LIFX3ULG5NJ7YY4A/action/replication_record"}},"created_at":"2026-07-05T06:01:10.455257+00:00","updated_at":"2026-07-05T06:01:10.455257+00:00"}