{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MOX2IFGITGFLZKWG7JYBYIE2YL","short_pith_number":"pith:MOX2IFGI","canonical_record":{"source":{"id":"1009.0571","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-03T02:49:20Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"fe5b2e54653dfd667aa6271ef9eb94c2e7158d3457b55cb9d5db9bb4019c504c","abstract_canon_sha256":"ddd57c5e0844900cbaca6258eb8a0ce09cf552054012b1b501c4c67f1ae250f7"},"schema_version":"1.0"},"canonical_sha256":"63afa414c8998abcaac6fa701c209ac2fd4e09f2d39de5f3fdf55bb3e2a2b1d0","source":{"kind":"arxiv","id":"1009.0571","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0571","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0571v3","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0571","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"pith_short_12","alias_value":"MOX2IFGITGFL","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MOX2IFGITGFLZKWG","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MOX2IFGI","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MOX2IFGITGFLZKWG7JYBYIE2YL","target":"record","payload":{"canonical_record":{"source":{"id":"1009.0571","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-03T02:49:20Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"fe5b2e54653dfd667aa6271ef9eb94c2e7158d3457b55cb9d5db9bb4019c504c","abstract_canon_sha256":"ddd57c5e0844900cbaca6258eb8a0ce09cf552054012b1b501c4c67f1ae250f7"},"schema_version":"1.0"},"canonical_sha256":"63afa414c8998abcaac6fa701c209ac2fd4e09f2d39de5f3fdf55bb3e2a2b1d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:03.912440Z","signature_b64":"4vnAdr9ouCkZDUpGrm0U4iyKQlsURJx+ehkRKLy863+J843BsavZjuDSDzdd+38L7jg4Fq8BD3xFM+c+lCAFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63afa414c8998abcaac6fa701c209ac2fd4e09f2d39de5f3fdf55bb3e2a2b1d0","last_reissued_at":"2026-05-18T04:08:03.911891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:03.911891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.0571","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:08:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYElSYh/a1Kr2U2snbFbnkuRYRaAmAzTZE0agl59/raU5A+AhAqekUmzGiPIhcVgA5DlRwOs/M64lD92UFF7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:10:40.107913Z"},"content_sha256":"eda2587f1763490f5717ba79d9f64198a875e2d5f6c93b1dbb024ed4838cdb33","schema_version":"1.0","event_id":"sha256:eda2587f1763490f5717ba79d9f64198a875e2d5f6c93b1dbb024ed4838cdb33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MOX2IFGITGFLZKWG7JYBYIE2YL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"stat.ML","authors_text":"Alekh Agarwal, Martin J. Wainwright, Peter L. Bartlett, Pradeep Ravikumar","submitted_at":"2010-09-03T02:49:20Z","abstract_excerpt":"Relative to the large literature on upper bounds on complexity of convex optimization, lesser attention has been paid to the fundamental hardness of these problems. Given the extensive use of convex optimization in machine learning and statistics, gaining an understanding of these complexity-theoretic issues is important. In this paper, we study the complexity of stochastic convex optimization in an oracle model of computation. We improve upon known results and obtain tight minimax complexity estimates for various function classes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0571","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:08:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"daXdKYW7hqWT2PtScqDPiWeXUiti2p61z/PmaCfD1veJz+PIQp3YlXE58uhRfUfg8Tc3rCUZP87C7qw/3abUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:10:40.108697Z"},"content_sha256":"d8dcdac1db72f59a7be0f611f402fc1f82845e1e901daae7725e380f8b86ec65","schema_version":"1.0","event_id":"sha256:d8dcdac1db72f59a7be0f611f402fc1f82845e1e901daae7725e380f8b86ec65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOX2IFGITGFLZKWG7JYBYIE2YL/bundle.json","state_url":"https://pith.science/pith/MOX2IFGITGFLZKWG7JYBYIE2YL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOX2IFGITGFLZKWG7JYBYIE2YL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T12:10:40Z","links":{"resolver":"https://pith.science/pith/MOX2IFGITGFLZKWG7JYBYIE2YL","bundle":"https://pith.science/pith/MOX2IFGITGFLZKWG7JYBYIE2YL/bundle.json","state":"https://pith.science/pith/MOX2IFGITGFLZKWG7JYBYIE2YL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOX2IFGITGFLZKWG7JYBYIE2YL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MOX2IFGITGFLZKWG7JYBYIE2YL","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":"ddd57c5e0844900cbaca6258eb8a0ce09cf552054012b1b501c4c67f1ae250f7","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-03T02:49:20Z","title_canon_sha256":"fe5b2e54653dfd667aa6271ef9eb94c2e7158d3457b55cb9d5db9bb4019c504c"},"schema_version":"1.0","source":{"id":"1009.0571","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0571","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0571v3","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0571","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"pith_short_12","alias_value":"MOX2IFGITGFL","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MOX2IFGITGFLZKWG","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MOX2IFGI","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:d8dcdac1db72f59a7be0f611f402fc1f82845e1e901daae7725e380f8b86ec65","target":"graph","created_at":"2026-05-18T04:08:03Z","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"},"paper":{"abstract_excerpt":"Relative to the large literature on upper bounds on complexity of convex optimization, lesser attention has been paid to the fundamental hardness of these problems. Given the extensive use of convex optimization in machine learning and statistics, gaining an understanding of these complexity-theoretic issues is important. In this paper, we study the complexity of stochastic convex optimization in an oracle model of computation. We improve upon known results and obtain tight minimax complexity estimates for various function classes.","authors_text":"Alekh Agarwal, Martin J. Wainwright, Peter L. Bartlett, Pradeep Ravikumar","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-03T02:49:20Z","title":"Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0571","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:eda2587f1763490f5717ba79d9f64198a875e2d5f6c93b1dbb024ed4838cdb33","target":"record","created_at":"2026-05-18T04:08:03Z","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":"ddd57c5e0844900cbaca6258eb8a0ce09cf552054012b1b501c4c67f1ae250f7","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-03T02:49:20Z","title_canon_sha256":"fe5b2e54653dfd667aa6271ef9eb94c2e7158d3457b55cb9d5db9bb4019c504c"},"schema_version":"1.0","source":{"id":"1009.0571","kind":"arxiv","version":3}},"canonical_sha256":"63afa414c8998abcaac6fa701c209ac2fd4e09f2d39de5f3fdf55bb3e2a2b1d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63afa414c8998abcaac6fa701c209ac2fd4e09f2d39de5f3fdf55bb3e2a2b1d0","first_computed_at":"2026-05-18T04:08:03.911891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:03.911891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4vnAdr9ouCkZDUpGrm0U4iyKQlsURJx+ehkRKLy863+J843BsavZjuDSDzdd+38L7jg4Fq8BD3xFM+c+lCAFBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:03.912440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.0571","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eda2587f1763490f5717ba79d9f64198a875e2d5f6c93b1dbb024ed4838cdb33","sha256:d8dcdac1db72f59a7be0f611f402fc1f82845e1e901daae7725e380f8b86ec65"],"state_sha256":"dd998d8935b9901a4ed200fa009038e2371e6dfa7e68fbda4a9e55ba2e48b9c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LUyNVQiAg+1cjMf//LE0KlvGBhrnDi2ztDDWO7OfcjhPupPhqnp96vEL5Tjtk6ewEXsnDFrn+kRwy3idhv3cDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:10:40.112472Z","bundle_sha256":"f57463527d47c4a4639ee7aa82b96bb2d41d64b21b5b6e1fb02940bac41c824e"}}