{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XCA5YAIRCCAD7OR4TKQM7K2TE7","short_pith_number":"pith:XCA5YAIR","schema_version":"1.0","canonical_sha256":"b881dc011110803fba3c9aa0cfab5327cbb4df720266f0e1140be88b428abb66","source":{"kind":"arxiv","id":"2101.09741","version":3},"attestation_state":"computed","paper":{"title":"An optimal gradient method for smooth strongly convex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Adrien Taylor, Yoel Drori","submitted_at":"2021-01-24T16:20:56Z","abstract_excerpt":"We present an optimal gradient method for smooth strongly convex optimization. The method is optimal in the sense that its worst-case bound on the distance to an optimal point exactly matches the lower bound on the oracle complexity for the class of problems, meaning that no black-box first-order method can have a better worst-case guarantee without further assumptions on the class of problems at hand. In addition, we provide a constructive recipe for obtaining the algorithmic parameters of the method and illustrate that it can be used for deriving methods for other optimality criteria as well"},"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":"2101.09741","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-01-24T16:20:56Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"9c6c6d0e8d4885f0d67f0d2a0293938809b483ba7f0fd64b656aecbbed2b891b","abstract_canon_sha256":"05e35c023bc01c2e6bf7ac48b7f4e6de7e1a1f03774216139f222ed5f820fd26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:20.450700Z","signature_b64":"M8cQRAmtUfieUUI0UgnIS4VipYnYbc4gPW8yHZm7oW8O7hr9BSbAnQcizTd9sMNcuAHYOHl4sEBwQ3rekctWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b881dc011110803fba3c9aa0cfab5327cbb4df720266f0e1140be88b428abb66","last_reissued_at":"2026-07-05T04:31:20.450273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:20.450273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An optimal gradient method for smooth strongly convex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Adrien Taylor, Yoel Drori","submitted_at":"2021-01-24T16:20:56Z","abstract_excerpt":"We present an optimal gradient method for smooth strongly convex optimization. The method is optimal in the sense that its worst-case bound on the distance to an optimal point exactly matches the lower bound on the oracle complexity for the class of problems, meaning that no black-box first-order method can have a better worst-case guarantee without further assumptions on the class of problems at hand. In addition, we provide a constructive recipe for obtaining the algorithmic parameters of the method and illustrate that it can be used for deriving methods for other optimality criteria as well"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09741","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/2101.09741/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":"2101.09741","created_at":"2026-07-05T04:31:20.450336+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.09741v3","created_at":"2026-07-05T04:31:20.450336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09741","created_at":"2026-07-05T04:31:20.450336+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCA5YAIRCCAD","created_at":"2026-07-05T04:31:20.450336+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCA5YAIRCCAD7OR4","created_at":"2026-07-05T04:31:20.450336+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCA5YAIR","created_at":"2026-07-05T04:31:20.450336+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/XCA5YAIRCCAD7OR4TKQM7K2TE7","json":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7.json","graph_json":"https://pith.science/api/pith-number/XCA5YAIRCCAD7OR4TKQM7K2TE7/graph.json","events_json":"https://pith.science/api/pith-number/XCA5YAIRCCAD7OR4TKQM7K2TE7/events.json","paper":"https://pith.science/paper/XCA5YAIR"},"agent_actions":{"view_html":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7","download_json":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7.json","view_paper":"https://pith.science/paper/XCA5YAIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.09741&json=true","fetch_graph":"https://pith.science/api/pith-number/XCA5YAIRCCAD7OR4TKQM7K2TE7/graph.json","fetch_events":"https://pith.science/api/pith-number/XCA5YAIRCCAD7OR4TKQM7K2TE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7/action/storage_attestation","attest_author":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7/action/author_attestation","sign_citation":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7/action/citation_signature","submit_replication":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7/action/replication_record"}},"created_at":"2026-07-05T04:31:20.450336+00:00","updated_at":"2026-07-05T04:31:20.450336+00:00"}