{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QEIFP2IO67S3RJ6ME5JD2L2Q5W","short_pith_number":"pith:QEIFP2IO","canonical_record":{"source":{"id":"1008.5204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-31T02:42:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4a469f0cfdb5949032d2ca7b291d16f484529f203c43718be73239702e4386ce","abstract_canon_sha256":"88d20c684eeeccb64e7ed24e22051b0a94e8d3381bbbb3f3109a0baf9be74c09"},"schema_version":"1.0"},"canonical_sha256":"811057e90ef7e5b8a7cc27523d2f50ed87da548cbbbb718f85f9f64827ef6eda","source":{"kind":"arxiv","id":"1008.5204","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5204","created_at":"2026-05-18T04:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5204v2","created_at":"2026-05-18T04:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5204","created_at":"2026-05-18T04:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"QEIFP2IO67S3","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QEIFP2IO67S3RJ6M","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QEIFP2IO","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QEIFP2IO67S3RJ6ME5JD2L2Q5W","target":"record","payload":{"canonical_record":{"source":{"id":"1008.5204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-31T02:42:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4a469f0cfdb5949032d2ca7b291d16f484529f203c43718be73239702e4386ce","abstract_canon_sha256":"88d20c684eeeccb64e7ed24e22051b0a94e8d3381bbbb3f3109a0baf9be74c09"},"schema_version":"1.0"},"canonical_sha256":"811057e90ef7e5b8a7cc27523d2f50ed87da548cbbbb718f85f9f64827ef6eda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:04.404452Z","signature_b64":"UWGmQ6Y021HmmGXAtdBfR5736EFIVermMmctbK0bq2EzbHvzwVi6SWeE8XsQo0YMlE1GmE5kVx1jCacNebWUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"811057e90ef7e5b8a7cc27523d2f50ed87da548cbbbb718f85f9f64827ef6eda","last_reissued_at":"2026-05-18T04:19:04.404004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:04.404004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.5204","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-18T04:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BpTBipnhq4RG5ESdqMrTgpEIeSsWW6iRl+zBDFK1GVyodrBihPK3lDr/d3fviz/dbGG6hcWGa6M/2i08bR8aAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:13:59.617574Z"},"content_sha256":"e965ca7395626badbcdb1e43f4619d191d7628426ac5d00857e8f4b59471570a","schema_version":"1.0","event_id":"sha256:e965ca7395626badbcdb1e43f4619d191d7628426ac5d00857e8f4b59471570a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QEIFP2IO67S3RJ6ME5JD2L2Q5W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Smoothing Stochastic Gradient Method for Composite Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Javier Pena, Qihang Lin, Xi Chen","submitted_at":"2010-08-31T02:42:32Z","abstract_excerpt":"We consider the unconstrained optimization problem whose objective function is composed of a smooth and a non-smooth conponents where the smooth component is the expectation a random function. This type of problem arises in some interesting applications in machine learning. We propose a stochastic gradient descent algorithm for this class of optimization problem. When the non-smooth component has a particular structure, we propose another stochastic gradient descent algorithm by incorporating a smoothing method into our first algorithm. The proofs of the convergence rates of these two algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5204","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-18T04:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sdjd19n2eAQO6pRFTx9R0wCvWGy7fN9y3Lxu8+r/N9T5foV+UgB40DIrUvs+/D4GQFhj3eED1ndusaByHSKXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:13:59.618137Z"},"content_sha256":"65d87562e788e0b29db768075c3196cdffc1c43ee33f1facbe0a717c30d2d15a","schema_version":"1.0","event_id":"sha256:65d87562e788e0b29db768075c3196cdffc1c43ee33f1facbe0a717c30d2d15a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEIFP2IO67S3RJ6ME5JD2L2Q5W/bundle.json","state_url":"https://pith.science/pith/QEIFP2IO67S3RJ6ME5JD2L2Q5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEIFP2IO67S3RJ6ME5JD2L2Q5W/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-31T18:13:59Z","links":{"resolver":"https://pith.science/pith/QEIFP2IO67S3RJ6ME5JD2L2Q5W","bundle":"https://pith.science/pith/QEIFP2IO67S3RJ6ME5JD2L2Q5W/bundle.json","state":"https://pith.science/pith/QEIFP2IO67S3RJ6ME5JD2L2Q5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEIFP2IO67S3RJ6ME5JD2L2Q5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QEIFP2IO67S3RJ6ME5JD2L2Q5W","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":"88d20c684eeeccb64e7ed24e22051b0a94e8d3381bbbb3f3109a0baf9be74c09","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-31T02:42:32Z","title_canon_sha256":"4a469f0cfdb5949032d2ca7b291d16f484529f203c43718be73239702e4386ce"},"schema_version":"1.0","source":{"id":"1008.5204","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5204","created_at":"2026-05-18T04:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5204v2","created_at":"2026-05-18T04:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5204","created_at":"2026-05-18T04:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"QEIFP2IO67S3","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QEIFP2IO67S3RJ6M","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QEIFP2IO","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:65d87562e788e0b29db768075c3196cdffc1c43ee33f1facbe0a717c30d2d15a","target":"graph","created_at":"2026-05-18T04:19:04Z","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 unconstrained optimization problem whose objective function is composed of a smooth and a non-smooth conponents where the smooth component is the expectation a random function. This type of problem arises in some interesting applications in machine learning. We propose a stochastic gradient descent algorithm for this class of optimization problem. When the non-smooth component has a particular structure, we propose another stochastic gradient descent algorithm by incorporating a smoothing method into our first algorithm. The proofs of the convergence rates of these two algorith","authors_text":"Javier Pena, Qihang Lin, Xi Chen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-31T02:42:32Z","title":"A Smoothing Stochastic Gradient Method for Composite Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5204","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:e965ca7395626badbcdb1e43f4619d191d7628426ac5d00857e8f4b59471570a","target":"record","created_at":"2026-05-18T04:19:04Z","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":"88d20c684eeeccb64e7ed24e22051b0a94e8d3381bbbb3f3109a0baf9be74c09","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-31T02:42:32Z","title_canon_sha256":"4a469f0cfdb5949032d2ca7b291d16f484529f203c43718be73239702e4386ce"},"schema_version":"1.0","source":{"id":"1008.5204","kind":"arxiv","version":2}},"canonical_sha256":"811057e90ef7e5b8a7cc27523d2f50ed87da548cbbbb718f85f9f64827ef6eda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"811057e90ef7e5b8a7cc27523d2f50ed87da548cbbbb718f85f9f64827ef6eda","first_computed_at":"2026-05-18T04:19:04.404004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:04.404004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UWGmQ6Y021HmmGXAtdBfR5736EFIVermMmctbK0bq2EzbHvzwVi6SWeE8XsQo0YMlE1GmE5kVx1jCacNebWUBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:04.404452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.5204","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e965ca7395626badbcdb1e43f4619d191d7628426ac5d00857e8f4b59471570a","sha256:65d87562e788e0b29db768075c3196cdffc1c43ee33f1facbe0a717c30d2d15a"],"state_sha256":"8ceed5c6f8660abb86b6fed7a88e9e60ae0e1b122a4d26552647ee1b59d36777"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdEmw4mKymYsFRrlCoKg39XKQTEL3fwKqHdCMGEBWnHTsQaFk/zs5U4cmYXje1DCPrnoJTWcAJFgI9Xm2BWsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:13:59.620904Z","bundle_sha256":"c4edfd9d15b8cfd8856ee2c44d05a0c1d95c1d4859c84fde6b95df1766bae174"}}