{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:YZWUHZI6MICS55RJPR7BAIFFTA","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":"7b555d0ecf53143a5c58b1948dba8fea2790e65804e4bbc5f0196589f67f8f08","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-21T22:06:25Z","title_canon_sha256":"9530004620a03ee458256e6f71112e00557ece733b85387e6996e857141f479e"},"schema_version":"1.0","source":{"id":"2411.14601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14601","created_at":"2026-07-05T09:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14601v1","created_at":"2026-07-05T09:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14601","created_at":"2026-07-05T09:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"YZWUHZI6MICS","created_at":"2026-07-05T09:38:53Z"},{"alias_kind":"pith_short_16","alias_value":"YZWUHZI6MICS55RJ","created_at":"2026-07-05T09:38:53Z"},{"alias_kind":"pith_short_8","alias_value":"YZWUHZI6","created_at":"2026-07-05T09:38:53Z"}],"graph_snapshots":[{"event_id":"sha256:1dce4a3426a91e4eb0569b057ef8b898f377a5fb707ea514842163ae43009a33","target":"graph","created_at":"2026-07-05T09:38:53Z","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/2411.14601/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We revisit the smooth convex-concave bilinearly-coupled saddle-point problem of the form $\\min_x\\max_y f(x) + \\langle y,\\mathbf{B} x\\rangle - g(y)$. In the highly specific case where each of the functions $f(x)$ and $g(y)$ is either affine or strongly convex, there exist lower bounds on the number of gradient evaluations and matrix-vector multiplications required to solve the problem, as well as matching optimal algorithms. A notable aspect of these algorithms is that they are able to attain linear convergence, i.e., the number of iterations required to solve the problem is proportional to $\\l","authors_text":"Dmitry Kovalev, Ekaterina Borodich","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14601","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:8dc85ab616dd469ef241996e37246e9351116757d8bd61e1d71638828a60c935","target":"record","created_at":"2026-07-05T09:38:53Z","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":"7b555d0ecf53143a5c58b1948dba8fea2790e65804e4bbc5f0196589f67f8f08","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-21T22:06:25Z","title_canon_sha256":"9530004620a03ee458256e6f71112e00557ece733b85387e6996e857141f479e"},"schema_version":"1.0","source":{"id":"2411.14601","kind":"arxiv","version":1}},"canonical_sha256":"c66d43e51e62052ef6297c7e1020a5980b7fb4c49a5af50ad89215a5d3943cc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c66d43e51e62052ef6297c7e1020a5980b7fb4c49a5af50ad89215a5d3943cc5","first_computed_at":"2026-07-05T09:38:53.660486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:53.660486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"41hPl68d0u6vtwXTjwb/3F2S8fiGtX2c2wQZQUSwgjPRe+YvhEmzgZd5gESEEu+bwYjgWJJuSrTE+k25SuicAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:53.660935Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.14601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dc85ab616dd469ef241996e37246e9351116757d8bd61e1d71638828a60c935","sha256:1dce4a3426a91e4eb0569b057ef8b898f377a5fb707ea514842163ae43009a33"],"state_sha256":"0f8120c6edcfb873fc0a89913771fed04b099d6d08ca738d2bad90594c07150f"}