{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EOYKSMD3FHG3VFSHZJEVXVM63K","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":"36993929ca9a6c350cb49939bf502cf599cf51a5e8952f0edcb50aab7bd50de4","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-17T21:25:31Z","title_canon_sha256":"958c3a502a68d950643ec7c555a39e5afc4e3acc99ff50ac7f05e173462431b5"},"schema_version":"1.0","source":{"id":"2502.12329","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.12329","created_at":"2026-07-05T10:15:53Z"},{"alias_kind":"arxiv_version","alias_value":"2502.12329v1","created_at":"2026-07-05T10:15:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12329","created_at":"2026-07-05T10:15:53Z"},{"alias_kind":"pith_short_12","alias_value":"EOYKSMD3FHG3","created_at":"2026-07-05T10:15:53Z"},{"alias_kind":"pith_short_16","alias_value":"EOYKSMD3FHG3VFSH","created_at":"2026-07-05T10:15:53Z"},{"alias_kind":"pith_short_8","alias_value":"EOYKSMD3","created_at":"2026-07-05T10:15:53Z"}],"graph_snapshots":[{"event_id":"sha256:55274056a4f4bcd8badd9e6131cd92869c046331f8031475c98bbc9f6170d56c","target":"graph","created_at":"2026-07-05T10:15:53Z","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/2502.12329/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Nonconvex optimization is central to modern machine learning, but the general framework of nonconvex optimization yields weak convergence guarantees that are too pessimistic compared to practice. On the other hand, while convexity enables efficient optimization, it is of limited applicability to many practical problems. To bridge this gap and better understand the practical success of optimization algorithms in nonconvex settings, we introduce a novel unified parametric assumption. Our assumption is general enough to encompass a broad class of nonconvex functions while also being specific enou","authors_text":"Ahmed Khaled, Artem Riabinin, Peter Richt\\'arik","cross_cats":["cs.AI","math.OC","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-17T21:25:31Z","title":"A Novel Unified Parametric Assumption for Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12329","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:7eab86cc80bc1b2f8b668e7af623863827388baed5ca730c4a2224c85b919bb3","target":"record","created_at":"2026-07-05T10:15:53Z","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":"36993929ca9a6c350cb49939bf502cf599cf51a5e8952f0edcb50aab7bd50de4","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-17T21:25:31Z","title_canon_sha256":"958c3a502a68d950643ec7c555a39e5afc4e3acc99ff50ac7f05e173462431b5"},"schema_version":"1.0","source":{"id":"2502.12329","kind":"arxiv","version":1}},"canonical_sha256":"23b0a9307b29cdba9647ca495bd59eda9c218fbbaf32ec6d3eb8427e16f3f30d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23b0a9307b29cdba9647ca495bd59eda9c218fbbaf32ec6d3eb8427e16f3f30d","first_computed_at":"2026-07-05T10:15:53.716060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:15:53.716060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"30ys9BMaR9SMmJQGdOEAlVFbiRSlyM8L4sAkRuLkJM65Fk/qDP1WWbGzJYMBvQ3DCE40tBAXa3tgFP8cXs8TAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:15:53.717300Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.12329","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7eab86cc80bc1b2f8b668e7af623863827388baed5ca730c4a2224c85b919bb3","sha256:55274056a4f4bcd8badd9e6131cd92869c046331f8031475c98bbc9f6170d56c"],"state_sha256":"965ce93b4975e9459cfb248e105f9cd6bda1f1a2fba2f76f0b6d93013ba536a4"}