{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HOAJPPZLVDZVCCIWHXTGDPP4YY","short_pith_number":"pith:HOAJPPZL","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"},"canonical_sha256":"3b8097bf2ba8f35109163de661bdfcc61234ddf78c63a9a860ff41f0d02236ca","source":{"kind":"arxiv","id":"2307.12946","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.12946","created_at":"2026-07-05T06:34:00Z"},{"alias_kind":"arxiv_version","alias_value":"2307.12946v1","created_at":"2026-07-05T06:34:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12946","created_at":"2026-07-05T06:34:00Z"},{"alias_kind":"pith_short_12","alias_value":"HOAJPPZLVDZV","created_at":"2026-07-05T06:34:00Z"},{"alias_kind":"pith_short_16","alias_value":"HOAJPPZLVDZVCCIW","created_at":"2026-07-05T06:34:00Z"},{"alias_kind":"pith_short_8","alias_value":"HOAJPPZL","created_at":"2026-07-05T06:34:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HOAJPPZLVDZVCCIWHXTGDPP4YY","target":"record","payload":{"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"},"canonical_sha256":"3b8097bf2ba8f35109163de661bdfcc61234ddf78c63a9a860ff41f0d02236ca","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"},"source_kind":"arxiv","source_id":"2307.12946","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:34:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ToLAGXHvA/NOBk0ulflBF9ZmJHGb7U5s4j2TLC08L0mjXm//fPNhZYwIJVUmPlYcZDmSQPfspenpvGXsNakiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:11:30.867042Z"},"content_sha256":"2b68166f9e8caaf3dcc4eeddd840a6b6d9432bf7ad6690434c539a7cf33e60b9","schema_version":"1.0","event_id":"sha256:2b68166f9e8caaf3dcc4eeddd840a6b6d9432bf7ad6690434c539a7cf33e60b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HOAJPPZLVDZVCCIWHXTGDPP4YY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:34:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btEIn0w9mOI5LjX5XW3sZAacv+hvjUfa3IGSPijijdiPKUESUDpUopOYSPq5PgmMfJgPe9neaq1zEH+Jmj4LCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:11:30.867630Z"},"content_sha256":"691e24e089b4f5580c55c8aba17eaf13f0c9ae21069b7d163490e8b3dab14a04","schema_version":"1.0","event_id":"sha256:691e24e089b4f5580c55c8aba17eaf13f0c9ae21069b7d163490e8b3dab14a04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY/bundle.json","state_url":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T09:11:30Z","links":{"resolver":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY","bundle":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY/bundle.json","state":"https://pith.science/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOAJPPZLVDZVCCIWHXTGDPP4YY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HOAJPPZLVDZVCCIWHXTGDPP4YY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"39380716e46100e820bc07832606b6010827dfc3a76fc8052b25ab8c184901d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-24T17:18:35Z","title_canon_sha256":"622a139135c633dd9c315b9fec77987069f25b7d68d8a28376ce8212a628bd99"},"schema_version":"1.0","source":{"id":"2307.12946","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.12946","created_at":"2026-07-05T06:34:00Z"},{"alias_kind":"arxiv_version","alias_value":"2307.12946v1","created_at":"2026-07-05T06:34:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12946","created_at":"2026-07-05T06:34:00Z"},{"alias_kind":"pith_short_12","alias_value":"HOAJPPZLVDZV","created_at":"2026-07-05T06:34:00Z"},{"alias_kind":"pith_short_16","alias_value":"HOAJPPZLVDZVCCIW","created_at":"2026-07-05T06:34:00Z"},{"alias_kind":"pith_short_8","alias_value":"HOAJPPZL","created_at":"2026-07-05T06:34:00Z"}],"graph_snapshots":[{"event_id":"sha256:691e24e089b4f5580c55c8aba17eaf13f0c9ae21069b7d163490e8b3dab14a04","target":"graph","created_at":"2026-07-05T06:34:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2307.12946/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aleksandr Beznosikov, Alexander Gasnikov, Dmitry Kovalev, Ekaterina Borodich, Georgiy Kormakov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-24T17:18:35Z","title":"Optimal Algorithm with Complexity Separation for Strongly Convex-Strongly Concave Composite Saddle Point Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.12946","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2b68166f9e8caaf3dcc4eeddd840a6b6d9432bf7ad6690434c539a7cf33e60b9","target":"record","created_at":"2026-07-05T06:34:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"39380716e46100e820bc07832606b6010827dfc3a76fc8052b25ab8c184901d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-24T17:18:35Z","title_canon_sha256":"622a139135c633dd9c315b9fec77987069f25b7d68d8a28376ce8212a628bd99"},"schema_version":"1.0","source":{"id":"2307.12946","kind":"arxiv","version":1}},"canonical_sha256":"3b8097bf2ba8f35109163de661bdfcc61234ddf78c63a9a860ff41f0d02236ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b8097bf2ba8f35109163de661bdfcc61234ddf78c63a9a860ff41f0d02236ca","first_computed_at":"2026-07-05T06:34:00.416779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:34:00.416779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qugG7XuPatpEBX7iCyWCktARi0c+yXkvR1c/uNI9SmgMkHRqNHMVZUC1PpHwSi4yM9wR6vcT/BHdd8Iaz41zAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:34:00.417253Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.12946","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b68166f9e8caaf3dcc4eeddd840a6b6d9432bf7ad6690434c539a7cf33e60b9","sha256:691e24e089b4f5580c55c8aba17eaf13f0c9ae21069b7d163490e8b3dab14a04"],"state_sha256":"c54764d42fd9d9e01899a3ba4fdd654f8d986a1f0ad909d95cc7768532cb7bc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zWt3bHGEPs8138cwTHxyEN26QYYDLvN5LToJJd859kTEdFT7iBUImmGI/O539b+Q2RSHr26rnJA9sj678IkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T09:11:30.871934Z","bundle_sha256":"a90e2a7c40c5d8e5c0cf84edb98fa32f206acf999440be748dbb5ab9eaf146d7"}}