{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WKA57EZJTLMD72RZHVH35D4QL6","short_pith_number":"pith:WKA57EZJ","canonical_record":{"source":{"id":"1901.11224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T06:16:45Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"deed7ed28a5c7f8db142380042079f54d6a8e7af0ee498a1a8023cc7f7d6a0b7","abstract_canon_sha256":"d0d1d50295920cd1a12b713e1eb4a03990345235c136910fdd935800049145ca"},"schema_version":"1.0"},"canonical_sha256":"b281df93299ad83fea393d4fbe8f905f8252207a9ee8777647798c2b15291bd9","source":{"kind":"arxiv","id":"1901.11224","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.11224","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.11224v1","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11224","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"pith_short_12","alias_value":"WKA57EZJTLMD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WKA57EZJTLMD72RZ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WKA57EZJ","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WKA57EZJTLMD72RZHVH35D4QL6","target":"record","payload":{"canonical_record":{"source":{"id":"1901.11224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T06:16:45Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"deed7ed28a5c7f8db142380042079f54d6a8e7af0ee498a1a8023cc7f7d6a0b7","abstract_canon_sha256":"d0d1d50295920cd1a12b713e1eb4a03990345235c136910fdd935800049145ca"},"schema_version":"1.0"},"canonical_sha256":"b281df93299ad83fea393d4fbe8f905f8252207a9ee8777647798c2b15291bd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:02.394963Z","signature_b64":"QYpupLvSWebiI3Lnhj6I8gXJHOfG0kk0LBbapXfwFLrGJX05/OKS90k7jRs5TAbAgeA8i6LzWVugggkSE163CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b281df93299ad83fea393d4fbe8f905f8252207a9ee8777647798c2b15291bd9","last_reissued_at":"2026-05-17T23:55:02.394357Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:02.394357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.11224","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:55:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3c5gU51DGOYj0BrZyAI1RYmHa3ZmTOK64pETGlzuduAHuHjfYt8ydXQc47LnDyQxt7X92nW5ydzKPhfh3jXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:43:51.999755Z"},"content_sha256":"a0b4be44ee82ca1bb6ee20bbfdca5a7baa3789b1b902a4ac276ff1703e183e2c","schema_version":"1.0","event_id":"sha256:a0b4be44ee82ca1bb6ee20bbfdca5a7baa3789b1b902a4ac276ff1703e183e2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WKA57EZJTLMD72RZHVH35D4QL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Smooth Nonconvex Finite-Sum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Dongruo Zhou, Quanquan Gu","submitted_at":"2019-01-31T06:16:45Z","abstract_excerpt":"Smooth finite-sum optimization has been widely studied in both convex and nonconvex settings. However, existing lower bounds for finite-sum optimization are mostly limited to the setting where each component function is (strongly) convex, while the lower bounds for nonconvex finite-sum optimization remain largely unsolved. In this paper, we study the lower bounds for smooth nonconvex finite-sum optimization, where the objective function is the average of $n$ nonconvex component functions. We prove tight lower bounds for the complexity of finding $\\epsilon$-suboptimal point and $\\epsilon$-appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11224","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:55:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jTmWJY7+PLZUX4dfuTgezhTzdLLxpCGmXVa2bMzfFKZzoDGITZH/sRI2d6knTuvb74C6UfFyDwU43T8+2GqaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:43:52.000301Z"},"content_sha256":"28571c504b9adf069b478f7654e14248f1097c34142671b6fda2f9eec91622fb","schema_version":"1.0","event_id":"sha256:28571c504b9adf069b478f7654e14248f1097c34142671b6fda2f9eec91622fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKA57EZJTLMD72RZHVH35D4QL6/bundle.json","state_url":"https://pith.science/pith/WKA57EZJTLMD72RZHVH35D4QL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKA57EZJTLMD72RZHVH35D4QL6/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-07-02T06:43:52Z","links":{"resolver":"https://pith.science/pith/WKA57EZJTLMD72RZHVH35D4QL6","bundle":"https://pith.science/pith/WKA57EZJTLMD72RZHVH35D4QL6/bundle.json","state":"https://pith.science/pith/WKA57EZJTLMD72RZHVH35D4QL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKA57EZJTLMD72RZHVH35D4QL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WKA57EZJTLMD72RZHVH35D4QL6","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":"d0d1d50295920cd1a12b713e1eb4a03990345235c136910fdd935800049145ca","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T06:16:45Z","title_canon_sha256":"deed7ed28a5c7f8db142380042079f54d6a8e7af0ee498a1a8023cc7f7d6a0b7"},"schema_version":"1.0","source":{"id":"1901.11224","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.11224","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.11224v1","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11224","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"pith_short_12","alias_value":"WKA57EZJTLMD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WKA57EZJTLMD72RZ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WKA57EZJ","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:28571c504b9adf069b478f7654e14248f1097c34142671b6fda2f9eec91622fb","target":"graph","created_at":"2026-05-17T23:55:02Z","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":"Smooth finite-sum optimization has been widely studied in both convex and nonconvex settings. However, existing lower bounds for finite-sum optimization are mostly limited to the setting where each component function is (strongly) convex, while the lower bounds for nonconvex finite-sum optimization remain largely unsolved. In this paper, we study the lower bounds for smooth nonconvex finite-sum optimization, where the objective function is the average of $n$ nonconvex component functions. We prove tight lower bounds for the complexity of finding $\\epsilon$-suboptimal point and $\\epsilon$-appro","authors_text":"Dongruo Zhou, Quanquan Gu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T06:16:45Z","title":"Lower Bounds for Smooth Nonconvex Finite-Sum Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11224","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:a0b4be44ee82ca1bb6ee20bbfdca5a7baa3789b1b902a4ac276ff1703e183e2c","target":"record","created_at":"2026-05-17T23:55:02Z","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":"d0d1d50295920cd1a12b713e1eb4a03990345235c136910fdd935800049145ca","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T06:16:45Z","title_canon_sha256":"deed7ed28a5c7f8db142380042079f54d6a8e7af0ee498a1a8023cc7f7d6a0b7"},"schema_version":"1.0","source":{"id":"1901.11224","kind":"arxiv","version":1}},"canonical_sha256":"b281df93299ad83fea393d4fbe8f905f8252207a9ee8777647798c2b15291bd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b281df93299ad83fea393d4fbe8f905f8252207a9ee8777647798c2b15291bd9","first_computed_at":"2026-05-17T23:55:02.394357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:02.394357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QYpupLvSWebiI3Lnhj6I8gXJHOfG0kk0LBbapXfwFLrGJX05/OKS90k7jRs5TAbAgeA8i6LzWVugggkSE163CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:02.394963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.11224","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0b4be44ee82ca1bb6ee20bbfdca5a7baa3789b1b902a4ac276ff1703e183e2c","sha256:28571c504b9adf069b478f7654e14248f1097c34142671b6fda2f9eec91622fb"],"state_sha256":"c5f0041273adb7679dcbecf42ec6cf38085af67c8e29227d02767154e40bfc23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhixCOtG9y38YtIiy7bj3hNQo/TqK6GtiJxuAFvDBsl57wKmsrYr/yQDU5QBqpQ0u8mAbmpl1Qdhit+XE0lfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T06:43:52.002699Z","bundle_sha256":"c35296d96c026b59df26203fae168554dea9055453ac11a04eb727e41271e7be"}}