{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YFKR6OE73SQAKMLGCC63R6HLS4","short_pith_number":"pith:YFKR6OE7","schema_version":"1.0","canonical_sha256":"c1551f389fdca005316610bdb8f8eb97148ba23e14cd1f2606dbbc2597c3a1da","source":{"kind":"arxiv","id":"2511.10414","version":2},"attestation_state":"computed","paper":{"title":"Minimizing Smooth Kurdyka-{\\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alireza Kabgani, Masoud Ahookhosh, Morteza Rahimi, Susan Ghaderi","submitted_at":"2025-11-13T15:34:17Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2511.10414","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-13T15:34:17Z","cross_cats_sorted":[],"title_canon_sha256":"de8746af0ea8106b085018a3784d5a1436754c2a47bb574b98fb623e706a1a0a","abstract_canon_sha256":"6e8dc8e4c525445b961faaca1fb22f3bc15d36333d93a92687585eee095a7668"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:04.283187Z","signature_b64":"s02Dei+0+CvbrVA8RADDuxmMYCwInGe4llfTyAn1iYoeGaylX6RaHt3EI1jjW4ykIbRWpdrjkxjU/I7mql44AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1551f389fdca005316610bdb8f8eb97148ba23e14cd1f2606dbbc2597c3a1da","last_reissued_at":"2026-06-08T01:05:04.282004Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:04.282004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing Smooth Kurdyka-{\\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alireza Kabgani, Masoud Ahookhosh, Morteza Rahimi, Susan Ghaderi","submitted_at":"2025-11-13T15:34:17Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.10414","kind":"arxiv","version":2},"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/2511.10414/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2511.10414","created_at":"2026-06-08T01:05:04.282147+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.10414v2","created_at":"2026-06-08T01:05:04.282147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.10414","created_at":"2026-06-08T01:05:04.282147+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFKR6OE73SQA","created_at":"2026-06-08T01:05:04.282147+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFKR6OE73SQAKMLG","created_at":"2026-06-08T01:05:04.282147+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFKR6OE7","created_at":"2026-06-08T01:05:04.282147+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YFKR6OE73SQAKMLGCC63R6HLS4","json":"https://pith.science/pith/YFKR6OE73SQAKMLGCC63R6HLS4.json","graph_json":"https://pith.science/api/pith-number/YFKR6OE73SQAKMLGCC63R6HLS4/graph.json","events_json":"https://pith.science/api/pith-number/YFKR6OE73SQAKMLGCC63R6HLS4/events.json","paper":"https://pith.science/paper/YFKR6OE7"},"agent_actions":{"view_html":"https://pith.science/pith/YFKR6OE73SQAKMLGCC63R6HLS4","download_json":"https://pith.science/pith/YFKR6OE73SQAKMLGCC63R6HLS4.json","view_paper":"https://pith.science/paper/YFKR6OE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.10414&json=true","fetch_graph":"https://pith.science/api/pith-number/YFKR6OE73SQAKMLGCC63R6HLS4/graph.json","fetch_events":"https://pith.science/api/pith-number/YFKR6OE73SQAKMLGCC63R6HLS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFKR6OE73SQAKMLGCC63R6HLS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFKR6OE73SQAKMLGCC63R6HLS4/action/storage_attestation","attest_author":"https://pith.science/pith/YFKR6OE73SQAKMLGCC63R6HLS4/action/author_attestation","sign_citation":"https://pith.science/pith/YFKR6OE73SQAKMLGCC63R6HLS4/action/citation_signature","submit_replication":"https://pith.science/pith/YFKR6OE73SQAKMLGCC63R6HLS4/action/replication_record"}},"created_at":"2026-06-08T01:05:04.282147+00:00","updated_at":"2026-06-08T01:05:04.282147+00:00"}