{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SVKCV2AUWG3MAG52XAXYMABRJQ","short_pith_number":"pith:SVKCV2AU","schema_version":"1.0","canonical_sha256":"95542ae814b1b6c01bbab82f8600314c3d0ad2eca53f753bfb7410c256a31edd","source":{"kind":"arxiv","id":"2101.09740","version":2},"attestation_state":"computed","paper":{"title":"On the oracle complexity of smooth strongly convex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien Taylor, Yoel Drori","submitted_at":"2021-01-24T16:20:53Z","abstract_excerpt":"We construct a family of functions suitable for establishing lower bounds on the oracle complexity of first-order minimization of smooth strongly-convex functions. Based on this construction, we derive new lower bounds on the complexity of strongly-convex minimization under various inaccuracy criteria. The new bounds match the known upper bounds up to a constant factor, and when the inaccuracy of a solution is measured by its distance to the solution set, the new lower bound exactly matches the upper bound obtained by the recent Information-Theoretic Exact Method by the same authors, thereby e"},"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.09740","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-01-24T16:20:53Z","cross_cats_sorted":[],"title_canon_sha256":"16c13f045823c04fd2dffea3cab0f051a31da9191c15c9891f214d21ff75eb9d","abstract_canon_sha256":"8689a39c970e0c5a4b727e24d5624d8e97cce3e8b1099c4a922da89f41d44aa7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:49:24.126775Z","signature_b64":"XOF98RF2FypM4tF4IsxjE59ykXuWjce8XmMSDUGkZftyflUEgd06biqpGUABVOFW9/clR7AlSh+UzEzpLfSnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95542ae814b1b6c01bbab82f8600314c3d0ad2eca53f753bfb7410c256a31edd","last_reissued_at":"2026-07-05T02:49:24.126294Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:49:24.126294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the oracle complexity of smooth strongly convex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien Taylor, Yoel Drori","submitted_at":"2021-01-24T16:20:53Z","abstract_excerpt":"We construct a family of functions suitable for establishing lower bounds on the oracle complexity of first-order minimization of smooth strongly-convex functions. Based on this construction, we derive new lower bounds on the complexity of strongly-convex minimization under various inaccuracy criteria. The new bounds match the known upper bounds up to a constant factor, and when the inaccuracy of a solution is measured by its distance to the solution set, the new lower bound exactly matches the upper bound obtained by the recent Information-Theoretic Exact Method by the same authors, thereby e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09740","kind":"arxiv","version":2},"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.09740/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.09740","created_at":"2026-07-05T02:49:24.126359+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.09740v2","created_at":"2026-07-05T02:49:24.126359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09740","created_at":"2026-07-05T02:49:24.126359+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVKCV2AUWG3M","created_at":"2026-07-05T02:49:24.126359+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVKCV2AUWG3MAG52","created_at":"2026-07-05T02:49:24.126359+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVKCV2AU","created_at":"2026-07-05T02:49:24.126359+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/SVKCV2AUWG3MAG52XAXYMABRJQ","json":"https://pith.science/pith/SVKCV2AUWG3MAG52XAXYMABRJQ.json","graph_json":"https://pith.science/api/pith-number/SVKCV2AUWG3MAG52XAXYMABRJQ/graph.json","events_json":"https://pith.science/api/pith-number/SVKCV2AUWG3MAG52XAXYMABRJQ/events.json","paper":"https://pith.science/paper/SVKCV2AU"},"agent_actions":{"view_html":"https://pith.science/pith/SVKCV2AUWG3MAG52XAXYMABRJQ","download_json":"https://pith.science/pith/SVKCV2AUWG3MAG52XAXYMABRJQ.json","view_paper":"https://pith.science/paper/SVKCV2AU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.09740&json=true","fetch_graph":"https://pith.science/api/pith-number/SVKCV2AUWG3MAG52XAXYMABRJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SVKCV2AUWG3MAG52XAXYMABRJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVKCV2AUWG3MAG52XAXYMABRJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVKCV2AUWG3MAG52XAXYMABRJQ/action/storage_attestation","attest_author":"https://pith.science/pith/SVKCV2AUWG3MAG52XAXYMABRJQ/action/author_attestation","sign_citation":"https://pith.science/pith/SVKCV2AUWG3MAG52XAXYMABRJQ/action/citation_signature","submit_replication":"https://pith.science/pith/SVKCV2AUWG3MAG52XAXYMABRJQ/action/replication_record"}},"created_at":"2026-07-05T02:49:24.126359+00:00","updated_at":"2026-07-05T02:49:24.126359+00:00"}