{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QRKCVO6DR5UXZZTH523JGZC2WE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"971241d94a6a4b1f4b0f801c27d449ed504dca8058c09596e850a6983551825e","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-19T05:03:54Z","title_canon_sha256":"963303319007016a96020ecc9d1ad5c597757412dad170bfcd7c1c9170e9ffd4"},"schema_version":"1.0","source":{"id":"1407.5144","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5144","created_at":"2026-07-05T06:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5144v3","created_at":"2026-07-05T06:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5144","created_at":"2026-07-05T06:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"QRKCVO6DR5UX","created_at":"2026-07-05T06:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"QRKCVO6DR5UXZZTH","created_at":"2026-07-05T06:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"QRKCVO6D","created_at":"2026-07-05T06:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:1a30fa43024e27a817bd12f23ff2f53fd388e43ad965d94996d4e044b4e3278a","target":"graph","created_at":"2026-07-05T06:28:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1407.5144/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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), ","authors_text":"Crist\\'obal Guzm\\'an, G\\'abor Braun, Sebastian Pokutta","cross_cats":["cs.CC","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-19T05:03:54Z","title":"Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5144","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0270a6bc92100779436d9e4dce844c6c0ab1984a84e7f12cceb8226ebe53d8d2","target":"record","created_at":"2026-07-05T06:28:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"971241d94a6a4b1f4b0f801c27d449ed504dca8058c09596e850a6983551825e","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-19T05:03:54Z","title_canon_sha256":"963303319007016a96020ecc9d1ad5c597757412dad170bfcd7c1c9170e9ffd4"},"schema_version":"1.0","source":{"id":"1407.5144","kind":"arxiv","version":3}},"canonical_sha256":"84542abbc38f697ce667eeb693645ab121a3769dd969d8441f0d54cfe0eb2f67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84542abbc38f697ce667eeb693645ab121a3769dd969d8441f0d54cfe0eb2f67","first_computed_at":"2026-07-05T06:28:28.928174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:28:28.928174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"auASolc6YuE+GciItELaJ2TcrnTzOA79jOb0zX+bZUEUd1QlwDyQVmgJC8G/ibEcQsAxD+Rf8l70gXIYcD+sDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:28:28.928660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5144","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0270a6bc92100779436d9e4dce844c6c0ab1984a84e7f12cceb8226ebe53d8d2","sha256:1a30fa43024e27a817bd12f23ff2f53fd388e43ad965d94996d4e044b4e3278a"],"state_sha256":"22eac6e1fde79807c9aeaa15caa6d4834f5ff8440fd9a4181b4f0c62aba2d634"}