{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HOAJPPZLVDZVCCIWHXTGDPP4YY","short_pith_number":"pith:HOAJPPZL","schema_version":"1.0","canonical_sha256":"3b8097bf2ba8f35109163de661bdfcc61234ddf78c63a9a860ff41f0d02236ca","source":{"kind":"arxiv","id":"2307.12946","version":1},"attestation_state":"computed","paper":{"title":"Optimal Algorithm with Complexity Separation for Strongly Convex-Strongly Concave Composite Saddle Point Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aleksandr Beznosikov, Alexander Gasnikov, Dmitry Kovalev, Ekaterina Borodich, Georgiy Kormakov","submitted_at":"2023-07-24T17:18:35Z","abstract_excerpt":"In this work, we focuses on the following saddle point problem $\\min_x \\max_y p(x) + R(x,y) - q(y)$ where $R(x,y)$ is $L_R$-smooth, $\\mu_x$-strongly convex, $\\mu_y$-strongly concave and $p(x), q(y)$ are convex and $L_p, L_q$-smooth respectively. We present a new algorithm with optimal overall complexity $\\mathcal{O}\\left(\\left(\\sqrt{\\frac{L_p}{\\mu_x}} + \\frac{L_R}{\\sqrt{\\mu_x \\mu_y}} + \\sqrt{\\frac{L_q}{\\mu_y}}\\right)\\log \\frac{1}{\\varepsilon}\\right)$ and separation of oracle calls in the composite and saddle part. This algorithm requires $\\mathcal{O}\\left(\\left(\\sqrt{\\frac{L_p}{\\mu_x}} + \\sqrt"},"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":"2307.12946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-24T17:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"622a139135c633dd9c315b9fec77987069f25b7d68d8a28376ce8212a628bd99","abstract_canon_sha256":"39380716e46100e820bc07832606b6010827dfc3a76fc8052b25ab8c184901d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:00.417253Z","signature_b64":"qugG7XuPatpEBX7iCyWCktARi0c+yXkvR1c/uNI9SmgMkHRqNHMVZUC1PpHwSi4yM9wR6vcT/BHdd8Iaz41zAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b8097bf2ba8f35109163de661bdfcc61234ddf78c63a9a860ff41f0d02236ca","last_reissued_at":"2026-07-05T06:34:00.416779Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:00.416779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Algorithm with Complexity Separation for Strongly Convex-Strongly Concave Composite Saddle Point Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aleksandr Beznosikov, Alexander Gasnikov, Dmitry Kovalev, Ekaterina Borodich, Georgiy Kormakov","submitted_at":"2023-07-24T17:18:35Z","abstract_excerpt":"In this work, we focuses on the following saddle point problem $\\min_x \\max_y p(x) + R(x,y) - q(y)$ where $R(x,y)$ is $L_R$-smooth, $\\mu_x$-strongly convex, $\\mu_y$-strongly concave and $p(x), q(y)$ are convex and $L_p, L_q$-smooth respectively. We present a new algorithm with optimal overall complexity $\\mathcal{O}\\left(\\left(\\sqrt{\\frac{L_p}{\\mu_x}} + \\frac{L_R}{\\sqrt{\\mu_x \\mu_y}} + \\sqrt{\\frac{L_q}{\\mu_y}}\\right)\\log \\frac{1}{\\varepsilon}\\right)$ and separation of oracle calls in the composite and saddle part. This algorithm requires $\\mathcal{O}\\left(\\left(\\sqrt{\\frac{L_p}{\\mu_x}} + \\sqrt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.12946","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/2307.12946/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":"2307.12946","created_at":"2026-07-05T06:34:00.416838+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.12946v1","created_at":"2026-07-05T06:34:00.416838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12946","created_at":"2026-07-05T06:34:00.416838+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOAJPPZLVDZV","created_at":"2026-07-05T06:34:00.416838+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOAJPPZLVDZVCCIW","created_at":"2026-07-05T06:34:00.416838+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOAJPPZL","created_at":"2026-07-05T06:34:00.416838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22644","citing_title":"Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics","ref_index":73,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY","json":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY.json","graph_json":"https://pith.science/api/pith-number/HOAJPPZLVDZVCCIWHXTGDPP4YY/graph.json","events_json":"https://pith.science/api/pith-number/HOAJPPZLVDZVCCIWHXTGDPP4YY/events.json","paper":"https://pith.science/paper/HOAJPPZL"},"agent_actions":{"view_html":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY","download_json":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY.json","view_paper":"https://pith.science/paper/HOAJPPZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.12946&json=true","fetch_graph":"https://pith.science/api/pith-number/HOAJPPZLVDZVCCIWHXTGDPP4YY/graph.json","fetch_events":"https://pith.science/api/pith-number/HOAJPPZLVDZVCCIWHXTGDPP4YY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY/action/storage_attestation","attest_author":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY/action/author_attestation","sign_citation":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY/action/citation_signature","submit_replication":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY/action/replication_record"}},"created_at":"2026-07-05T06:34:00.416838+00:00","updated_at":"2026-07-05T06:34:00.416838+00:00"}