{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3MQALFMBULWNL2V2F46EBEJI6S","short_pith_number":"pith:3MQALFMB","schema_version":"1.0","canonical_sha256":"db20059581a2ecd5eaba2f3c409128f4a0c42ac587a401280d040d7ccee2388f","source":{"kind":"arxiv","id":"2509.08258","version":1},"attestation_state":"computed","paper":{"title":"Nesterov acceleration for strongly convex-strongly concave bilinear saddle point problems: discrete and continuous-time approaches","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xin He, Ya-Ping Fang","submitted_at":"2025-09-10T03:32:14Z","abstract_excerpt":"In this paper, we study a bilinear saddle point problem of the form $\\min_{x}\\max_{y} F(x) + \\langle Ax, y \\rangle - G(y)$, where $F$ and $G$ are $\\mu_F$- and $\\mu_G$-strongly convex functions, respectively. By incorporating Nesterov acceleration for strongly convex optimization, we first propose an optimal first-order discrete primal-dual gradient algorithm. We show that it achieves the optimal convergence rate $\\mathcal{O}\\left(\\left(1 - \\min\\left\\{\\sqrt{\\frac{\\mu_F}{L_F}}, \\sqrt{\\frac{\\mu_G}{L_G}}\\right\\}\\right)^k\\right)$ for both the primal-dual gap and the iterative, where $L_F$ and $L_G$"},"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":"2509.08258","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-10T03:32:14Z","cross_cats_sorted":[],"title_canon_sha256":"51e3267b0e4e0711d317279346b93f9ed93d6486e78c5ea59a0b073c77716eef","abstract_canon_sha256":"1de1d0480b6cf533dff6185bd0fd61e8b7a3032cd4f3881d713aa26f20fb9140"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:26.267748Z","signature_b64":"MSp6pst9OqkzLFgHyJgrt69brcc8A6v3c8yuKHSfcKc2+JCmHEKxrRzpNarve7IQo2ys+XtvZDEVR3nm1+kUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db20059581a2ecd5eaba2f3c409128f4a0c42ac587a401280d040d7ccee2388f","last_reissued_at":"2026-07-05T12:08:26.267165Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:26.267165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nesterov acceleration for strongly convex-strongly concave bilinear saddle point problems: discrete and continuous-time approaches","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xin He, Ya-Ping Fang","submitted_at":"2025-09-10T03:32:14Z","abstract_excerpt":"In this paper, we study a bilinear saddle point problem of the form $\\min_{x}\\max_{y} F(x) + \\langle Ax, y \\rangle - G(y)$, where $F$ and $G$ are $\\mu_F$- and $\\mu_G$-strongly convex functions, respectively. By incorporating Nesterov acceleration for strongly convex optimization, we first propose an optimal first-order discrete primal-dual gradient algorithm. We show that it achieves the optimal convergence rate $\\mathcal{O}\\left(\\left(1 - \\min\\left\\{\\sqrt{\\frac{\\mu_F}{L_F}}, \\sqrt{\\frac{\\mu_G}{L_G}}\\right\\}\\right)^k\\right)$ for both the primal-dual gap and the iterative, where $L_F$ and $L_G$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08258","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/2509.08258/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":"2509.08258","created_at":"2026-07-05T12:08:26.267240+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08258v1","created_at":"2026-07-05T12:08:26.267240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08258","created_at":"2026-07-05T12:08:26.267240+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MQALFMBULWN","created_at":"2026-07-05T12:08:26.267240+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MQALFMBULWNL2V2","created_at":"2026-07-05T12:08:26.267240+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MQALFMB","created_at":"2026-07-05T12:08:26.267240+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18724","citing_title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3MQALFMBULWNL2V2F46EBEJI6S","json":"https://pith.science/pith/3MQALFMBULWNL2V2F46EBEJI6S.json","graph_json":"https://pith.science/api/pith-number/3MQALFMBULWNL2V2F46EBEJI6S/graph.json","events_json":"https://pith.science/api/pith-number/3MQALFMBULWNL2V2F46EBEJI6S/events.json","paper":"https://pith.science/paper/3MQALFMB"},"agent_actions":{"view_html":"https://pith.science/pith/3MQALFMBULWNL2V2F46EBEJI6S","download_json":"https://pith.science/pith/3MQALFMBULWNL2V2F46EBEJI6S.json","view_paper":"https://pith.science/paper/3MQALFMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08258&json=true","fetch_graph":"https://pith.science/api/pith-number/3MQALFMBULWNL2V2F46EBEJI6S/graph.json","fetch_events":"https://pith.science/api/pith-number/3MQALFMBULWNL2V2F46EBEJI6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MQALFMBULWNL2V2F46EBEJI6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MQALFMBULWNL2V2F46EBEJI6S/action/storage_attestation","attest_author":"https://pith.science/pith/3MQALFMBULWNL2V2F46EBEJI6S/action/author_attestation","sign_citation":"https://pith.science/pith/3MQALFMBULWNL2V2F46EBEJI6S/action/citation_signature","submit_replication":"https://pith.science/pith/3MQALFMBULWNL2V2F46EBEJI6S/action/replication_record"}},"created_at":"2026-07-05T12:08:26.267240+00:00","updated_at":"2026-07-05T12:08:26.267240+00:00"}