{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QRKCVO6DR5UXZZTH523JGZC2WE","short_pith_number":"pith:QRKCVO6D","schema_version":"1.0","canonical_sha256":"84542abbc38f697ce667eeb693645ab121a3769dd969d8441f0d54cfe0eb2f67","source":{"kind":"arxiv","id":"1407.5144","version":3},"attestation_state":"computed","paper":{"title":"Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Crist\\'obal Guzm\\'an, G\\'abor Braun, Sebastian Pokutta","submitted_at":"2014-07-19T05:03:54Z","abstract_excerpt":"We present an information-theoretic approach to lower bound the oracle complexity of nonsmooth black box convex optimization, unifying previous lower bounding techniques by identifying a combinatorial problem, namely string guessing, as a single source of hardness. As a measure of complexity we use distributional oracle complexity, which subsumes randomized oracle complexity as well as worst-case oracle complexity. We obtain strong lower bounds on distributional oracle complexity for the box $[-1,1]^n$, as well as for the $L^p$-ball for $p \\geq 1$ (for both low-scale and large-scale regimes), "},"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":"1407.5144","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-19T05:03:54Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"963303319007016a96020ecc9d1ad5c597757412dad170bfcd7c1c9170e9ffd4","abstract_canon_sha256":"971241d94a6a4b1f4b0f801c27d449ed504dca8058c09596e850a6983551825e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:28.928660Z","signature_b64":"auASolc6YuE+GciItELaJ2TcrnTzOA79jOb0zX+bZUEUd1QlwDyQVmgJC8G/ibEcQsAxD+Rf8l70gXIYcD+sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84542abbc38f697ce667eeb693645ab121a3769dd969d8441f0d54cfe0eb2f67","last_reissued_at":"2026-07-05T06:28:28.928174Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:28.928174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Crist\\'obal Guzm\\'an, G\\'abor Braun, Sebastian Pokutta","submitted_at":"2014-07-19T05:03:54Z","abstract_excerpt":"We present an information-theoretic approach to lower bound the oracle complexity of nonsmooth black box convex optimization, unifying previous lower bounding techniques by identifying a combinatorial problem, namely string guessing, as a single source of hardness. As a measure of complexity we use distributional oracle complexity, which subsumes randomized oracle complexity as well as worst-case oracle complexity. We obtain strong lower bounds on distributional oracle complexity for the box $[-1,1]^n$, as well as for the $L^p$-ball for $p \\geq 1$ (for both low-scale and large-scale regimes), "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5144","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/1407.5144/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":"1407.5144","created_at":"2026-07-05T06:28:28.928232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5144v3","created_at":"2026-07-05T06:28:28.928232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5144","created_at":"2026-07-05T06:28:28.928232+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRKCVO6DR5UX","created_at":"2026-07-05T06:28:28.928232+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRKCVO6DR5UXZZTH","created_at":"2026-07-05T06:28:28.928232+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRKCVO6D","created_at":"2026-07-05T06:28:28.928232+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/QRKCVO6DR5UXZZTH523JGZC2WE","json":"https://pith.science/pith/QRKCVO6DR5UXZZTH523JGZC2WE.json","graph_json":"https://pith.science/api/pith-number/QRKCVO6DR5UXZZTH523JGZC2WE/graph.json","events_json":"https://pith.science/api/pith-number/QRKCVO6DR5UXZZTH523JGZC2WE/events.json","paper":"https://pith.science/paper/QRKCVO6D"},"agent_actions":{"view_html":"https://pith.science/pith/QRKCVO6DR5UXZZTH523JGZC2WE","download_json":"https://pith.science/pith/QRKCVO6DR5UXZZTH523JGZC2WE.json","view_paper":"https://pith.science/paper/QRKCVO6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5144&json=true","fetch_graph":"https://pith.science/api/pith-number/QRKCVO6DR5UXZZTH523JGZC2WE/graph.json","fetch_events":"https://pith.science/api/pith-number/QRKCVO6DR5UXZZTH523JGZC2WE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRKCVO6DR5UXZZTH523JGZC2WE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRKCVO6DR5UXZZTH523JGZC2WE/action/storage_attestation","attest_author":"https://pith.science/pith/QRKCVO6DR5UXZZTH523JGZC2WE/action/author_attestation","sign_citation":"https://pith.science/pith/QRKCVO6DR5UXZZTH523JGZC2WE/action/citation_signature","submit_replication":"https://pith.science/pith/QRKCVO6DR5UXZZTH523JGZC2WE/action/replication_record"}},"created_at":"2026-07-05T06:28:28.928232+00:00","updated_at":"2026-07-05T06:28:28.928232+00:00"}