{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WVOW3TH33723JLFCAZD3ZVSTXY","short_pith_number":"pith:WVOW3TH3","schema_version":"1.0","canonical_sha256":"b55d6dccfbdff5b4aca20647bcd653be0ce0d36530167d9167f304bd8d69c233","source":{"kind":"arxiv","id":"1307.5001","version":4},"attestation_state":"computed","paper":{"title":"On Lower Complexity Bounds for Large-Scale Smooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Arkadi Nemirovski, Cristobal Guzman","submitted_at":"2013-07-18T16:29:21Z","abstract_excerpt":"We derive lower bounds on the black-box oracle complexity of large-scale smooth convex minimization problems, with emphasis on minimizing smooth (with Holder continuous, with a given exponent and constant, gradient) convex functions over high-dimensional ||.||_p-balls, 1<=p<=\\infty. Our bounds turn out to be tight (up to logarithmic in the design dimension factors), and can be viewed as a substantial extension of the existing lower complexity bounds for large-scale convex minimization covering the nonsmooth case and the 'Euclidean' smooth case (minimization of convex functions with Lipschitz c"},"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":"1307.5001","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-18T16:29:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"67f21c93b62c3242a6733bada9b4478bb7b36f89f0e5651e7ab2c9139b600b57","abstract_canon_sha256":"67dd52a11fe2bbfea0f2e87192a526537efd33cea64321f3e02154f9ce7ca7d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:44.089531Z","signature_b64":"2S7ibsVZiVSAPfc8iepIo37JrhRb8eTeZjlXULEcc7PkQQIAIwJgY4j9Ot9B0dSV7sLuTTjspGdw/zUoBKfbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b55d6dccfbdff5b4aca20647bcd653be0ce0d36530167d9167f304bd8d69c233","last_reissued_at":"2026-05-17T23:59:44.089100Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:44.089100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Lower Complexity Bounds for Large-Scale Smooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Arkadi Nemirovski, Cristobal Guzman","submitted_at":"2013-07-18T16:29:21Z","abstract_excerpt":"We derive lower bounds on the black-box oracle complexity of large-scale smooth convex minimization problems, with emphasis on minimizing smooth (with Holder continuous, with a given exponent and constant, gradient) convex functions over high-dimensional ||.||_p-balls, 1<=p<=\\infty. Our bounds turn out to be tight (up to logarithmic in the design dimension factors), and can be viewed as a substantial extension of the existing lower complexity bounds for large-scale convex minimization covering the nonsmooth case and the 'Euclidean' smooth case (minimization of convex functions with Lipschitz c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5001","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1307.5001","created_at":"2026-05-17T23:59:44.089165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5001v4","created_at":"2026-05-17T23:59:44.089165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5001","created_at":"2026-05-17T23:59:44.089165+00:00"},{"alias_kind":"pith_short_12","alias_value":"WVOW3TH33723","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WVOW3TH33723JLFC","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WVOW3TH3","created_at":"2026-05-18T12:28:04.890932+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/WVOW3TH33723JLFCAZD3ZVSTXY","json":"https://pith.science/pith/WVOW3TH33723JLFCAZD3ZVSTXY.json","graph_json":"https://pith.science/api/pith-number/WVOW3TH33723JLFCAZD3ZVSTXY/graph.json","events_json":"https://pith.science/api/pith-number/WVOW3TH33723JLFCAZD3ZVSTXY/events.json","paper":"https://pith.science/paper/WVOW3TH3"},"agent_actions":{"view_html":"https://pith.science/pith/WVOW3TH33723JLFCAZD3ZVSTXY","download_json":"https://pith.science/pith/WVOW3TH33723JLFCAZD3ZVSTXY.json","view_paper":"https://pith.science/paper/WVOW3TH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5001&json=true","fetch_graph":"https://pith.science/api/pith-number/WVOW3TH33723JLFCAZD3ZVSTXY/graph.json","fetch_events":"https://pith.science/api/pith-number/WVOW3TH33723JLFCAZD3ZVSTXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WVOW3TH33723JLFCAZD3ZVSTXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WVOW3TH33723JLFCAZD3ZVSTXY/action/storage_attestation","attest_author":"https://pith.science/pith/WVOW3TH33723JLFCAZD3ZVSTXY/action/author_attestation","sign_citation":"https://pith.science/pith/WVOW3TH33723JLFCAZD3ZVSTXY/action/citation_signature","submit_replication":"https://pith.science/pith/WVOW3TH33723JLFCAZD3ZVSTXY/action/replication_record"}},"created_at":"2026-05-17T23:59:44.089165+00:00","updated_at":"2026-05-17T23:59:44.089165+00:00"}