{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OQO3CPKLOOOEJZMGKFIXSWNO74","short_pith_number":"pith:OQO3CPKL","schema_version":"1.0","canonical_sha256":"741db13d4b739c44e58651517959aeff08965a3354c7478b0134cdc440015131","source":{"kind":"arxiv","id":"2506.22332","version":1},"attestation_state":"computed","paper":{"title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Bodard, Masoud Ahookhosh, Panagiotis Patrinos","submitted_at":"2025-06-27T15:40:03Z","abstract_excerpt":"This study introduces two second-order methods designed to provably avoid saddle points in composite nonconvex optimization problems: (i) a nonsmooth trust-region method and (ii) a curvilinear linesearch method. These developments are grounded in the forward-backward envelope (FBE), for which we analyze the local second-order differentiability around critical points and establish a novel equivalence between its second-order stationary points and those of the original objective. We show that the proposed algorithms converge to second-order stationary points of the FBE under a mild local smoothn"},"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":"2506.22332","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-27T15:40:03Z","cross_cats_sorted":[],"title_canon_sha256":"e490becc1b76e199cf98aba11dd3d9bcdb7b5f4991961f461d087730617b7127","abstract_canon_sha256":"2ca21988eebf9fed427ec2e673559f6aca98a0c3aca2fc08a10e474c09ca73d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:25.320440Z","signature_b64":"G3T7O7XmYEHuuT3p8NsYeNQPQgSKonfn/0lVjUcQ+y1w6msXLcTQcWcvQEhd4Dfg2+sMvMDt7U5F4ZnSXXQZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"741db13d4b739c44e58651517959aeff08965a3354c7478b0134cdc440015131","last_reissued_at":"2026-07-05T11:28:25.319772Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:25.319772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Bodard, Masoud Ahookhosh, Panagiotis Patrinos","submitted_at":"2025-06-27T15:40:03Z","abstract_excerpt":"This study introduces two second-order methods designed to provably avoid saddle points in composite nonconvex optimization problems: (i) a nonsmooth trust-region method and (ii) a curvilinear linesearch method. These developments are grounded in the forward-backward envelope (FBE), for which we analyze the local second-order differentiability around critical points and establish a novel equivalence between its second-order stationary points and those of the original objective. We show that the proposed algorithms converge to second-order stationary points of the FBE under a mild local smoothn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22332","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/2506.22332/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":"2506.22332","created_at":"2026-07-05T11:28:25.319832+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.22332v1","created_at":"2026-07-05T11:28:25.319832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22332","created_at":"2026-07-05T11:28:25.319832+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQO3CPKLOOOE","created_at":"2026-07-05T11:28:25.319832+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQO3CPKLOOOEJZMG","created_at":"2026-07-05T11:28:25.319832+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQO3CPKL","created_at":"2026-07-05T11:28:25.319832+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26735","citing_title":"Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08474","citing_title":"Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14503","citing_title":"PANOC-lite: A simpler and more efficient algorithm for composite minimization","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OQO3CPKLOOOEJZMGKFIXSWNO74","json":"https://pith.science/pith/OQO3CPKLOOOEJZMGKFIXSWNO74.json","graph_json":"https://pith.science/api/pith-number/OQO3CPKLOOOEJZMGKFIXSWNO74/graph.json","events_json":"https://pith.science/api/pith-number/OQO3CPKLOOOEJZMGKFIXSWNO74/events.json","paper":"https://pith.science/paper/OQO3CPKL"},"agent_actions":{"view_html":"https://pith.science/pith/OQO3CPKLOOOEJZMGKFIXSWNO74","download_json":"https://pith.science/pith/OQO3CPKLOOOEJZMGKFIXSWNO74.json","view_paper":"https://pith.science/paper/OQO3CPKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.22332&json=true","fetch_graph":"https://pith.science/api/pith-number/OQO3CPKLOOOEJZMGKFIXSWNO74/graph.json","fetch_events":"https://pith.science/api/pith-number/OQO3CPKLOOOEJZMGKFIXSWNO74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQO3CPKLOOOEJZMGKFIXSWNO74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQO3CPKLOOOEJZMGKFIXSWNO74/action/storage_attestation","attest_author":"https://pith.science/pith/OQO3CPKLOOOEJZMGKFIXSWNO74/action/author_attestation","sign_citation":"https://pith.science/pith/OQO3CPKLOOOEJZMGKFIXSWNO74/action/citation_signature","submit_replication":"https://pith.science/pith/OQO3CPKLOOOEJZMGKFIXSWNO74/action/replication_record"}},"created_at":"2026-07-05T11:28:25.319832+00:00","updated_at":"2026-07-05T11:28:25.319832+00:00"}