{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L25OKHYEA7V2FWZBOS7BWYCESD","short_pith_number":"pith:L25OKHYE","schema_version":"1.0","canonical_sha256":"5ebae51f0407eba2db2174be1b604490de2394e43def9449649c9ba5a8c55951","source":{"kind":"arxiv","id":"1709.07180","version":1},"attestation_state":"computed","paper":{"title":"Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Nick I. M. Gould, Philippe L. Toint","submitted_at":"2017-09-21T07:06:26Z","abstract_excerpt":"We establish or refute the optimality of inexact second-order methods for unconstrained nonconvex optimization from the point of view of worst-case evaluation complexity, improving and generalizing the results of Cartis, Gould and Toint (2010,2011). To this aim, we consider a new general class of inexact second-order algorithms for unconstrained optimization that includes regularization and trust-region variations of Newton's method as well as of their linesearch variants. For each method in this class and arbitrary accuracy threshold $\\epsilon \\in (0,1)$, we exhibit a smooth objective functio"},"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":"1709.07180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T07:06:26Z","cross_cats_sorted":[],"title_canon_sha256":"274434ce81f5bb6ea1a4a7cc7796db93151987c7dbaeb9500972acb84ba28a6e","abstract_canon_sha256":"f8f3f55806669dce7755a83141a73e9a8dcff992c67bb220df77cc5536259c1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:44:00.832499Z","signature_b64":"Jw2T2+iFMO2+oz4Svn99m8WHNAmY+GciTVG6X3V4fhiqz9MGbLUOWVoQqqk3WX6ZddX2/c/yJfmx/gW48kJvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ebae51f0407eba2db2174be1b604490de2394e43def9449649c9ba5a8c55951","last_reissued_at":"2026-07-05T02:44:00.832092Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:44:00.832092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Nick I. M. Gould, Philippe L. Toint","submitted_at":"2017-09-21T07:06:26Z","abstract_excerpt":"We establish or refute the optimality of inexact second-order methods for unconstrained nonconvex optimization from the point of view of worst-case evaluation complexity, improving and generalizing the results of Cartis, Gould and Toint (2010,2011). To this aim, we consider a new general class of inexact second-order algorithms for unconstrained optimization that includes regularization and trust-region variations of Newton's method as well as of their linesearch variants. For each method in this class and arbitrary accuracy threshold $\\epsilon \\in (0,1)$, we exhibit a smooth objective functio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07180","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/1709.07180/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":"1709.07180","created_at":"2026-07-05T02:44:00.832149+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07180v1","created_at":"2026-07-05T02:44:00.832149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07180","created_at":"2026-07-05T02:44:00.832149+00:00"},{"alias_kind":"pith_short_12","alias_value":"L25OKHYEA7V2","created_at":"2026-07-05T02:44:00.832149+00:00"},{"alias_kind":"pith_short_16","alias_value":"L25OKHYEA7V2FWZB","created_at":"2026-07-05T02:44:00.832149+00:00"},{"alias_kind":"pith_short_8","alias_value":"L25OKHYE","created_at":"2026-07-05T02:44:00.832149+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27082","citing_title":"Finding Stationary Points by Comparisons","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05438","citing_title":"Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L25OKHYEA7V2FWZBOS7BWYCESD","json":"https://pith.science/pith/L25OKHYEA7V2FWZBOS7BWYCESD.json","graph_json":"https://pith.science/api/pith-number/L25OKHYEA7V2FWZBOS7BWYCESD/graph.json","events_json":"https://pith.science/api/pith-number/L25OKHYEA7V2FWZBOS7BWYCESD/events.json","paper":"https://pith.science/paper/L25OKHYE"},"agent_actions":{"view_html":"https://pith.science/pith/L25OKHYEA7V2FWZBOS7BWYCESD","download_json":"https://pith.science/pith/L25OKHYEA7V2FWZBOS7BWYCESD.json","view_paper":"https://pith.science/paper/L25OKHYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07180&json=true","fetch_graph":"https://pith.science/api/pith-number/L25OKHYEA7V2FWZBOS7BWYCESD/graph.json","fetch_events":"https://pith.science/api/pith-number/L25OKHYEA7V2FWZBOS7BWYCESD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L25OKHYEA7V2FWZBOS7BWYCESD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L25OKHYEA7V2FWZBOS7BWYCESD/action/storage_attestation","attest_author":"https://pith.science/pith/L25OKHYEA7V2FWZBOS7BWYCESD/action/author_attestation","sign_citation":"https://pith.science/pith/L25OKHYEA7V2FWZBOS7BWYCESD/action/citation_signature","submit_replication":"https://pith.science/pith/L25OKHYEA7V2FWZBOS7BWYCESD/action/replication_record"}},"created_at":"2026-07-05T02:44:00.832149+00:00","updated_at":"2026-07-05T02:44:00.832149+00:00"}