{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:YZWUHZI6MICS55RJPR7BAIFFTA","short_pith_number":"pith:YZWUHZI6","canonical_record":{"source":{"id":"2411.14601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-21T22:06:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9530004620a03ee458256e6f71112e00557ece733b85387e6996e857141f479e","abstract_canon_sha256":"7b555d0ecf53143a5c58b1948dba8fea2790e65804e4bbc5f0196589f67f8f08"},"schema_version":"1.0"},"canonical_sha256":"c66d43e51e62052ef6297c7e1020a5980b7fb4c49a5af50ad89215a5d3943cc5","source":{"kind":"arxiv","id":"2411.14601","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:YZWUHZI6MICS55RJPR7BAIFFTA","target":"record","payload":{"canonical_record":{"source":{"id":"2411.14601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-21T22:06:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9530004620a03ee458256e6f71112e00557ece733b85387e6996e857141f479e","abstract_canon_sha256":"7b555d0ecf53143a5c58b1948dba8fea2790e65804e4bbc5f0196589f67f8f08"},"schema_version":"1.0"},"canonical_sha256":"c66d43e51e62052ef6297c7e1020a5980b7fb4c49a5af50ad89215a5d3943cc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:53.660935Z","signature_b64":"41hPl68d0u6vtwXTjwb/3F2S8fiGtX2c2wQZQUSwgjPRe+YvhEmzgZd5gESEEu+bwYjgWJJuSrTE+k25SuicAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c66d43e51e62052ef6297c7e1020a5980b7fb4c49a5af50ad89215a5d3943cc5","last_reissued_at":"2026-07-05T09:38:53.660486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:53.660486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.14601","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-05T09:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GxYNWlds/rnRtAqzh+WUbTsg5PI/de4p9EpYB5mwc0hbVGY15mfKMvvrWzFFDU80V1weHoq/Zi2pfOUnVzDtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:07:15.327014Z"},"content_sha256":"8dc85ab616dd469ef241996e37246e9351116757d8bd61e1d71638828a60c935","schema_version":"1.0","event_id":"sha256:8dc85ab616dd469ef241996e37246e9351116757d8bd61e1d71638828a60c935"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:YZWUHZI6MICS55RJPR7BAIFFTA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Dmitry Kovalev, Ekaterina Borodich","submitted_at":"2024-11-21T22:06:25Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14601","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/2411.14601/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-05T09:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhgTreiSh9jqXUM9qUjV2W2TrbHPns/1InHuB/2Exd40vYiJYn8VJRhD86TDgKCTPPdh29IK827YG8QxyVLWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:07:15.327522Z"},"content_sha256":"1dce4a3426a91e4eb0569b057ef8b898f377a5fb707ea514842163ae43009a33","schema_version":"1.0","event_id":"sha256:1dce4a3426a91e4eb0569b057ef8b898f377a5fb707ea514842163ae43009a33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA/bundle.json","state_url":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZWUHZI6MICS55RJPR7BAIFFTA/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-08T13:07:15Z","links":{"resolver":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA","bundle":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA/bundle.json","state":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZWUHZI6MICS55RJPR7BAIFFTA/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZ277ouj2vPwvMzATcAd3hVf2wFuSZaIoHMNZdIGA3i/AJ3ntBiTpCLDZjOuFDvs5YzSlrBYXkcjlD6Iuj03Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:07:15.331701Z","bundle_sha256":"4c33b23f3e3eea1dcc48a9f55f22be89833d314b1484b1151e75f2be0d27dc9c"}}