{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TBBMWHAVVQ7KO426SXEPP7QXDR","short_pith_number":"pith:TBBMWHAV","canonical_record":{"source":{"id":"1207.3012","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-12T16:33:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e832a1cea458254e3f2649c0b4433f2a6509098a084589053f14a8a2b44071e8","abstract_canon_sha256":"84266ae09b735bb097ae512cc96ee65f93983afaf9ae472d8010d7d296a61673"},"schema_version":"1.0"},"canonical_sha256":"9842cb1c15ac3ea7735e95c8f7fe171c7a2a0ba0913866827d0a413e2cc39c64","source":{"kind":"arxiv","id":"1207.3012","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3012","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3012v2","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3012","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"TBBMWHAVVQ7K","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TBBMWHAVVQ7KO426","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TBBMWHAV","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TBBMWHAVVQ7KO426SXEPP7QXDR","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3012","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-12T16:33:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e832a1cea458254e3f2649c0b4433f2a6509098a084589053f14a8a2b44071e8","abstract_canon_sha256":"84266ae09b735bb097ae512cc96ee65f93983afaf9ae472d8010d7d296a61673"},"schema_version":"1.0"},"canonical_sha256":"9842cb1c15ac3ea7735e95c8f7fe171c7a2a0ba0913866827d0a413e2cc39c64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.349403Z","signature_b64":"xcZ6i0oIBtIjB4yORjUZdIFa1siMeBg9WS2z62keZwG0Vg5YFMLm5cFpqWoTUqmQ8sJ/DYMGiy9M4mVdKqRwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9842cb1c15ac3ea7735e95c8f7fe171c7a2a0ba0913866827d0a413e2cc39c64","last_reissued_at":"2026-05-18T02:21:08.348935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.348935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3012","source_version":2,"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-18T02:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"da9Z+gfNzhcPr9T0YXJKNXM7YeP8rj275EC6OndnquPKRFf8zucwww6nd23DQbA6DtDxr7OE9dKyioESpnceAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:45:53.772447Z"},"content_sha256":"0f0fe729f1f410db114d2e759ef8e4e7d784eea2f275296d545f05f003c5b616","schema_version":"1.0","event_id":"sha256:0f0fe729f1f410db114d2e759ef8e4e7d784eea2f275296d545f05f003c5b616"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TBBMWHAVVQ7KO426SXEPP7QXDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal rates for first-order stochastic convex optimization under Tsybakov noise condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaditya Ramdas, Aarti Singh","submitted_at":"2012-07-12T16:33:49Z","abstract_excerpt":"We focus on the problem of minimizing a convex function $f$ over a convex set $S$ given $T$ queries to a stochastic first order oracle. We argue that the complexity of convex minimization is only determined by the rate of growth of the function around its minimizer $x^*_{f,S}$, as quantified by a Tsybakov-like noise condition. Specifically, we prove that if $f$ grows at least as fast as $\\|x-x^*_{f,S}\\|^\\kappa$ around its minimum, for some $\\kappa > 1$, then the optimal rate of learning $f(x^*_{f,S})$ is $\\Theta(T^{-\\frac{\\kappa}{2\\kappa-2}})$. The classic rate $\\Theta(1/\\sqrt T)$ for convex f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3012","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":""},"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-18T02:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOJYwtdzGrwrbCFIMZSpQWjVXR9Belg/I7MHtRBV8EYIstLoKimPXWY7vLKCEOS1tlcSidMyv0KC7r6z0ReEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:45:53.773203Z"},"content_sha256":"1196e4784cab10ebc73e1edc892c598b0b8cb2b1f2eea08d0dabeb0ec3feacd9","schema_version":"1.0","event_id":"sha256:1196e4784cab10ebc73e1edc892c598b0b8cb2b1f2eea08d0dabeb0ec3feacd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBBMWHAVVQ7KO426SXEPP7QXDR/bundle.json","state_url":"https://pith.science/pith/TBBMWHAVVQ7KO426SXEPP7QXDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBBMWHAVVQ7KO426SXEPP7QXDR/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-08-13T20:45:53Z","links":{"resolver":"https://pith.science/pith/TBBMWHAVVQ7KO426SXEPP7QXDR","bundle":"https://pith.science/pith/TBBMWHAVVQ7KO426SXEPP7QXDR/bundle.json","state":"https://pith.science/pith/TBBMWHAVVQ7KO426SXEPP7QXDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBBMWHAVVQ7KO426SXEPP7QXDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TBBMWHAVVQ7KO426SXEPP7QXDR","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":"84266ae09b735bb097ae512cc96ee65f93983afaf9ae472d8010d7d296a61673","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-12T16:33:49Z","title_canon_sha256":"e832a1cea458254e3f2649c0b4433f2a6509098a084589053f14a8a2b44071e8"},"schema_version":"1.0","source":{"id":"1207.3012","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3012","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3012v2","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3012","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"TBBMWHAVVQ7K","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TBBMWHAVVQ7KO426","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TBBMWHAV","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:1196e4784cab10ebc73e1edc892c598b0b8cb2b1f2eea08d0dabeb0ec3feacd9","target":"graph","created_at":"2026-05-18T02:21:08Z","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":"We focus on the problem of minimizing a convex function $f$ over a convex set $S$ given $T$ queries to a stochastic first order oracle. We argue that the complexity of convex minimization is only determined by the rate of growth of the function around its minimizer $x^*_{f,S}$, as quantified by a Tsybakov-like noise condition. Specifically, we prove that if $f$ grows at least as fast as $\\|x-x^*_{f,S}\\|^\\kappa$ around its minimum, for some $\\kappa > 1$, then the optimal rate of learning $f(x^*_{f,S})$ is $\\Theta(T^{-\\frac{\\kappa}{2\\kappa-2}})$. The classic rate $\\Theta(1/\\sqrt T)$ for convex f","authors_text":"Aaditya Ramdas, Aarti Singh","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-12T16:33:49Z","title":"Optimal rates for first-order stochastic convex optimization under Tsybakov noise condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3012","kind":"arxiv","version":2},"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:0f0fe729f1f410db114d2e759ef8e4e7d784eea2f275296d545f05f003c5b616","target":"record","created_at":"2026-05-18T02:21:08Z","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":"84266ae09b735bb097ae512cc96ee65f93983afaf9ae472d8010d7d296a61673","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-12T16:33:49Z","title_canon_sha256":"e832a1cea458254e3f2649c0b4433f2a6509098a084589053f14a8a2b44071e8"},"schema_version":"1.0","source":{"id":"1207.3012","kind":"arxiv","version":2}},"canonical_sha256":"9842cb1c15ac3ea7735e95c8f7fe171c7a2a0ba0913866827d0a413e2cc39c64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9842cb1c15ac3ea7735e95c8f7fe171c7a2a0ba0913866827d0a413e2cc39c64","first_computed_at":"2026-05-18T02:21:08.348935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:08.348935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xcZ6i0oIBtIjB4yORjUZdIFa1siMeBg9WS2z62keZwG0Vg5YFMLm5cFpqWoTUqmQ8sJ/DYMGiy9M4mVdKqRwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:08.349403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3012","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f0fe729f1f410db114d2e759ef8e4e7d784eea2f275296d545f05f003c5b616","sha256:1196e4784cab10ebc73e1edc892c598b0b8cb2b1f2eea08d0dabeb0ec3feacd9"],"state_sha256":"b9f7b3f62106e3a67789318018d21a10d0dc87a9981271dc5c0406ddccb8b1d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1pTPP5SNfPI+qsJlAWVDXokf1JCEdanymBMESvyEbTRZuL0fqnQXOMMTlrUzNW7sfaDopT8d4U0fYi/hXmISCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T20:45:53.780497Z","bundle_sha256":"05c7d3bebe61c8159855339a8ec22e9c71ec3a130ddb8a3e887991e7c231406b"}}