{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OEU2TEKCGHBKQF3F5AJ4KTWBXD","short_pith_number":"pith:OEU2TEKC","canonical_record":{"source":{"id":"1908.08394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-22T14:02:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"f7b981f2754e3ce870c0e404f040716dad418839401d11fb892098aed5f3e31b","abstract_canon_sha256":"fea594aa85bf55f54bc7132bb0067763708569ae96765ced5858ea677e3d0c9e"},"schema_version":"1.0"},"canonical_sha256":"7129a9914231c2a81765e813c54ec1b8e76f3c553fccc86c0fc6783200454b82","source":{"kind":"arxiv","id":"1908.08394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08394","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08394v1","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08394","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"OEU2TEKCGHBK","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_16","alias_value":"OEU2TEKCGHBKQF3F","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_8","alias_value":"OEU2TEKC","created_at":"2026-07-04T23:59:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OEU2TEKCGHBKQF3F5AJ4KTWBXD","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-22T14:02:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"f7b981f2754e3ce870c0e404f040716dad418839401d11fb892098aed5f3e31b","abstract_canon_sha256":"fea594aa85bf55f54bc7132bb0067763708569ae96765ced5858ea677e3d0c9e"},"schema_version":"1.0"},"canonical_sha256":"7129a9914231c2a81765e813c54ec1b8e76f3c553fccc86c0fc6783200454b82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:12.474601Z","signature_b64":"rNHjQKOnUa/rEhEuXqF2Jnul+3t/SvJQ7wFstjbeUSv9QllNDn/ybzRV4aUfsFB9aQdKyAiDWST34vEHW8MHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7129a9914231c2a81765e813c54ec1b8e76f3c553fccc86c0fc6783200454b82","last_reissued_at":"2026-07-04T23:59:12.474212Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:12.474212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08394","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-07-04T23:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gXlQxM2deWXIxX+Nk8kV8vdNqZLLpMpdnJ3wPXuA652aPGxR8xjkR3/SPhfb0B27v3nxMAcIkuQvFz84zO27BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:39:22.448177Z"},"content_sha256":"6314a9ee4025bf8b50408ded8c2073dfbc1777a9a1c22f5a5a85017776cedde3","schema_version":"1.0","event_id":"sha256:6314a9ee4025bf8b50408ded8c2073dfbc1777a9a1c22f5a5a85017776cedde3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OEU2TEKCGHBKQF3F5AJ4KTWBXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Analysis Framework of Lower Complexity Bounds for 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":"Guangzeng Xie, Luo Luo, Zhihua Zhang","submitted_at":"2019-08-22T14:02:46Z","abstract_excerpt":"This paper studies the lower bound complexity for the optimization problem whose objective function is the average of $n$ individual smooth convex functions. We consider the algorithm which gets access to gradient and proximal oracle for each individual component. For the strongly-convex case, we prove such an algorithm can not reach an $\\varepsilon$-suboptimal point in fewer than $\\Omega((n+\\sqrt{\\kappa n})\\log(1/\\varepsilon))$ iterations, where $\\kappa$ is the condition number of the objective function. This lower bound is tighter than previous results and perfectly matches the upper bound o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08394","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08394/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:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GJmeNOcG4Qssre/X3/aSdYAjXR6pUn3QlyHNAMvwmwXe8qPYYVn/HCgkotVZvUbtXRRnuhCFMMHVpxKQC6wlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:39:22.449096Z"},"content_sha256":"2da297694df82aeb545d37066c464ab535c5466f781bd356e638a2cacc1705d6","schema_version":"1.0","event_id":"sha256:2da297694df82aeb545d37066c464ab535c5466f781bd356e638a2cacc1705d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD/bundle.json","state_url":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD/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-16T19:39:22Z","links":{"resolver":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD","bundle":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD/bundle.json","state":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OEU2TEKCGHBKQF3F5AJ4KTWBXD","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":"fea594aa85bf55f54bc7132bb0067763708569ae96765ced5858ea677e3d0c9e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-22T14:02:46Z","title_canon_sha256":"f7b981f2754e3ce870c0e404f040716dad418839401d11fb892098aed5f3e31b"},"schema_version":"1.0","source":{"id":"1908.08394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08394","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08394v1","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08394","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"OEU2TEKCGHBK","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_16","alias_value":"OEU2TEKCGHBKQF3F","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_8","alias_value":"OEU2TEKC","created_at":"2026-07-04T23:59:12Z"}],"graph_snapshots":[{"event_id":"sha256:2da297694df82aeb545d37066c464ab535c5466f781bd356e638a2cacc1705d6","target":"graph","created_at":"2026-07-04T23:59:12Z","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/1908.08394/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the lower bound complexity for the optimization problem whose objective function is the average of $n$ individual smooth convex functions. We consider the algorithm which gets access to gradient and proximal oracle for each individual component. For the strongly-convex case, we prove such an algorithm can not reach an $\\varepsilon$-suboptimal point in fewer than $\\Omega((n+\\sqrt{\\kappa n})\\log(1/\\varepsilon))$ iterations, where $\\kappa$ is the condition number of the objective function. This lower bound is tighter than previous results and perfectly matches the upper bound o","authors_text":"Guangzeng Xie, Luo Luo, Zhihua Zhang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-22T14:02:46Z","title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08394","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:6314a9ee4025bf8b50408ded8c2073dfbc1777a9a1c22f5a5a85017776cedde3","target":"record","created_at":"2026-07-04T23:59:12Z","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":"fea594aa85bf55f54bc7132bb0067763708569ae96765ced5858ea677e3d0c9e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-22T14:02:46Z","title_canon_sha256":"f7b981f2754e3ce870c0e404f040716dad418839401d11fb892098aed5f3e31b"},"schema_version":"1.0","source":{"id":"1908.08394","kind":"arxiv","version":1}},"canonical_sha256":"7129a9914231c2a81765e813c54ec1b8e76f3c553fccc86c0fc6783200454b82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7129a9914231c2a81765e813c54ec1b8e76f3c553fccc86c0fc6783200454b82","first_computed_at":"2026-07-04T23:59:12.474212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:12.474212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rNHjQKOnUa/rEhEuXqF2Jnul+3t/SvJQ7wFstjbeUSv9QllNDn/ybzRV4aUfsFB9aQdKyAiDWST34vEHW8MHCw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:12.474601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6314a9ee4025bf8b50408ded8c2073dfbc1777a9a1c22f5a5a85017776cedde3","sha256:2da297694df82aeb545d37066c464ab535c5466f781bd356e638a2cacc1705d6"],"state_sha256":"cff6633fa274f82eb36dcc4182734b57180e0543b2434fa586b29db0878c724a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5wfcVC4W85Rj1oquTAkQwVxIqatEjQUcRhXtkOjUcazCCWD2gGUkuhhk7l3kGcXJpnmqhOve3YgZ1FZy9e0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T19:39:22.455398Z","bundle_sha256":"9eba52418c8ca001d98c9cd4c8f99cc75cf5c1508f56060d64fe09f7c712e755"}}