{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QGYI5LSIPWRJSCRMYTOVK2SMH5","short_pith_number":"pith:QGYI5LSI","schema_version":"1.0","canonical_sha256":"81b08eae487da2990a2cc4dd556a4c3f7e1b2ac12b477c82d31e30e720d9e65c","source":{"kind":"arxiv","id":"2508.16468","version":1},"attestation_state":"computed","paper":{"title":"LeAP-SSN: A Semismooth Newton Method with Global Convergence Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amal Alphonse, Clemens Sirotenko, Ioannis P.A. Papadopoulos, Pavel Dvurechensky","submitted_at":"2025-08-22T15:36:42Z","abstract_excerpt":"We propose LeAP-SSN (Levenberg--Marquardt Adaptive Proximal Semismooth Newton method), a semismooth Newton-type method with a simple, parameter-free globalisation strategy that guarantees convergence from arbitrary starting points in nonconvex settings to stationary points, and under a Polyak--Lojasiewicz condition, to a global minimum, in Hilbert spaces. The method employs an adaptive Levenberg--Marquardt regularisation for the Newton steps, combined with backtracking, and does not require knowledge of problem-specific constants. We establish global nonasymptotic rates: $\\mathcal{O}(1/k)$ for"},"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":"2508.16468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-22T15:36:42Z","cross_cats_sorted":[],"title_canon_sha256":"1437ff249f5aedc4d3faad5bda625e76257adc7eadc6abe3d81c4720c0491526","abstract_canon_sha256":"2f1afc7744fb4a59083fd07ef6f59f0edaa98efa5407374a0952546ac3ede683"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:49.094876Z","signature_b64":"bfAGVdpVLWd0c5DE1hQL/O3MkSCpfr0ZWT8G/QNykb99nHIQ7odSOS+5xItLQ+Cl+EwF2zLbp3L1p6+ObNiwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81b08eae487da2990a2cc4dd556a4c3f7e1b2ac12b477c82d31e30e720d9e65c","last_reissued_at":"2026-07-05T11:57:49.094425Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:49.094425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LeAP-SSN: A Semismooth Newton Method with Global Convergence Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amal Alphonse, Clemens Sirotenko, Ioannis P.A. Papadopoulos, Pavel Dvurechensky","submitted_at":"2025-08-22T15:36:42Z","abstract_excerpt":"We propose LeAP-SSN (Levenberg--Marquardt Adaptive Proximal Semismooth Newton method), a semismooth Newton-type method with a simple, parameter-free globalisation strategy that guarantees convergence from arbitrary starting points in nonconvex settings to stationary points, and under a Polyak--Lojasiewicz condition, to a global minimum, in Hilbert spaces. The method employs an adaptive Levenberg--Marquardt regularisation for the Newton steps, combined with backtracking, and does not require knowledge of problem-specific constants. We establish global nonasymptotic rates: $\\mathcal{O}(1/k)$ for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16468","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/2508.16468/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":"2508.16468","created_at":"2026-07-05T11:57:49.094481+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.16468v1","created_at":"2026-07-05T11:57:49.094481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16468","created_at":"2026-07-05T11:57:49.094481+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGYI5LSIPWRJ","created_at":"2026-07-05T11:57:49.094481+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGYI5LSIPWRJSCRM","created_at":"2026-07-05T11:57:49.094481+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGYI5LSI","created_at":"2026-07-05T11:57:49.094481+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.19647","citing_title":"On the Universality of Simple Trust-Region Algorithms","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QGYI5LSIPWRJSCRMYTOVK2SMH5","json":"https://pith.science/pith/QGYI5LSIPWRJSCRMYTOVK2SMH5.json","graph_json":"https://pith.science/api/pith-number/QGYI5LSIPWRJSCRMYTOVK2SMH5/graph.json","events_json":"https://pith.science/api/pith-number/QGYI5LSIPWRJSCRMYTOVK2SMH5/events.json","paper":"https://pith.science/paper/QGYI5LSI"},"agent_actions":{"view_html":"https://pith.science/pith/QGYI5LSIPWRJSCRMYTOVK2SMH5","download_json":"https://pith.science/pith/QGYI5LSIPWRJSCRMYTOVK2SMH5.json","view_paper":"https://pith.science/paper/QGYI5LSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.16468&json=true","fetch_graph":"https://pith.science/api/pith-number/QGYI5LSIPWRJSCRMYTOVK2SMH5/graph.json","fetch_events":"https://pith.science/api/pith-number/QGYI5LSIPWRJSCRMYTOVK2SMH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGYI5LSIPWRJSCRMYTOVK2SMH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGYI5LSIPWRJSCRMYTOVK2SMH5/action/storage_attestation","attest_author":"https://pith.science/pith/QGYI5LSIPWRJSCRMYTOVK2SMH5/action/author_attestation","sign_citation":"https://pith.science/pith/QGYI5LSIPWRJSCRMYTOVK2SMH5/action/citation_signature","submit_replication":"https://pith.science/pith/QGYI5LSIPWRJSCRMYTOVK2SMH5/action/replication_record"}},"created_at":"2026-07-05T11:57:49.094481+00:00","updated_at":"2026-07-05T11:57:49.094481+00:00"}