{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4N22LN2OBYFJVNHCWNZHGJ6POV","short_pith_number":"pith:4N22LN2O","canonical_record":{"source":{"id":"1306.2119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-06-10T07:31:10Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"441933cee83be1d47f913edff09783aa3f255cc6d64b406abc10356cbfbb516b","abstract_canon_sha256":"eab2b7ba3950e1d6828dffb23d8a5a7a34bb800435ad2ab8af2e65327dbbf80b"},"schema_version":"1.0"},"canonical_sha256":"e375a5b74e0e0a9ab4e2b3727327cf75562f75715241f3d410dd123240489fc2","source":{"kind":"arxiv","id":"1306.2119","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2119","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2119v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2119","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"4N22LN2OBYFJ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4N22LN2OBYFJVNHC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4N22LN2O","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4N22LN2OBYFJVNHCWNZHGJ6POV","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-06-10T07:31:10Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"441933cee83be1d47f913edff09783aa3f255cc6d64b406abc10356cbfbb516b","abstract_canon_sha256":"eab2b7ba3950e1d6828dffb23d8a5a7a34bb800435ad2ab8af2e65327dbbf80b"},"schema_version":"1.0"},"canonical_sha256":"e375a5b74e0e0a9ab4e2b3727327cf75562f75715241f3d410dd123240489fc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:22.313487Z","signature_b64":"1p1YJY6Nlu0NeEwdM2E6BUgj6oSi9DyL3hZzdDQuMuhJyqVBNnC6ZM9OScllSGxqrnytn15qQxv3fW/wqVIPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e375a5b74e0e0a9ab4e2b3727327cf75562f75715241f3d410dd123240489fc2","last_reissued_at":"2026-05-18T03:21:22.312958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:22.312958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2119","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:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HE1ZndPklCfwyi+WL8C+ZscxDSUOsfLyoqTRre18ZhkIeh+1y321ig929lj7P2dyLQaKkcUVM//XdrHqAoaICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:57:37.584095Z"},"content_sha256":"b4a417dee89b8c16463147605d739dc13993b65a7d99e7297a98b9eea3157107","schema_version":"1.0","event_id":"sha256:b4a417dee89b8c16463147605d739dc13993b65a7d99e7297a98b9eea3157107"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4N22LN2OBYFJVNHCWNZHGJ6POV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric Moulines (LTCI), Francis Bach (INRIA Paris - Rocquencourt, LIENS)","submitted_at":"2013-06-10T07:31:10Z","abstract_excerpt":"We consider the stochastic approximation problem where a convex function has to be minimized, given only the knowledge of unbiased estimates of its gradients at certain points, a framework which includes machine learning methods based on the minimization of the empirical risk. We focus on problems without strong convexity, for which all previously known algorithms achieve a convergence rate for function values of O(1/n^{1/2}). We consider and analyze two algorithms that achieve a rate of O(1/n) for classical supervised learning problems. For least-squares regression, we show that averaged stoc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2119","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:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaTFh5QgcS38rcON8BjNKs8HgO7XKKnYAcU+jq8zRwmvpZxhpDTvFdLI7emLjnfZcoKoQvpGeMLbjq7w6sYbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:57:37.584718Z"},"content_sha256":"6729824559f951bf45276f2b764ecb72e5cd5f061728e7d8d2aa7f8dd82367bc","schema_version":"1.0","event_id":"sha256:6729824559f951bf45276f2b764ecb72e5cd5f061728e7d8d2aa7f8dd82367bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV/bundle.json","state_url":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4N22LN2OBYFJVNHCWNZHGJ6POV/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-26T17:57:37Z","links":{"resolver":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV","bundle":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV/bundle.json","state":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4N22LN2OBYFJVNHCWNZHGJ6POV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4N22LN2OBYFJVNHCWNZHGJ6POV","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":"eab2b7ba3950e1d6828dffb23d8a5a7a34bb800435ad2ab8af2e65327dbbf80b","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-06-10T07:31:10Z","title_canon_sha256":"441933cee83be1d47f913edff09783aa3f255cc6d64b406abc10356cbfbb516b"},"schema_version":"1.0","source":{"id":"1306.2119","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2119","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2119v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2119","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"4N22LN2OBYFJ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4N22LN2OBYFJVNHC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4N22LN2O","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:6729824559f951bf45276f2b764ecb72e5cd5f061728e7d8d2aa7f8dd82367bc","target":"graph","created_at":"2026-05-18T03:21:22Z","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 consider the stochastic approximation problem where a convex function has to be minimized, given only the knowledge of unbiased estimates of its gradients at certain points, a framework which includes machine learning methods based on the minimization of the empirical risk. We focus on problems without strong convexity, for which all previously known algorithms achieve a convergence rate for function values of O(1/n^{1/2}). We consider and analyze two algorithms that achieve a rate of O(1/n) for classical supervised learning problems. For least-squares regression, we show that averaged stoc","authors_text":"Eric Moulines (LTCI), Francis Bach (INRIA Paris - Rocquencourt, LIENS)","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-06-10T07:31:10Z","title":"Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2119","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:b4a417dee89b8c16463147605d739dc13993b65a7d99e7297a98b9eea3157107","target":"record","created_at":"2026-05-18T03:21:22Z","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":"eab2b7ba3950e1d6828dffb23d8a5a7a34bb800435ad2ab8af2e65327dbbf80b","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-06-10T07:31:10Z","title_canon_sha256":"441933cee83be1d47f913edff09783aa3f255cc6d64b406abc10356cbfbb516b"},"schema_version":"1.0","source":{"id":"1306.2119","kind":"arxiv","version":1}},"canonical_sha256":"e375a5b74e0e0a9ab4e2b3727327cf75562f75715241f3d410dd123240489fc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e375a5b74e0e0a9ab4e2b3727327cf75562f75715241f3d410dd123240489fc2","first_computed_at":"2026-05-18T03:21:22.312958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:22.312958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1p1YJY6Nlu0NeEwdM2E6BUgj6oSi9DyL3hZzdDQuMuhJyqVBNnC6ZM9OScllSGxqrnytn15qQxv3fW/wqVIPBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:22.313487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2119","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4a417dee89b8c16463147605d739dc13993b65a7d99e7297a98b9eea3157107","sha256:6729824559f951bf45276f2b764ecb72e5cd5f061728e7d8d2aa7f8dd82367bc"],"state_sha256":"7441d0aa736e70158322b06e56e62d5f1545d586067d6e64df0530d08ed5cd75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJ4VlvC+WYe75UYxumEUB2bnMUp+849jqikYieTYg/U7PsEEVCMGPXeVetfuXSYGSbd/wNoGJ/02NoEtvRpRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:57:37.587935Z","bundle_sha256":"602fd635945650ac16ebcea5316f62572ee14260fa3b619832968d82d21353f2"}}