{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JWQDKYHT54IXICYTAYR3FRDXXH","short_pith_number":"pith:JWQDKYHT","schema_version":"1.0","canonical_sha256":"4da03560f3ef11740b130623b2c477b9e7fa5d6410ac60dc619cd85a82ff77de","source":{"kind":"arxiv","id":"2206.01095","version":2},"attestation_state":"computed","paper":{"title":"Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, David Dobre, Eduard Gorbunov, Gauthier Gidel, Marina Danilova, Pavel Dvurechensky","submitted_at":"2022-06-02T15:21:55Z","abstract_excerpt":"Stochastic first-order methods such as Stochastic Extragradient (SEG) or Stochastic Gradient Descent-Ascent (SGDA) for solving smooth minimax problems and, more generally, variational inequality problems (VIP) have been gaining a lot of attention in recent years due to the growing popularity of adversarial formulations in machine learning. However, while high-probability convergence bounds are known to reflect the actual behavior of stochastic methods more accurately, most convergence results are provided in expectation. Moreover, the only known high-probability complexity results have been de"},"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":"2206.01095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-06-02T15:21:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e7a44236e55ac208af3c6353522ec8b9a87cbdf228cb26be984b1ce42673097e","abstract_canon_sha256":"b90eef8cd3f7756fad8c64eda0c87d682bca2d393df4bab5ba8afdc41ddaf5c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:12.444373Z","signature_b64":"DQud39etXxp4/j+udM++y8CekjM/LinkvORItacNDZa+VFIiXtSrBThVdkpPlickuCsYVT7EI8JWmD3qIHqvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4da03560f3ef11740b130623b2c477b9e7fa5d6410ac60dc619cd85a82ff77de","last_reissued_at":"2026-07-05T05:12:12.443895Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:12.443895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, David Dobre, Eduard Gorbunov, Gauthier Gidel, Marina Danilova, Pavel Dvurechensky","submitted_at":"2022-06-02T15:21:55Z","abstract_excerpt":"Stochastic first-order methods such as Stochastic Extragradient (SEG) or Stochastic Gradient Descent-Ascent (SGDA) for solving smooth minimax problems and, more generally, variational inequality problems (VIP) have been gaining a lot of attention in recent years due to the growing popularity of adversarial formulations in machine learning. However, while high-probability convergence bounds are known to reflect the actual behavior of stochastic methods more accurately, most convergence results are provided in expectation. Moreover, the only known high-probability complexity results have been de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.01095","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/2206.01095/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":"2206.01095","created_at":"2026-07-05T05:12:12.443950+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.01095v2","created_at":"2026-07-05T05:12:12.443950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.01095","created_at":"2026-07-05T05:12:12.443950+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWQDKYHT54IX","created_at":"2026-07-05T05:12:12.443950+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWQDKYHT54IXICYT","created_at":"2026-07-05T05:12:12.443950+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWQDKYHT","created_at":"2026-07-05T05:12:12.443950+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16875","citing_title":"Stochastic Optimization and Data Science","ref_index":111,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JWQDKYHT54IXICYTAYR3FRDXXH","json":"https://pith.science/pith/JWQDKYHT54IXICYTAYR3FRDXXH.json","graph_json":"https://pith.science/api/pith-number/JWQDKYHT54IXICYTAYR3FRDXXH/graph.json","events_json":"https://pith.science/api/pith-number/JWQDKYHT54IXICYTAYR3FRDXXH/events.json","paper":"https://pith.science/paper/JWQDKYHT"},"agent_actions":{"view_html":"https://pith.science/pith/JWQDKYHT54IXICYTAYR3FRDXXH","download_json":"https://pith.science/pith/JWQDKYHT54IXICYTAYR3FRDXXH.json","view_paper":"https://pith.science/paper/JWQDKYHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.01095&json=true","fetch_graph":"https://pith.science/api/pith-number/JWQDKYHT54IXICYTAYR3FRDXXH/graph.json","fetch_events":"https://pith.science/api/pith-number/JWQDKYHT54IXICYTAYR3FRDXXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWQDKYHT54IXICYTAYR3FRDXXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWQDKYHT54IXICYTAYR3FRDXXH/action/storage_attestation","attest_author":"https://pith.science/pith/JWQDKYHT54IXICYTAYR3FRDXXH/action/author_attestation","sign_citation":"https://pith.science/pith/JWQDKYHT54IXICYTAYR3FRDXXH/action/citation_signature","submit_replication":"https://pith.science/pith/JWQDKYHT54IXICYTAYR3FRDXXH/action/replication_record"}},"created_at":"2026-07-05T05:12:12.443950+00:00","updated_at":"2026-07-05T05:12:12.443950+00:00"}