{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VWBO5EJTSVEG6UGGT4PXATWT6H","short_pith_number":"pith:VWBO5EJT","canonical_record":{"source":{"id":"1701.09033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-31T13:33:24Z","cross_cats_sorted":[],"title_canon_sha256":"bf3ef1f15623e707bd236baa87693a7b2938887e38b26c6f2509d5d9ebdcdcc3","abstract_canon_sha256":"1678e97cd448134243b6c875ec070bfbd2e414efda6dbb06509d8018ceee8073"},"schema_version":"1.0"},"canonical_sha256":"ad82ee913395486f50c69f1f704ed3f1f351d887f9c11156d73256f5f1a16f9f","source":{"kind":"arxiv","id":"1701.09033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.09033","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1701.09033v1","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.09033","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"VWBO5EJTSVEG","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VWBO5EJTSVEG6UGG","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VWBO5EJT","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VWBO5EJTSVEG6UGGT4PXATWT6H","target":"record","payload":{"canonical_record":{"source":{"id":"1701.09033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-31T13:33:24Z","cross_cats_sorted":[],"title_canon_sha256":"bf3ef1f15623e707bd236baa87693a7b2938887e38b26c6f2509d5d9ebdcdcc3","abstract_canon_sha256":"1678e97cd448134243b6c875ec070bfbd2e414efda6dbb06509d8018ceee8073"},"schema_version":"1.0"},"canonical_sha256":"ad82ee913395486f50c69f1f704ed3f1f351d887f9c11156d73256f5f1a16f9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:38.620181Z","signature_b64":"VUeFoSXN1ulWlfJClkpJ0Ly5zaJufKpO3Xqny+F9Ousb928ybs4WgwgBb7seDOXseMqyUPBzfyZfex+e3zflBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad82ee913395486f50c69f1f704ed3f1f351d887f9c11156d73256f5f1a16f9f","last_reissued_at":"2026-05-18T00:51:38.619714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:38.619714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.09033","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-18T00:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYe0FDKuea86F+XnakzjzKaQAEwhqjG7IFkcfvPu1Xpv95VRugBe04kW/XhmkXdsX/XcSTOERWZd07mhmCb0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:01:46.882814Z"},"content_sha256":"808788a2aad35479498793ecb3093b4419d4d72f0aae0da202ddb782b92cce48","schema_version":"1.0","event_id":"sha256:808788a2aad35479498793ecb3093b4419d4d72f0aae0da202ddb782b92cce48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VWBO5EJTSVEG6UGGT4PXATWT6H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Three-Composite Convex Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alp Yurtsever, Bang Cong Vu, Volkan Cevher","submitted_at":"2017-01-31T13:33:24Z","abstract_excerpt":"We propose a stochastic optimization method for the minimization of the sum of three convex functions, one of which has Lipschitz continuous gradient as well as restricted strong convexity. Our approach is most suitable in the setting where it is computationally advantageous to process smooth term in the decomposition with its stochastic gradient estimate and the other two functions separately with their proximal operators, such as doubly regularized empirical risk minimization problems. We prove the convergence characterization of the proposed algorithm in expectation under the standard assum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.09033","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-18T00:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XvG/5CY9gqrNMn1T+jYhRBFK5W6yIByPD9wMcmFne1IxGoxzt06ZK72X/b8zn8QyLPOMpq100WdQ8t/WVyHmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:01:46.883552Z"},"content_sha256":"cc3985234433afcc7d4542ee52cd55e8cea07a445c457c109ec5af74629b3be7","schema_version":"1.0","event_id":"sha256:cc3985234433afcc7d4542ee52cd55e8cea07a445c457c109ec5af74629b3be7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWBO5EJTSVEG6UGGT4PXATWT6H/bundle.json","state_url":"https://pith.science/pith/VWBO5EJTSVEG6UGGT4PXATWT6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWBO5EJTSVEG6UGGT4PXATWT6H/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-11T10:01:46Z","links":{"resolver":"https://pith.science/pith/VWBO5EJTSVEG6UGGT4PXATWT6H","bundle":"https://pith.science/pith/VWBO5EJTSVEG6UGGT4PXATWT6H/bundle.json","state":"https://pith.science/pith/VWBO5EJTSVEG6UGGT4PXATWT6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWBO5EJTSVEG6UGGT4PXATWT6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VWBO5EJTSVEG6UGGT4PXATWT6H","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":"1678e97cd448134243b6c875ec070bfbd2e414efda6dbb06509d8018ceee8073","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-31T13:33:24Z","title_canon_sha256":"bf3ef1f15623e707bd236baa87693a7b2938887e38b26c6f2509d5d9ebdcdcc3"},"schema_version":"1.0","source":{"id":"1701.09033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.09033","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1701.09033v1","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.09033","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"VWBO5EJTSVEG","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VWBO5EJTSVEG6UGG","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VWBO5EJT","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:cc3985234433afcc7d4542ee52cd55e8cea07a445c457c109ec5af74629b3be7","target":"graph","created_at":"2026-05-18T00:51: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 propose a stochastic optimization method for the minimization of the sum of three convex functions, one of which has Lipschitz continuous gradient as well as restricted strong convexity. Our approach is most suitable in the setting where it is computationally advantageous to process smooth term in the decomposition with its stochastic gradient estimate and the other two functions separately with their proximal operators, such as doubly regularized empirical risk minimization problems. We prove the convergence characterization of the proposed algorithm in expectation under the standard assum","authors_text":"Alp Yurtsever, Bang Cong Vu, Volkan Cevher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-31T13:33:24Z","title":"Stochastic Three-Composite Convex Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.09033","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:808788a2aad35479498793ecb3093b4419d4d72f0aae0da202ddb782b92cce48","target":"record","created_at":"2026-05-18T00:51: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":"1678e97cd448134243b6c875ec070bfbd2e414efda6dbb06509d8018ceee8073","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-31T13:33:24Z","title_canon_sha256":"bf3ef1f15623e707bd236baa87693a7b2938887e38b26c6f2509d5d9ebdcdcc3"},"schema_version":"1.0","source":{"id":"1701.09033","kind":"arxiv","version":1}},"canonical_sha256":"ad82ee913395486f50c69f1f704ed3f1f351d887f9c11156d73256f5f1a16f9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad82ee913395486f50c69f1f704ed3f1f351d887f9c11156d73256f5f1a16f9f","first_computed_at":"2026-05-18T00:51:38.619714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:38.619714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VUeFoSXN1ulWlfJClkpJ0Ly5zaJufKpO3Xqny+F9Ousb928ybs4WgwgBb7seDOXseMqyUPBzfyZfex+e3zflBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:38.620181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.09033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:808788a2aad35479498793ecb3093b4419d4d72f0aae0da202ddb782b92cce48","sha256:cc3985234433afcc7d4542ee52cd55e8cea07a445c457c109ec5af74629b3be7"],"state_sha256":"b9fd415817414e70df1e548245b3de50b859e8e4ebc0b2bf1eadc2b713e2bfb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zIusaJaIcN4r58xs8p0bKMtARsulmIda3yUsFtZenIYsbirOqQt8eaK4DXAA9cEKJe6OOQ851r3zXqzGmn+qDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:01:46.887037Z","bundle_sha256":"100c8c6bc59abd11fea66151b9cee591c207954a3e440254861b50c3886fc504"}}