{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q5HCDPE23RILUBV5DJD33EWUFO","short_pith_number":"pith:Q5HCDPE2","canonical_record":{"source":{"id":"1805.05411","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-14T20:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"831ecf70d50fa3b5cda6e1ad856972f090279f3d349f355927b60ab60ff16acd","abstract_canon_sha256":"07367956142728b85d2263a119823e7a9def2b7cb55e41a84c777d92bd6eab58"},"schema_version":"1.0"},"canonical_sha256":"874e21bc9adc50ba06bd1a47bd92d42b992cc44a492e6caa37df129bf5428332","source":{"kind":"arxiv","id":"1805.05411","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05411","created_at":"2026-07-04T23:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05411v5","created_at":"2026-07-04T23:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05411","created_at":"2026-07-04T23:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"Q5HCDPE23RIL","created_at":"2026-07-04T23:58:03Z"},{"alias_kind":"pith_short_16","alias_value":"Q5HCDPE23RILUBV5","created_at":"2026-07-04T23:58:03Z"},{"alias_kind":"pith_short_8","alias_value":"Q5HCDPE2","created_at":"2026-07-04T23:58:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q5HCDPE23RILUBV5DJD33EWUFO","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05411","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-14T20:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"831ecf70d50fa3b5cda6e1ad856972f090279f3d349f355927b60ab60ff16acd","abstract_canon_sha256":"07367956142728b85d2263a119823e7a9def2b7cb55e41a84c777d92bd6eab58"},"schema_version":"1.0"},"canonical_sha256":"874e21bc9adc50ba06bd1a47bd92d42b992cc44a492e6caa37df129bf5428332","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:03.481445Z","signature_b64":"um2sD3N5bZn8DCEAfSVjbddSRJ48J19DAMX0T4hT9zAM9291RejQ52DLkHe1xpS55OqSGgtulHasKloocZRwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"874e21bc9adc50ba06bd1a47bd92d42b992cc44a492e6caa37df129bf5428332","last_reissued_at":"2026-07-04T23:58:03.480950Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:03.480950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05411","source_version":5,"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-07-04T23:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgxcAI0/hrZwaGBiReraefj/1fCHEkOxqC9QGgaIV+popppsBUw17eLNohO3I6GBvGB5xLjQvrIG08h9rJGmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T07:01:41.223578Z"},"content_sha256":"84cb90394000b4660abe667fa4f370122c24c849cd3d08e67c159c7134391b73","schema_version":"1.0","event_id":"sha256:84cb90394000b4660abe667fa4f370122c24c849cd3d08e67c159c7134391b73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q5HCDPE23RILUBV5DJD33EWUFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Stochastic Algorithms for Nonconvex Finite-sum and Multi-block Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guanghui Lan, Yu Yang","submitted_at":"2018-05-14T20:06:58Z","abstract_excerpt":"In this paper, we present new stochastic methods for solving two important classes of nonconvex optimization problems. We first introduce a randomized accelerated proximal gradient (RapGrad) method for solving a class of nonconvex optimization problems consisting of the sum of $m$ component functions, and show that it can significantly reduce the number of gradient computations especially when the condition number $L/\\mu$ (i.e., the ratio between the Lipschitz constant and negative curvature) is large. More specifically, RapGrad can save up to ${\\cal O}(\\sqrt{m})$ gradient computations than ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05411","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.05411/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgpu8tiv4r6GwLBAly0lj9FSXjoWQEGv6PxkzAGPJd6ymgTRZ5iqGAaQ0rzwRTnl2OtUkwreFGoLElGPD44iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T07:01:41.224176Z"},"content_sha256":"57b25dce5c4725979434c349378e6d5b64d1c591d206f02cc76079c5c3cdfdbb","schema_version":"1.0","event_id":"sha256:57b25dce5c4725979434c349378e6d5b64d1c591d206f02cc76079c5c3cdfdbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5HCDPE23RILUBV5DJD33EWUFO/bundle.json","state_url":"https://pith.science/pith/Q5HCDPE23RILUBV5DJD33EWUFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5HCDPE23RILUBV5DJD33EWUFO/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-08-15T07:01:41Z","links":{"resolver":"https://pith.science/pith/Q5HCDPE23RILUBV5DJD33EWUFO","bundle":"https://pith.science/pith/Q5HCDPE23RILUBV5DJD33EWUFO/bundle.json","state":"https://pith.science/pith/Q5HCDPE23RILUBV5DJD33EWUFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5HCDPE23RILUBV5DJD33EWUFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q5HCDPE23RILUBV5DJD33EWUFO","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":"07367956142728b85d2263a119823e7a9def2b7cb55e41a84c777d92bd6eab58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-14T20:06:58Z","title_canon_sha256":"831ecf70d50fa3b5cda6e1ad856972f090279f3d349f355927b60ab60ff16acd"},"schema_version":"1.0","source":{"id":"1805.05411","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05411","created_at":"2026-07-04T23:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05411v5","created_at":"2026-07-04T23:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05411","created_at":"2026-07-04T23:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"Q5HCDPE23RIL","created_at":"2026-07-04T23:58:03Z"},{"alias_kind":"pith_short_16","alias_value":"Q5HCDPE23RILUBV5","created_at":"2026-07-04T23:58:03Z"},{"alias_kind":"pith_short_8","alias_value":"Q5HCDPE2","created_at":"2026-07-04T23:58:03Z"}],"graph_snapshots":[{"event_id":"sha256:57b25dce5c4725979434c349378e6d5b64d1c591d206f02cc76079c5c3cdfdbb","target":"graph","created_at":"2026-07-04T23:58:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1805.05411/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present new stochastic methods for solving two important classes of nonconvex optimization problems. We first introduce a randomized accelerated proximal gradient (RapGrad) method for solving a class of nonconvex optimization problems consisting of the sum of $m$ component functions, and show that it can significantly reduce the number of gradient computations especially when the condition number $L/\\mu$ (i.e., the ratio between the Lipschitz constant and negative curvature) is large. More specifically, RapGrad can save up to ${\\cal O}(\\sqrt{m})$ gradient computations than ex","authors_text":"Guanghui Lan, Yu Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-14T20:06:58Z","title":"Accelerated Stochastic Algorithms for Nonconvex Finite-sum and Multi-block Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05411","kind":"arxiv","version":5},"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:84cb90394000b4660abe667fa4f370122c24c849cd3d08e67c159c7134391b73","target":"record","created_at":"2026-07-04T23:58:03Z","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":"07367956142728b85d2263a119823e7a9def2b7cb55e41a84c777d92bd6eab58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-14T20:06:58Z","title_canon_sha256":"831ecf70d50fa3b5cda6e1ad856972f090279f3d349f355927b60ab60ff16acd"},"schema_version":"1.0","source":{"id":"1805.05411","kind":"arxiv","version":5}},"canonical_sha256":"874e21bc9adc50ba06bd1a47bd92d42b992cc44a492e6caa37df129bf5428332","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"874e21bc9adc50ba06bd1a47bd92d42b992cc44a492e6caa37df129bf5428332","first_computed_at":"2026-07-04T23:58:03.480950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:03.480950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"um2sD3N5bZn8DCEAfSVjbddSRJ48J19DAMX0T4hT9zAM9291RejQ52DLkHe1xpS55OqSGgtulHasKloocZRwAg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:03.481445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05411","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84cb90394000b4660abe667fa4f370122c24c849cd3d08e67c159c7134391b73","sha256:57b25dce5c4725979434c349378e6d5b64d1c591d206f02cc76079c5c3cdfdbb"],"state_sha256":"bb5f866a6c36a11337d280b304970bf9d5308787f583e62c7c14690e23782052"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aEY/0v6AgLZ2CeY0jey+eCYkAf+QvjGoiuet0FpD/L8xGGkaWcTj2v6IeEuVbMixj3udKaXkICVQCgvWlFFYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T07:01:41.227988Z","bundle_sha256":"f5cc7566021026453149b6c17e46147a0a40b5c91857b771098412f1396c70a1"}}