{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:J5MRO3TXN4Z4YLKUEA3OET5DHZ","short_pith_number":"pith:J5MRO3TX","canonical_record":{"source":{"id":"1207.4421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-18T17:40:11Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"2e0ec2bdc7b3bda744b66754d7f73689c161e72010e61119689df698ade80e19","abstract_canon_sha256":"849f3d06df4c950cf267deda24cd993bc343823fbabc99e22181f154f2f2c61b"},"schema_version":"1.0"},"canonical_sha256":"4f59176e776f33cc2d542036e24fa33e53236f0af1160ff7f0776b7f62578871","source":{"kind":"arxiv","id":"1207.4421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4421","created_at":"2026-05-18T03:50:38Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4421v1","created_at":"2026-05-18T03:50:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4421","created_at":"2026-05-18T03:50:38Z"},{"alias_kind":"pith_short_12","alias_value":"J5MRO3TXN4Z4","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"J5MRO3TXN4Z4YLKU","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"J5MRO3TX","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:J5MRO3TXN4Z4YLKUEA3OET5DHZ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-18T17:40:11Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"2e0ec2bdc7b3bda744b66754d7f73689c161e72010e61119689df698ade80e19","abstract_canon_sha256":"849f3d06df4c950cf267deda24cd993bc343823fbabc99e22181f154f2f2c61b"},"schema_version":"1.0"},"canonical_sha256":"4f59176e776f33cc2d542036e24fa33e53236f0af1160ff7f0776b7f62578871","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:38.360433Z","signature_b64":"kEJn+E5zegZ0j04tJCOuP7vteOLTmk0tovKnvlaeakZcVdQ/EFmEgII2Uw9CcGjpAl5kb4a8FyYOyClNSwZ9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f59176e776f33cc2d542036e24fa33e53236f0af1160ff7f0776b7f62578871","last_reissued_at":"2026-05-18T03:50:38.359810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:38.359810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4421","source_version":1,"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-18T03:50:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oPnzurwO7VR6eMqD2H4DHD4Ij5c655FyTNQ3QQKMqQA0mGuDquc2XF2OGoyxrtoMS38tythSmo2oEGQnd9XwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:56:15.399509Z"},"content_sha256":"c729aa2acc8795b86f7d88d10d037a48322b2b8fab58b30bd570aee66e8d7ee6","schema_version":"1.0","event_id":"sha256:c729aa2acc8795b86f7d88d10d037a48322b2b8fab58b30bd570aee66e8d7ee6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:J5MRO3TXN4Z4YLKUEA3OET5DHZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic optimization and sparse statistical recovery: An optimal algorithm for high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Alekh Agarwal, Martin J. Wainwright, Sahand Negahban","submitted_at":"2012-07-18T17:40:11Z","abstract_excerpt":"We develop and analyze stochastic optimization algorithms for problems in which the expected loss is strongly convex, and the optimum is (approximately) sparse. Previous approaches are able to exploit only one of these two structures, yielding an $\\order(\\pdim/T)$ convergence rate for strongly convex objectives in $\\pdim$ dimensions, and an $\\order(\\sqrt{(\\spindex \\log \\pdim)/T})$ convergence rate when the optimum is $\\spindex$-sparse. Our algorithm is based on successively solving a series of $\\ell_1$-regularized optimization problems using Nesterov's dual averaging algorithm. We establish th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4421","kind":"arxiv","version":1},"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-18T03:50:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m65ji+Jn3LdQ2Wn3VW93O6n1a9sR41UXQR2UCOiq+vdSq0chsQoIAfdSYcvkbF8AagoGtAZdB5q8bIa2DfZnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:56:15.399883Z"},"content_sha256":"b053f1ccb28e575bfea0fce63d401c5e553a8b819146c86e14caf0a6327653e6","schema_version":"1.0","event_id":"sha256:b053f1ccb28e575bfea0fce63d401c5e553a8b819146c86e14caf0a6327653e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5MRO3TXN4Z4YLKUEA3OET5DHZ/bundle.json","state_url":"https://pith.science/pith/J5MRO3TXN4Z4YLKUEA3OET5DHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5MRO3TXN4Z4YLKUEA3OET5DHZ/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-06-01T23:56:15Z","links":{"resolver":"https://pith.science/pith/J5MRO3TXN4Z4YLKUEA3OET5DHZ","bundle":"https://pith.science/pith/J5MRO3TXN4Z4YLKUEA3OET5DHZ/bundle.json","state":"https://pith.science/pith/J5MRO3TXN4Z4YLKUEA3OET5DHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5MRO3TXN4Z4YLKUEA3OET5DHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:J5MRO3TXN4Z4YLKUEA3OET5DHZ","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":"849f3d06df4c950cf267deda24cd993bc343823fbabc99e22181f154f2f2c61b","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-18T17:40:11Z","title_canon_sha256":"2e0ec2bdc7b3bda744b66754d7f73689c161e72010e61119689df698ade80e19"},"schema_version":"1.0","source":{"id":"1207.4421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4421","created_at":"2026-05-18T03:50:38Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4421v1","created_at":"2026-05-18T03:50:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4421","created_at":"2026-05-18T03:50:38Z"},{"alias_kind":"pith_short_12","alias_value":"J5MRO3TXN4Z4","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"J5MRO3TXN4Z4YLKU","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"J5MRO3TX","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:b053f1ccb28e575bfea0fce63d401c5e553a8b819146c86e14caf0a6327653e6","target":"graph","created_at":"2026-05-18T03:50:38Z","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 develop and analyze stochastic optimization algorithms for problems in which the expected loss is strongly convex, and the optimum is (approximately) sparse. Previous approaches are able to exploit only one of these two structures, yielding an $\\order(\\pdim/T)$ convergence rate for strongly convex objectives in $\\pdim$ dimensions, and an $\\order(\\sqrt{(\\spindex \\log \\pdim)/T})$ convergence rate when the optimum is $\\spindex$-sparse. Our algorithm is based on successively solving a series of $\\ell_1$-regularized optimization problems using Nesterov's dual averaging algorithm. We establish th","authors_text":"Alekh Agarwal, Martin J. Wainwright, Sahand Negahban","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-18T17:40:11Z","title":"Stochastic optimization and sparse statistical recovery: An optimal algorithm for high dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4421","kind":"arxiv","version":1},"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:c729aa2acc8795b86f7d88d10d037a48322b2b8fab58b30bd570aee66e8d7ee6","target":"record","created_at":"2026-05-18T03:50:38Z","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":"849f3d06df4c950cf267deda24cd993bc343823fbabc99e22181f154f2f2c61b","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-18T17:40:11Z","title_canon_sha256":"2e0ec2bdc7b3bda744b66754d7f73689c161e72010e61119689df698ade80e19"},"schema_version":"1.0","source":{"id":"1207.4421","kind":"arxiv","version":1}},"canonical_sha256":"4f59176e776f33cc2d542036e24fa33e53236f0af1160ff7f0776b7f62578871","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f59176e776f33cc2d542036e24fa33e53236f0af1160ff7f0776b7f62578871","first_computed_at":"2026-05-18T03:50:38.359810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:38.359810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kEJn+E5zegZ0j04tJCOuP7vteOLTmk0tovKnvlaeakZcVdQ/EFmEgII2Uw9CcGjpAl5kb4a8FyYOyClNSwZ9Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:38.360433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c729aa2acc8795b86f7d88d10d037a48322b2b8fab58b30bd570aee66e8d7ee6","sha256:b053f1ccb28e575bfea0fce63d401c5e553a8b819146c86e14caf0a6327653e6"],"state_sha256":"21c0daaa33f303b97c127788f045a6abc642c5e9e0a89fd8d890c123b2f0fcdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5M6unPPYSwIomGZw9PfsNeoNLV7r/fV06P+4mvo1N8sM+r9iwFCubBY9MaQHWgiOa2KiyDOA93EsVgIl5pKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:56:15.401740Z","bundle_sha256":"53cfc51fa0d5043c87adbd864e3d050cefbaefd3ab4ce2d36bde47fcfdbbdd6e"}}