{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JGIVLQZFXLBSZTWURWUDMJTKNJ","short_pith_number":"pith:JGIVLQZF","canonical_record":{"source":{"id":"1902.06158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-16T21:09:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"44c16340c8a3a6142cd55fd2a187de12ef839d4d9070a7c49936927e4abcd8ba","abstract_canon_sha256":"0f50d3c507ec83e8325246dc6a19fe688ae2a4788f65e01fabae1060c24cac93"},"schema_version":"1.0"},"canonical_sha256":"499155c325bac32cced48da836266a6a5729ce5da29038850abb4e71a2582441","source":{"kind":"arxiv","id":"1902.06158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06158","created_at":"2026-05-17T23:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06158v1","created_at":"2026-05-17T23:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06158","created_at":"2026-05-17T23:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"JGIVLQZFXLBS","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JGIVLQZFXLBSZTWU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JGIVLQZF","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JGIVLQZFXLBSZTWURWUDMJTKNJ","target":"record","payload":{"canonical_record":{"source":{"id":"1902.06158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-16T21:09:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"44c16340c8a3a6142cd55fd2a187de12ef839d4d9070a7c49936927e4abcd8ba","abstract_canon_sha256":"0f50d3c507ec83e8325246dc6a19fe688ae2a4788f65e01fabae1060c24cac93"},"schema_version":"1.0"},"canonical_sha256":"499155c325bac32cced48da836266a6a5729ce5da29038850abb4e71a2582441","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:46.420897Z","signature_b64":"GkxqDF4+RJ8Xd2mvZqPTWOoxV0JtNcV6GAt96B7ch3NERfnY098Sfb563LDrWsJiJNJW8CXIHBo3+VG3CTk6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"499155c325bac32cced48da836266a6a5729ce5da29038850abb4e71a2582441","last_reissued_at":"2026-05-17T23:53:46.420249Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:46.420249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.06158","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-17T23:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYT0WQ2e3ydnscMRXNDKdV58rigcEmoq3r6p/d4o+kynWW+R3uNHa1G9aPwOprqJ8WpOAavbgSxTPbjk03A7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:01:40.465530Z"},"content_sha256":"1eac63cc142b9f1db740fd863d418b108c19a89410650b0984566d4dba5f81a4","schema_version":"1.0","event_id":"sha256:1eac63cc142b9f1db740fd863d418b108c19a89410650b0984566d4dba5f81a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JGIVLQZFXLBSZTWURWUDMJTKNJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Bin Gu, Feihu Huang, Heng Huang, Songcan Chen, Zhouyuan Huo","submitted_at":"2019-02-16T21:09:05Z","abstract_excerpt":"Proximal gradient method has been playing an important role to solve many machine learning tasks, especially for the nonsmooth problems. However, in some machine learning problems such as the bandit model and the black-box learning problem, proximal gradient method could fail because the explicit gradients of these problems are difficult or infeasible to obtain. The gradient-free (zeroth-order) method can address these problems because only the objective function values are required in the optimization. Recently, the first zeroth-order proximal stochastic algorithm was proposed to solve the no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06158","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-17T23:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uC/cYDekVdFBfJe182p0G+gTPQR0pmmVVzb/6JiWflFt+uYYoQW0pc6efbBnrcg1kAEYX1LlEf22AS5jY/uKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:01:40.465871Z"},"content_sha256":"37d49efd81c6e8f309a70f7132cdb081a7d8915cc818a8944d93821c37b7b969","schema_version":"1.0","event_id":"sha256:37d49efd81c6e8f309a70f7132cdb081a7d8915cc818a8944d93821c37b7b969"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGIVLQZFXLBSZTWURWUDMJTKNJ/bundle.json","state_url":"https://pith.science/pith/JGIVLQZFXLBSZTWURWUDMJTKNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGIVLQZFXLBSZTWURWUDMJTKNJ/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-04T11:01:40Z","links":{"resolver":"https://pith.science/pith/JGIVLQZFXLBSZTWURWUDMJTKNJ","bundle":"https://pith.science/pith/JGIVLQZFXLBSZTWURWUDMJTKNJ/bundle.json","state":"https://pith.science/pith/JGIVLQZFXLBSZTWURWUDMJTKNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGIVLQZFXLBSZTWURWUDMJTKNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JGIVLQZFXLBSZTWURWUDMJTKNJ","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":"0f50d3c507ec83e8325246dc6a19fe688ae2a4788f65e01fabae1060c24cac93","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-16T21:09:05Z","title_canon_sha256":"44c16340c8a3a6142cd55fd2a187de12ef839d4d9070a7c49936927e4abcd8ba"},"schema_version":"1.0","source":{"id":"1902.06158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06158","created_at":"2026-05-17T23:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06158v1","created_at":"2026-05-17T23:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06158","created_at":"2026-05-17T23:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"JGIVLQZFXLBS","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JGIVLQZFXLBSZTWU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JGIVLQZF","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:37d49efd81c6e8f309a70f7132cdb081a7d8915cc818a8944d93821c37b7b969","target":"graph","created_at":"2026-05-17T23:53:46Z","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":"Proximal gradient method has been playing an important role to solve many machine learning tasks, especially for the nonsmooth problems. However, in some machine learning problems such as the bandit model and the black-box learning problem, proximal gradient method could fail because the explicit gradients of these problems are difficult or infeasible to obtain. The gradient-free (zeroth-order) method can address these problems because only the objective function values are required in the optimization. Recently, the first zeroth-order proximal stochastic algorithm was proposed to solve the no","authors_text":"Bin Gu, Feihu Huang, Heng Huang, Songcan Chen, Zhouyuan Huo","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-16T21:09:05Z","title":"Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06158","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:1eac63cc142b9f1db740fd863d418b108c19a89410650b0984566d4dba5f81a4","target":"record","created_at":"2026-05-17T23:53:46Z","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":"0f50d3c507ec83e8325246dc6a19fe688ae2a4788f65e01fabae1060c24cac93","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-16T21:09:05Z","title_canon_sha256":"44c16340c8a3a6142cd55fd2a187de12ef839d4d9070a7c49936927e4abcd8ba"},"schema_version":"1.0","source":{"id":"1902.06158","kind":"arxiv","version":1}},"canonical_sha256":"499155c325bac32cced48da836266a6a5729ce5da29038850abb4e71a2582441","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"499155c325bac32cced48da836266a6a5729ce5da29038850abb4e71a2582441","first_computed_at":"2026-05-17T23:53:46.420249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:46.420249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GkxqDF4+RJ8Xd2mvZqPTWOoxV0JtNcV6GAt96B7ch3NERfnY098Sfb563LDrWsJiJNJW8CXIHBo3+VG3CTk6Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:46.420897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1eac63cc142b9f1db740fd863d418b108c19a89410650b0984566d4dba5f81a4","sha256:37d49efd81c6e8f309a70f7132cdb081a7d8915cc818a8944d93821c37b7b969"],"state_sha256":"c44fe33a4e09d0b8737b727904029fd90ceefa6dce27b569eef025739dd7f8ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VU+lFFKclULR+n/6Bu80xcaVLp1tksIsxwyWgWm4EvBOSRPU08zJlO2jKH4ZvP5k8MLR/qNE7S2GSIug9VtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T11:01:40.467792Z","bundle_sha256":"71b58d7a484a083494e0bd74d9c44fe8bf72a5c1a3dd466c163c776fd33b0e88"}}