{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RSVQKA467IB7D3IY424QKZBE5I","short_pith_number":"pith:RSVQKA46","schema_version":"1.0","canonical_sha256":"8cab05039efa03f1ed18e6b9056424ea3544c81f7b70997003b82538c82df4ab","source":{"kind":"arxiv","id":"2505.04807","version":2},"attestation_state":"computed","paper":{"title":"A Fast Newton Method Under Local Lipschitz Smoothness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Philippe L.Toint, Sadok Jerad, Serge Gratton","submitted_at":"2025-05-07T21:16:11Z","abstract_excerpt":"A new, fast second-order method is proposed that achieves the optimal $\\mathcal{O}\\left(|\\log(\\epsilon)|\\epsilon^{-3/2}\\right)$ complexity to obtain first-order $\\epsilon$-stationary points. Crucially, this is deduced without assuming the standard global Lipschitz Hessian continuity condition, but only using an appropriate local smoothness requirement. The algorithm exploits Hessian information to compute a Newton step and a negative curvature step when needed, in an approach similar to that of the AN2C method.Inexact versions of the Newton step and negative curvature are proposed in order to "},"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":"2505.04807","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-07T21:16:11Z","cross_cats_sorted":[],"title_canon_sha256":"e8ba1421f871ec9d87d13900b8fbafd8e0897563f2a699e33d5dcf70eb7423ce","abstract_canon_sha256":"3377ddcc02066c04151552c2f97c99a5cd34e9c3e2b3e44fb57ad366eb69d30d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:16:51.157862Z","signature_b64":"NK2E84Yk4PIpqh6bqsp/36+TW6jX4OHwWmJRIi+D1jVZiGV0V4fDv4GkKSzisYRyz6ZY/OdA8bGSAv2S4aL8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cab05039efa03f1ed18e6b9056424ea3544c81f7b70997003b82538c82df4ab","last_reissued_at":"2026-06-30T02:16:51.157033Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:16:51.157033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Newton Method Under Local Lipschitz Smoothness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Philippe L.Toint, Sadok Jerad, Serge Gratton","submitted_at":"2025-05-07T21:16:11Z","abstract_excerpt":"A new, fast second-order method is proposed that achieves the optimal $\\mathcal{O}\\left(|\\log(\\epsilon)|\\epsilon^{-3/2}\\right)$ complexity to obtain first-order $\\epsilon$-stationary points. Crucially, this is deduced without assuming the standard global Lipschitz Hessian continuity condition, but only using an appropriate local smoothness requirement. The algorithm exploits Hessian information to compute a Newton step and a negative curvature step when needed, in an approach similar to that of the AN2C method.Inexact versions of the Newton step and negative curvature are proposed in order to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04807","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/2505.04807/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":"2505.04807","created_at":"2026-06-30T02:16:51.157139+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.04807v2","created_at":"2026-06-30T02:16:51.157139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04807","created_at":"2026-06-30T02:16:51.157139+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSVQKA467IB7","created_at":"2026-06-30T02:16:51.157139+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSVQKA467IB7D3IY","created_at":"2026-06-30T02:16:51.157139+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSVQKA46","created_at":"2026-06-30T02:16:51.157139+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13710","citing_title":"Gradient-Normalized Smoothness for Optimization with Approximate Hessians","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RSVQKA467IB7D3IY424QKZBE5I","json":"https://pith.science/pith/RSVQKA467IB7D3IY424QKZBE5I.json","graph_json":"https://pith.science/api/pith-number/RSVQKA467IB7D3IY424QKZBE5I/graph.json","events_json":"https://pith.science/api/pith-number/RSVQKA467IB7D3IY424QKZBE5I/events.json","paper":"https://pith.science/paper/RSVQKA46"},"agent_actions":{"view_html":"https://pith.science/pith/RSVQKA467IB7D3IY424QKZBE5I","download_json":"https://pith.science/pith/RSVQKA467IB7D3IY424QKZBE5I.json","view_paper":"https://pith.science/paper/RSVQKA46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.04807&json=true","fetch_graph":"https://pith.science/api/pith-number/RSVQKA467IB7D3IY424QKZBE5I/graph.json","fetch_events":"https://pith.science/api/pith-number/RSVQKA467IB7D3IY424QKZBE5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSVQKA467IB7D3IY424QKZBE5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSVQKA467IB7D3IY424QKZBE5I/action/storage_attestation","attest_author":"https://pith.science/pith/RSVQKA467IB7D3IY424QKZBE5I/action/author_attestation","sign_citation":"https://pith.science/pith/RSVQKA467IB7D3IY424QKZBE5I/action/citation_signature","submit_replication":"https://pith.science/pith/RSVQKA467IB7D3IY424QKZBE5I/action/replication_record"}},"created_at":"2026-06-30T02:16:51.157139+00:00","updated_at":"2026-06-30T02:16:51.157139+00:00"}