{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MDGANIX4MPFH6CBW6N6QGVEVEF","short_pith_number":"pith:MDGANIX4","schema_version":"1.0","canonical_sha256":"60cc06a2fc63ca7f0836f37d035495216927dad8ab48599be367f01dfd7d44fd","source":{"kind":"arxiv","id":"2102.11079","version":3},"attestation_state":"computed","paper":{"title":"An Optimal Algorithm for Strongly Convex Minimization under Affine Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adil Salim, Dmitry Kovalev, Laurent Condat, Peter Richt\\'arik","submitted_at":"2021-02-22T14:51:04Z","abstract_excerpt":"Optimization problems under affine constraints appear in various areas of machine learning. We consider the task of minimizing a smooth strongly convex function F(x) under the affine constraint Kx=b, with an oracle providing evaluations of the gradient of F and multiplications by K and its transpose. We provide lower bounds on the number of gradient computations and matrix multiplications to achieve a given accuracy. Then we propose an accelerated primal-dual algorithm achieving these lower bounds. Our algorithm is the first optimal algorithm for this class of problems."},"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":"2102.11079","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-22T14:51:04Z","cross_cats_sorted":[],"title_canon_sha256":"81cc497c1d5a1927a15a631dee964e66719ec00ee9f74308dfa4ef412807d8af","abstract_canon_sha256":"494ccbdf8aa4dd9bcbab7fce627f171fcf5737dd526403dd9614bcefd3c3e411"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:12:48.497127Z","signature_b64":"1J6R2xNs6/dXuZ+ZmU2kpgAdbHpryV+y3XEp1R+azn8G66B4ENZ13d+lQH6j5pxtMx5wTfvt0Asytic7H7L3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60cc06a2fc63ca7f0836f37d035495216927dad8ab48599be367f01dfd7d44fd","last_reissued_at":"2026-07-05T04:12:48.496715Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:12:48.496715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Algorithm for Strongly Convex Minimization under Affine Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adil Salim, Dmitry Kovalev, Laurent Condat, Peter Richt\\'arik","submitted_at":"2021-02-22T14:51:04Z","abstract_excerpt":"Optimization problems under affine constraints appear in various areas of machine learning. We consider the task of minimizing a smooth strongly convex function F(x) under the affine constraint Kx=b, with an oracle providing evaluations of the gradient of F and multiplications by K and its transpose. We provide lower bounds on the number of gradient computations and matrix multiplications to achieve a given accuracy. Then we propose an accelerated primal-dual algorithm achieving these lower bounds. Our algorithm is the first optimal algorithm for this class of problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.11079","kind":"arxiv","version":3},"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/2102.11079/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":"2102.11079","created_at":"2026-07-05T04:12:48.496771+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.11079v3","created_at":"2026-07-05T04:12:48.496771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.11079","created_at":"2026-07-05T04:12:48.496771+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDGANIX4MPFH","created_at":"2026-07-05T04:12:48.496771+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDGANIX4MPFH6CBW","created_at":"2026-07-05T04:12:48.496771+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDGANIX4","created_at":"2026-07-05T04:12:48.496771+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MDGANIX4MPFH6CBW6N6QGVEVEF","json":"https://pith.science/pith/MDGANIX4MPFH6CBW6N6QGVEVEF.json","graph_json":"https://pith.science/api/pith-number/MDGANIX4MPFH6CBW6N6QGVEVEF/graph.json","events_json":"https://pith.science/api/pith-number/MDGANIX4MPFH6CBW6N6QGVEVEF/events.json","paper":"https://pith.science/paper/MDGANIX4"},"agent_actions":{"view_html":"https://pith.science/pith/MDGANIX4MPFH6CBW6N6QGVEVEF","download_json":"https://pith.science/pith/MDGANIX4MPFH6CBW6N6QGVEVEF.json","view_paper":"https://pith.science/paper/MDGANIX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.11079&json=true","fetch_graph":"https://pith.science/api/pith-number/MDGANIX4MPFH6CBW6N6QGVEVEF/graph.json","fetch_events":"https://pith.science/api/pith-number/MDGANIX4MPFH6CBW6N6QGVEVEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDGANIX4MPFH6CBW6N6QGVEVEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDGANIX4MPFH6CBW6N6QGVEVEF/action/storage_attestation","attest_author":"https://pith.science/pith/MDGANIX4MPFH6CBW6N6QGVEVEF/action/author_attestation","sign_citation":"https://pith.science/pith/MDGANIX4MPFH6CBW6N6QGVEVEF/action/citation_signature","submit_replication":"https://pith.science/pith/MDGANIX4MPFH6CBW6N6QGVEVEF/action/replication_record"}},"created_at":"2026-07-05T04:12:48.496771+00:00","updated_at":"2026-07-05T04:12:48.496771+00:00"}