{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LGU3SDDIBURET2RS7T5FNMNEZV","short_pith_number":"pith:LGU3SDDI","canonical_record":{"source":{"id":"1709.02909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-09T04:44:14Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"ded7b6c31aec5da06e93dcdd987a51e6fa938760e78a8149f9f0b13086f7140e","abstract_canon_sha256":"aa8c73cd13d615183f74c40c471aa099e2a88981d545c25c0ecb4ceb969acf44"},"schema_version":"1.0"},"canonical_sha256":"59a9b90c680d2249ea32fcfa56b1a4cd453f51efe5842c3abd4a034da457a0cf","source":{"kind":"arxiv","id":"1709.02909","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02909","created_at":"2026-05-18T00:35:40Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02909v1","created_at":"2026-05-18T00:35:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02909","created_at":"2026-05-18T00:35:40Z"},{"alias_kind":"pith_short_12","alias_value":"LGU3SDDIBURE","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LGU3SDDIBURET2RS","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LGU3SDDI","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LGU3SDDIBURET2RS7T5FNMNEZV","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-09T04:44:14Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"ded7b6c31aec5da06e93dcdd987a51e6fa938760e78a8149f9f0b13086f7140e","abstract_canon_sha256":"aa8c73cd13d615183f74c40c471aa099e2a88981d545c25c0ecb4ceb969acf44"},"schema_version":"1.0"},"canonical_sha256":"59a9b90c680d2249ea32fcfa56b1a4cd453f51efe5842c3abd4a034da457a0cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:40.154271Z","signature_b64":"NL5ggtHiA+Lef+X1ryfs2l2Z9fh/qH7ahJ7vy3+5qA+gM7kgNgufACtSWpVel/RO5DWp7F6fbrm8uPfmvVTzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59a9b90c680d2249ea32fcfa56b1a4cd453f51efe5842c3abd4a034da457a0cf","last_reissued_at":"2026-05-18T00:35:40.153714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:40.153714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02909","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:35:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XWBFBP9p+PAZxhLrOs3eWVflMGpdMZ+s2EUnz6pvEi8UNQypNPv5cY5hqegh0KMakeA4g3k2Uw3avGf127kDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:28:38.604655Z"},"content_sha256":"68d593a2a444cee842d78feedacdf663b557c244f0794a5484d2c58033c4a0f8","schema_version":"1.0","event_id":"sha256:68d593a2a444cee842d78feedacdf663b557c244f0794a5484d2c58033c4a0f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LGU3SDDIBURET2RS7T5FNMNEZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Analysis for Exp-concave Empirical Minimization with Arbitrary Convex Regularizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Lijun Zhang, Tianbao Yang, Zhe Li","submitted_at":"2017-09-09T04:44:14Z","abstract_excerpt":"In this paper, we present a simple analysis of {\\bf fast rates} with {\\it high probability} of {\\bf empirical minimization} for {\\it stochastic composite optimization} over a finite-dimensional bounded convex set with exponential concave loss functions and an arbitrary convex regularization. To the best of our knowledge, this result is the first of its kind. As a byproduct, we can directly obtain the fast rate with {\\it high probability} for exponential concave empirical risk minimization with and without any convex regularization, which not only extends existing results of empirical risk mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02909","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:35:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZDP/xfI0vPmK+NBwRrJ4d1i147hX/SG8GHS1GkSpevGK1Zhq5/mTpv63E6g+9RbnP2FGhim/+Mdbzb0GCwOPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:28:38.605356Z"},"content_sha256":"b7b3849de5f77eb496e3771cd584d8654daf9722839a8e439996d1415e21850e","schema_version":"1.0","event_id":"sha256:b7b3849de5f77eb496e3771cd584d8654daf9722839a8e439996d1415e21850e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGU3SDDIBURET2RS7T5FNMNEZV/bundle.json","state_url":"https://pith.science/pith/LGU3SDDIBURET2RS7T5FNMNEZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGU3SDDIBURET2RS7T5FNMNEZV/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-26T20:28:38Z","links":{"resolver":"https://pith.science/pith/LGU3SDDIBURET2RS7T5FNMNEZV","bundle":"https://pith.science/pith/LGU3SDDIBURET2RS7T5FNMNEZV/bundle.json","state":"https://pith.science/pith/LGU3SDDIBURET2RS7T5FNMNEZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGU3SDDIBURET2RS7T5FNMNEZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LGU3SDDIBURET2RS7T5FNMNEZV","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":"aa8c73cd13d615183f74c40c471aa099e2a88981d545c25c0ecb4ceb969acf44","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-09T04:44:14Z","title_canon_sha256":"ded7b6c31aec5da06e93dcdd987a51e6fa938760e78a8149f9f0b13086f7140e"},"schema_version":"1.0","source":{"id":"1709.02909","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02909","created_at":"2026-05-18T00:35:40Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02909v1","created_at":"2026-05-18T00:35:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02909","created_at":"2026-05-18T00:35:40Z"},{"alias_kind":"pith_short_12","alias_value":"LGU3SDDIBURE","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LGU3SDDIBURET2RS","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LGU3SDDI","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:b7b3849de5f77eb496e3771cd584d8654daf9722839a8e439996d1415e21850e","target":"graph","created_at":"2026-05-18T00:35:40Z","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":"In this paper, we present a simple analysis of {\\bf fast rates} with {\\it high probability} of {\\bf empirical minimization} for {\\it stochastic composite optimization} over a finite-dimensional bounded convex set with exponential concave loss functions and an arbitrary convex regularization. To the best of our knowledge, this result is the first of its kind. As a byproduct, we can directly obtain the fast rate with {\\it high probability} for exponential concave empirical risk minimization with and without any convex regularization, which not only extends existing results of empirical risk mini","authors_text":"Lijun Zhang, Tianbao Yang, Zhe Li","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-09T04:44:14Z","title":"A Simple Analysis for Exp-concave Empirical Minimization with Arbitrary Convex Regularizer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02909","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:68d593a2a444cee842d78feedacdf663b557c244f0794a5484d2c58033c4a0f8","target":"record","created_at":"2026-05-18T00:35:40Z","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":"aa8c73cd13d615183f74c40c471aa099e2a88981d545c25c0ecb4ceb969acf44","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-09T04:44:14Z","title_canon_sha256":"ded7b6c31aec5da06e93dcdd987a51e6fa938760e78a8149f9f0b13086f7140e"},"schema_version":"1.0","source":{"id":"1709.02909","kind":"arxiv","version":1}},"canonical_sha256":"59a9b90c680d2249ea32fcfa56b1a4cd453f51efe5842c3abd4a034da457a0cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59a9b90c680d2249ea32fcfa56b1a4cd453f51efe5842c3abd4a034da457a0cf","first_computed_at":"2026-05-18T00:35:40.153714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:40.153714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NL5ggtHiA+Lef+X1ryfs2l2Z9fh/qH7ahJ7vy3+5qA+gM7kgNgufACtSWpVel/RO5DWp7F6fbrm8uPfmvVTzDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:40.154271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02909","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68d593a2a444cee842d78feedacdf663b557c244f0794a5484d2c58033c4a0f8","sha256:b7b3849de5f77eb496e3771cd584d8654daf9722839a8e439996d1415e21850e"],"state_sha256":"650cef93906c5c485f836d0eebc917df57dbf8985dd0072fc08f36c9a8836e12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SkCp+FO/PNjFi0XzwoZD182XEtpke1UYM3gEOIqVUIlLawxcOBrYd62GZ84y0eJPPVQu5vpswBVMRa/9ahxrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:28:38.608746Z","bundle_sha256":"4acabf6c7965d661a1d005153c13bfac52b87e2864eb1d8cc3ed8d741ce5a5cb"}}