{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7KKICZAHPJ4GKDXLQPEWSIOSDY","short_pith_number":"pith:7KKICZAH","canonical_record":{"source":{"id":"1802.08880","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-24T17:09:27Z","cross_cats_sorted":[],"title_canon_sha256":"f3fbce5b380f1e98f62a6bac8184034c21cf2be6a20b26e6a47cc200772bd7b1","abstract_canon_sha256":"6e9b1539352fd7e4f9389320b48dc92ff1d20bdf9cb55a4e880aec3dac37cd33"},"schema_version":"1.0"},"canonical_sha256":"fa948164077a78650eeb83c96921d21e0f605a3a0bd97d0979dd10f72153f6f5","source":{"kind":"arxiv","id":"1802.08880","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08880","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08880v3","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08880","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"pith_short_12","alias_value":"7KKICZAHPJ4G","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7KKICZAHPJ4GKDXL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7KKICZAH","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7KKICZAHPJ4GKDXLQPEWSIOSDY","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08880","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-24T17:09:27Z","cross_cats_sorted":[],"title_canon_sha256":"f3fbce5b380f1e98f62a6bac8184034c21cf2be6a20b26e6a47cc200772bd7b1","abstract_canon_sha256":"6e9b1539352fd7e4f9389320b48dc92ff1d20bdf9cb55a4e880aec3dac37cd33"},"schema_version":"1.0"},"canonical_sha256":"fa948164077a78650eeb83c96921d21e0f605a3a0bd97d0979dd10f72153f6f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:40.989211Z","signature_b64":"YC3FX1LCaGUEiAuy3eC/YfwYUi05gVAgq/AcjsdIIwmbQ+gaXL79EHiKvG1G7WjaHFqWXeqOn1YVW5t8ZOfODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa948164077a78650eeb83c96921d21e0f605a3a0bd97d0979dd10f72153f6f5","last_reissued_at":"2026-05-18T00:05:40.988625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:40.988625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08880","source_version":3,"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:05:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UuFj49jS/G4fZ+5JFE3m2lzfqykcBPt7mqQ3LP+B9Iss/dZhN3sQ2lqjUuJMpE3kXIJTiJ7x2t6A7AGy/ckgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:32:58.890869Z"},"content_sha256":"40c1694852d110db8ed64e083f66dc132ca1ad630a3907685ef6b29ac12cb3bc","schema_version":"1.0","event_id":"sha256:40c1694852d110db8ed64e083f66dc132ca1ad630a3907685ef6b29ac12cb3bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7KKICZAHPJ4GKDXLQPEWSIOSDY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Stochastic Proximal Methods for Nonconvex Nonsmooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Di Niu, Rui Zhu, Zongpeng Li","submitted_at":"2018-02-24T17:09:27Z","abstract_excerpt":"We study stochastic algorithms for solving nonconvex optimization problems with a convex yet possibly nonsmooth regularizer, which find wide applications in many practical machine learning applications. However, compared to asynchronous parallel stochastic gradient descent (AsynSGD), an algorithm targeting smooth optimization, the understanding of the behavior of stochastic algorithms for nonsmooth regularized optimization problems is limited, especially when the objective function is nonconvex. To fill this theoretical gap, in this paper, we propose and analyze asynchronous parallel stochasti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08880","kind":"arxiv","version":3},"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:05:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fxVMojUvfPr74Hr6TZlkI3pLGRJBSyQsUywkOnk/bVNCHgGESziaHfL2dtdnhXgdxBuV/PaGkwrEvudSecuXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:32:58.891506Z"},"content_sha256":"faeea9548afb0eb76f17252703c1843f7016f24c7baae63b1f106314f8d57940","schema_version":"1.0","event_id":"sha256:faeea9548afb0eb76f17252703c1843f7016f24c7baae63b1f106314f8d57940"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KKICZAHPJ4GKDXLQPEWSIOSDY/bundle.json","state_url":"https://pith.science/pith/7KKICZAHPJ4GKDXLQPEWSIOSDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KKICZAHPJ4GKDXLQPEWSIOSDY/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-22T15:32:58Z","links":{"resolver":"https://pith.science/pith/7KKICZAHPJ4GKDXLQPEWSIOSDY","bundle":"https://pith.science/pith/7KKICZAHPJ4GKDXLQPEWSIOSDY/bundle.json","state":"https://pith.science/pith/7KKICZAHPJ4GKDXLQPEWSIOSDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KKICZAHPJ4GKDXLQPEWSIOSDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7KKICZAHPJ4GKDXLQPEWSIOSDY","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":"6e9b1539352fd7e4f9389320b48dc92ff1d20bdf9cb55a4e880aec3dac37cd33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-24T17:09:27Z","title_canon_sha256":"f3fbce5b380f1e98f62a6bac8184034c21cf2be6a20b26e6a47cc200772bd7b1"},"schema_version":"1.0","source":{"id":"1802.08880","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08880","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08880v3","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08880","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"pith_short_12","alias_value":"7KKICZAHPJ4G","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7KKICZAHPJ4GKDXL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7KKICZAH","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:faeea9548afb0eb76f17252703c1843f7016f24c7baae63b1f106314f8d57940","target":"graph","created_at":"2026-05-18T00:05: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":"We study stochastic algorithms for solving nonconvex optimization problems with a convex yet possibly nonsmooth regularizer, which find wide applications in many practical machine learning applications. However, compared to asynchronous parallel stochastic gradient descent (AsynSGD), an algorithm targeting smooth optimization, the understanding of the behavior of stochastic algorithms for nonsmooth regularized optimization problems is limited, especially when the objective function is nonconvex. To fill this theoretical gap, in this paper, we propose and analyze asynchronous parallel stochasti","authors_text":"Di Niu, Rui Zhu, Zongpeng Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-24T17:09:27Z","title":"Asynchronous Stochastic Proximal Methods for Nonconvex Nonsmooth Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08880","kind":"arxiv","version":3},"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:40c1694852d110db8ed64e083f66dc132ca1ad630a3907685ef6b29ac12cb3bc","target":"record","created_at":"2026-05-18T00:05: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":"6e9b1539352fd7e4f9389320b48dc92ff1d20bdf9cb55a4e880aec3dac37cd33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-24T17:09:27Z","title_canon_sha256":"f3fbce5b380f1e98f62a6bac8184034c21cf2be6a20b26e6a47cc200772bd7b1"},"schema_version":"1.0","source":{"id":"1802.08880","kind":"arxiv","version":3}},"canonical_sha256":"fa948164077a78650eeb83c96921d21e0f605a3a0bd97d0979dd10f72153f6f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa948164077a78650eeb83c96921d21e0f605a3a0bd97d0979dd10f72153f6f5","first_computed_at":"2026-05-18T00:05:40.988625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:40.988625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YC3FX1LCaGUEiAuy3eC/YfwYUi05gVAgq/AcjsdIIwmbQ+gaXL79EHiKvG1G7WjaHFqWXeqOn1YVW5t8ZOfODA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:40.989211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08880","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40c1694852d110db8ed64e083f66dc132ca1ad630a3907685ef6b29ac12cb3bc","sha256:faeea9548afb0eb76f17252703c1843f7016f24c7baae63b1f106314f8d57940"],"state_sha256":"f2c130e73c6a8ad2f76ea068c6ee5e37bcb1cca40b869e626a493127698eae6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65tOXABpjp/CeriD2dRMWNfW7j1ktZxK5wvw7Zknx2kXrwWi86ke1teLbu0VRgN/KWzlFa16gurNbbm7Dxe+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T15:32:58.894910Z","bundle_sha256":"cf17e8ed14026efbe183ae1939e1d37ba6d77201278bc6f6ad64078cb25e30de"}}