{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YFKR6OE73SQAKMLGCC63R6HLS4","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":"6e8dc8e4c525445b961faaca1fb22f3bc15d36333d93a92687585eee095a7668","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-13T15:34:17Z","title_canon_sha256":"de8746af0ea8106b085018a3784d5a1436754c2a47bb574b98fb623e706a1a0a"},"schema_version":"1.0","source":{"id":"2511.10414","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.10414","created_at":"2026-06-08T01:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"2511.10414v2","created_at":"2026-06-08T01:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.10414","created_at":"2026-06-08T01:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"YFKR6OE73SQA","created_at":"2026-06-08T01:05:04Z"},{"alias_kind":"pith_short_16","alias_value":"YFKR6OE73SQAKMLG","created_at":"2026-06-08T01:05:04Z"},{"alias_kind":"pith_short_8","alias_value":"YFKR6OE7","created_at":"2026-06-08T01:05:04Z"}],"graph_snapshots":[{"event_id":"sha256:40876132b5d9f771695179645453d3b5f83dfc786d5d2783be003bedb01d120b","target":"graph","created_at":"2026-06-08T01:05:04Z","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/2511.10414/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a generalized descent algorithm (DEAL) for minimizing smooth nonconvex functions. If the objective function is nonsmooth, a smoothing technique (e.g., forward-backward and high-order Moreau envelopes) is applied to generate a smooth counterpart. The proposed framework unifies several methods, such as gradient-based methods with constant step-sizes and Armijo line search, and several proximal splitting methods. The method is built around a generalized descent inequality that adapts the amount of decrease to the geometry of the objective function. Under the Kurdyka-{\\L}ojas","authors_text":"Alireza Kabgani, Masoud Ahookhosh, Morteza Rahimi, Susan Ghaderi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-13T15:34:17Z","title":"Minimizing Smooth Kurdyka-{\\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.10414","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:778c8a2b060c3041a708701551b339f5d5554559b0ab5de5bd800ea1761c8592","target":"record","created_at":"2026-06-08T01:05:04Z","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":"6e8dc8e4c525445b961faaca1fb22f3bc15d36333d93a92687585eee095a7668","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-13T15:34:17Z","title_canon_sha256":"de8746af0ea8106b085018a3784d5a1436754c2a47bb574b98fb623e706a1a0a"},"schema_version":"1.0","source":{"id":"2511.10414","kind":"arxiv","version":2}},"canonical_sha256":"c1551f389fdca005316610bdb8f8eb97148ba23e14cd1f2606dbbc2597c3a1da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1551f389fdca005316610bdb8f8eb97148ba23e14cd1f2606dbbc2597c3a1da","first_computed_at":"2026-06-08T01:05:04.282004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:05:04.282004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s02Dei+0+CvbrVA8RADDuxmMYCwInGe4llfTyAn1iYoeGaylX6RaHt3EI1jjW4ykIbRWpdrjkxjU/I7mql44AQ==","signature_status":"signed_v1","signed_at":"2026-06-08T01:05:04.283187Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.10414","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:778c8a2b060c3041a708701551b339f5d5554559b0ab5de5bd800ea1761c8592","sha256:40876132b5d9f771695179645453d3b5f83dfc786d5d2783be003bedb01d120b"],"state_sha256":"31c62bb8a5b8753ee563fa555db6ae83727b1c656c87c433c04d298c4ffc3437"}