{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2X4ADOB3Z666CS7A5YOLLNMHFM","short_pith_number":"pith:2X4ADOB3","schema_version":"1.0","canonical_sha256":"d5f801b83bcfbde14be0ee1cb5b5872b06532e5f6708ead119677cc7a7f2028b","source":{"kind":"arxiv","id":"2012.15595","version":3},"attestation_state":"computed","paper":{"title":"Tensor methods for strongly convex strongly concave saddle point problems and strongly monotone variational inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Pavel Dvurechensky, Petr Ostroukhov, Rinat Kamalov","submitted_at":"2020-12-31T13:14:26Z","abstract_excerpt":"In this paper we propose three $p$-th order tensor methods for $\\mu$-strongly-convex-strongly-concave saddle point problems (SPP). The first method is based on the assumption of $p$-th order smoothness of the objective and it achieves a convergence rate of $O \\left( \\left( \\frac{L_p R^{p - 1}}{\\mu} \\right)^\\frac{2}{p + 1} \\log \\frac{\\mu R^2}{\\varepsilon_G} \\right)$, where $R$ is an estimate of the initial distance to the solution, and $\\varepsilon_G$ is the error in terms of duality gap. Under additional assumptions of first and second order smoothness of the objective we connect the first met"},"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":"2012.15595","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-12-31T13:14:26Z","cross_cats_sorted":[],"title_canon_sha256":"08bcb24c6c2481eb9f4c9481fbbd346347e78f4f137ac37e457e113ad0e0681a","abstract_canon_sha256":"6415cd0070e71b5125d6ce6d3f51f3160dd88ff858af1131c09da582c197ea76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:31:22.361986Z","signature_b64":"mQIBq4A19Btd4Tsy/Df4+aOZIYQiWIzpJf/L+r7H6kvFcNIlV0gNiZ/xjoYesizdnuPzv5MzYNGqunQanm3uBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5f801b83bcfbde14be0ee1cb5b5872b06532e5f6708ead119677cc7a7f2028b","last_reissued_at":"2026-07-05T02:31:22.361413Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:31:22.361413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor methods for strongly convex strongly concave saddle point problems and strongly monotone variational inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Pavel Dvurechensky, Petr Ostroukhov, Rinat Kamalov","submitted_at":"2020-12-31T13:14:26Z","abstract_excerpt":"In this paper we propose three $p$-th order tensor methods for $\\mu$-strongly-convex-strongly-concave saddle point problems (SPP). The first method is based on the assumption of $p$-th order smoothness of the objective and it achieves a convergence rate of $O \\left( \\left( \\frac{L_p R^{p - 1}}{\\mu} \\right)^\\frac{2}{p + 1} \\log \\frac{\\mu R^2}{\\varepsilon_G} \\right)$, where $R$ is an estimate of the initial distance to the solution, and $\\varepsilon_G$ is the error in terms of duality gap. Under additional assumptions of first and second order smoothness of the objective we connect the first met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15595","kind":"arxiv","version":3},"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/2012.15595/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":"2012.15595","created_at":"2026-07-05T02:31:22.361487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.15595v3","created_at":"2026-07-05T02:31:22.361487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15595","created_at":"2026-07-05T02:31:22.361487+00:00"},{"alias_kind":"pith_short_12","alias_value":"2X4ADOB3Z666","created_at":"2026-07-05T02:31:22.361487+00:00"},{"alias_kind":"pith_short_16","alias_value":"2X4ADOB3Z666CS7A","created_at":"2026-07-05T02:31:22.361487+00:00"},{"alias_kind":"pith_short_8","alias_value":"2X4ADOB3","created_at":"2026-07-05T02:31:22.361487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15769","citing_title":"Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2X4ADOB3Z666CS7A5YOLLNMHFM","json":"https://pith.science/pith/2X4ADOB3Z666CS7A5YOLLNMHFM.json","graph_json":"https://pith.science/api/pith-number/2X4ADOB3Z666CS7A5YOLLNMHFM/graph.json","events_json":"https://pith.science/api/pith-number/2X4ADOB3Z666CS7A5YOLLNMHFM/events.json","paper":"https://pith.science/paper/2X4ADOB3"},"agent_actions":{"view_html":"https://pith.science/pith/2X4ADOB3Z666CS7A5YOLLNMHFM","download_json":"https://pith.science/pith/2X4ADOB3Z666CS7A5YOLLNMHFM.json","view_paper":"https://pith.science/paper/2X4ADOB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.15595&json=true","fetch_graph":"https://pith.science/api/pith-number/2X4ADOB3Z666CS7A5YOLLNMHFM/graph.json","fetch_events":"https://pith.science/api/pith-number/2X4ADOB3Z666CS7A5YOLLNMHFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2X4ADOB3Z666CS7A5YOLLNMHFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2X4ADOB3Z666CS7A5YOLLNMHFM/action/storage_attestation","attest_author":"https://pith.science/pith/2X4ADOB3Z666CS7A5YOLLNMHFM/action/author_attestation","sign_citation":"https://pith.science/pith/2X4ADOB3Z666CS7A5YOLLNMHFM/action/citation_signature","submit_replication":"https://pith.science/pith/2X4ADOB3Z666CS7A5YOLLNMHFM/action/replication_record"}},"created_at":"2026-07-05T02:31:22.361487+00:00","updated_at":"2026-07-05T02:31:22.361487+00:00"}