{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3LEBYDOHGIWB74IKRDXJXXHC6R","short_pith_number":"pith:3LEBYDOH","canonical_record":{"source":{"id":"1605.06900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T05:49:00Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"413b03b40e6365aef6c28534fbd367d621a576a760538841611bc24bfbec98e1","abstract_canon_sha256":"585da34ff10fe89ee0c01da9618741ce5af5bb344c2ab440103ee9b6804e4db1"},"schema_version":"1.0"},"canonical_sha256":"dac81c0dc7322c1ff10a88ee9bdce2f478efd9fa13801ad62aba35ed32350e4b","source":{"kind":"arxiv","id":"1605.06900","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06900","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06900v1","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06900","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"3LEBYDOHGIWB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3LEBYDOHGIWB74IK","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3LEBYDOH","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3LEBYDOHGIWB74IKRDXJXXHC6R","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T05:49:00Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"413b03b40e6365aef6c28534fbd367d621a576a760538841611bc24bfbec98e1","abstract_canon_sha256":"585da34ff10fe89ee0c01da9618741ce5af5bb344c2ab440103ee9b6804e4db1"},"schema_version":"1.0"},"canonical_sha256":"dac81c0dc7322c1ff10a88ee9bdce2f478efd9fa13801ad62aba35ed32350e4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:10.956969Z","signature_b64":"+9prGjiq7JQKfoDWQOiw4qwhByD8TsnTjT2oAJGT9/4eA6Kbzt20MUJQPdV/TfZXg8j8mJeNohgtEe0pfj1BCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dac81c0dc7322c1ff10a88ee9bdce2f478efd9fa13801ad62aba35ed32350e4b","last_reissued_at":"2026-05-18T01:14:10.956250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:10.956250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06900","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-18T01:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFrvKN4yIu4GPOW933aX/hfaxXtZo3AJJ6YDZz9GjAdHTfzLKdDGg+R5zi3shY0EPZ0ovJFn7kedFkq1LgyGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:28:38.542653Z"},"content_sha256":"96a3ce9650a1658702ff1c635833f55910e0ff4c86491a2f98860f14f4a50d84","schema_version":"1.0","event_id":"sha256:96a3ce9650a1658702ff1c635833f55910e0ff4c86491a2f98860f14f4a50d84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3LEBYDOHGIWB74IKRDXJXXHC6R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Stochastic Methods for Nonsmooth Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Alex Smola, Barnabas Poczos, Sashank J. Reddi, Suvrit Sra","submitted_at":"2016-05-23T05:49:00Z","abstract_excerpt":"We analyze stochastic algorithms for optimizing nonconvex, nonsmooth finite-sum problems, where the nonconvex part is smooth and the nonsmooth part is convex. Surprisingly, unlike the smooth case, our knowledge of this fundamental problem is very limited. For example, it is not known whether the proximal stochastic gradient method with constant minibatch converges to a stationary point. To tackle this issue, we develop fast stochastic algorithms that provably converge to a stationary point for constant minibatches. Furthermore, using a variant of these algorithms, we show provably faster conve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06900","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-18T01:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmuMhnqcNTOx8gyMs2bj5tm2BYJQzMPuzjt6Qzm3q6dWlfNqAybzhamdEegfjP7JD/OZKRDIjBxMmgPYxOCDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:28:38.543055Z"},"content_sha256":"ea2787ccf5d2ba4375678fd4afce756714b6c64b81b885a629f5e62122a9509d","schema_version":"1.0","event_id":"sha256:ea2787ccf5d2ba4375678fd4afce756714b6c64b81b885a629f5e62122a9509d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LEBYDOHGIWB74IKRDXJXXHC6R/bundle.json","state_url":"https://pith.science/pith/3LEBYDOHGIWB74IKRDXJXXHC6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LEBYDOHGIWB74IKRDXJXXHC6R/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-26T02:28:38Z","links":{"resolver":"https://pith.science/pith/3LEBYDOHGIWB74IKRDXJXXHC6R","bundle":"https://pith.science/pith/3LEBYDOHGIWB74IKRDXJXXHC6R/bundle.json","state":"https://pith.science/pith/3LEBYDOHGIWB74IKRDXJXXHC6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LEBYDOHGIWB74IKRDXJXXHC6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3LEBYDOHGIWB74IKRDXJXXHC6R","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":"585da34ff10fe89ee0c01da9618741ce5af5bb344c2ab440103ee9b6804e4db1","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T05:49:00Z","title_canon_sha256":"413b03b40e6365aef6c28534fbd367d621a576a760538841611bc24bfbec98e1"},"schema_version":"1.0","source":{"id":"1605.06900","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06900","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06900v1","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06900","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"3LEBYDOHGIWB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3LEBYDOHGIWB74IK","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3LEBYDOH","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:ea2787ccf5d2ba4375678fd4afce756714b6c64b81b885a629f5e62122a9509d","target":"graph","created_at":"2026-05-18T01:14:10Z","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 analyze stochastic algorithms for optimizing nonconvex, nonsmooth finite-sum problems, where the nonconvex part is smooth and the nonsmooth part is convex. Surprisingly, unlike the smooth case, our knowledge of this fundamental problem is very limited. For example, it is not known whether the proximal stochastic gradient method with constant minibatch converges to a stationary point. To tackle this issue, we develop fast stochastic algorithms that provably converge to a stationary point for constant minibatches. Furthermore, using a variant of these algorithms, we show provably faster conve","authors_text":"Alex Smola, Barnabas Poczos, Sashank J. Reddi, Suvrit Sra","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T05:49:00Z","title":"Fast Stochastic Methods for Nonsmooth Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06900","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:96a3ce9650a1658702ff1c635833f55910e0ff4c86491a2f98860f14f4a50d84","target":"record","created_at":"2026-05-18T01:14:10Z","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":"585da34ff10fe89ee0c01da9618741ce5af5bb344c2ab440103ee9b6804e4db1","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T05:49:00Z","title_canon_sha256":"413b03b40e6365aef6c28534fbd367d621a576a760538841611bc24bfbec98e1"},"schema_version":"1.0","source":{"id":"1605.06900","kind":"arxiv","version":1}},"canonical_sha256":"dac81c0dc7322c1ff10a88ee9bdce2f478efd9fa13801ad62aba35ed32350e4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dac81c0dc7322c1ff10a88ee9bdce2f478efd9fa13801ad62aba35ed32350e4b","first_computed_at":"2026-05-18T01:14:10.956250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:10.956250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+9prGjiq7JQKfoDWQOiw4qwhByD8TsnTjT2oAJGT9/4eA6Kbzt20MUJQPdV/TfZXg8j8mJeNohgtEe0pfj1BCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:10.956969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06900","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96a3ce9650a1658702ff1c635833f55910e0ff4c86491a2f98860f14f4a50d84","sha256:ea2787ccf5d2ba4375678fd4afce756714b6c64b81b885a629f5e62122a9509d"],"state_sha256":"c28f376ea929624e49cdb9df965980cef409a1a25983eaf7073c7c68a63b7398"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5yUjGDpBH74jYssHCACDuqAkcB+FjONUQt5+JR1PevFn0BnBhr05qqj46Sn5uEomuuhx5IC8GBEDfdVw1wCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:28:38.545731Z","bundle_sha256":"da6add495bf61e2896d119d38e2cb48d52bd8f53b0d7df219d1f5b940db30752"}}