{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QHXBZFZ772AET5YU2L5GD5ZNED","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":"c654100ace82a5449848762753c7df291e183a083a3daf743d2d7ba50c841ad7","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-26T17:39:32Z","title_canon_sha256":"5362c379219230132124e9b7c6d9cdc8955f3c95b0b13f85cceb3b5410bf7af1"},"schema_version":"1.0","source":{"id":"1907.11687","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11687","created_at":"2026-07-05T05:27:58Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11687v2","created_at":"2026-07-05T05:27:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11687","created_at":"2026-07-05T05:27:58Z"},{"alias_kind":"pith_short_12","alias_value":"QHXBZFZ772AE","created_at":"2026-07-05T05:27:58Z"},{"alias_kind":"pith_short_16","alias_value":"QHXBZFZ772AET5YU","created_at":"2026-07-05T05:27:58Z"},{"alias_kind":"pith_short_8","alias_value":"QHXBZFZ7","created_at":"2026-07-05T05:27:58Z"}],"graph_snapshots":[{"event_id":"sha256:cb6657a2f01a150fec798daa49461232fcd2db68f389d6f12167cc7acc5b4282","target":"graph","created_at":"2026-07-05T05:27:58Z","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/1907.11687/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Incremental methods are widely utilized for solving finite-sum optimization problems in machine learning and signal processing. In this paper, we study a family of incremental methods -- including incremental subgradient, incremental proximal point, and incremental prox-linear methods -- for solving weakly convex optimization problems. Such a problem class covers many nonsmooth nonconvex instances that arise in engineering fields. We show that the three said incremental methods have an iteration complexity of $O(\\varepsilon^{-4})$ for driving a natural stationarity measure to below $\\varepsilo","authors_text":"Anthony Man-Cho So, Jason D Lee, Xiao Li, Zhihui Zhu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-26T17:39:32Z","title":"Incremental Methods for Weakly Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11687","kind":"arxiv","version":2},"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:dd36d265fef3d17c2c258171c4550fe309dc5f393e5a76331bc8afd94d2893c1","target":"record","created_at":"2026-07-05T05:27:58Z","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":"c654100ace82a5449848762753c7df291e183a083a3daf743d2d7ba50c841ad7","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-26T17:39:32Z","title_canon_sha256":"5362c379219230132124e9b7c6d9cdc8955f3c95b0b13f85cceb3b5410bf7af1"},"schema_version":"1.0","source":{"id":"1907.11687","kind":"arxiv","version":2}},"canonical_sha256":"81ee1c973ffe8049f714d2fa61f72d20edd613f05cb9db540abfb1fb56878497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81ee1c973ffe8049f714d2fa61f72d20edd613f05cb9db540abfb1fb56878497","first_computed_at":"2026-07-05T05:27:58.265018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:27:58.265018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NQle5qF9Qhu2Ix4ldhexe6jfRtqqCSZM9scFn/8cWEo2VzJZROextOXIqncHsqMkkycEZU/gcco0j0ivE4IUBg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:27:58.265432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11687","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd36d265fef3d17c2c258171c4550fe309dc5f393e5a76331bc8afd94d2893c1","sha256:cb6657a2f01a150fec798daa49461232fcd2db68f389d6f12167cc7acc5b4282"],"state_sha256":"3c05bfec635e907db378d5f6f806e3bbb0598cb00643b7a281baec790047c628"}