{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L25OKHYEA7V2FWZBOS7BWYCESD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f8f3f55806669dce7755a83141a73e9a8dcff992c67bb220df77cc5536259c1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T07:06:26Z","title_canon_sha256":"274434ce81f5bb6ea1a4a7cc7796db93151987c7dbaeb9500972acb84ba28a6e"},"schema_version":"1.0","source":{"id":"1709.07180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07180","created_at":"2026-07-05T02:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07180v1","created_at":"2026-07-05T02:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07180","created_at":"2026-07-05T02:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"L25OKHYEA7V2","created_at":"2026-07-05T02:44:00Z"},{"alias_kind":"pith_short_16","alias_value":"L25OKHYEA7V2FWZB","created_at":"2026-07-05T02:44:00Z"},{"alias_kind":"pith_short_8","alias_value":"L25OKHYE","created_at":"2026-07-05T02:44:00Z"}],"graph_snapshots":[{"event_id":"sha256:eb417986224b98038db37d532e2780ea2670d32b90c3a06c5cf2408ad40f38be","target":"graph","created_at":"2026-07-05T02:44:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1709.07180/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Coralia Cartis, Nick I. M. Gould, Philippe L. Toint","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T07:06:26Z","title":"Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07180","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f40aa4649907a31e938382a09aa75cd3bd060bcc588d13d46a8c5958a6b0acdd","target":"record","created_at":"2026-07-05T02:44:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f8f3f55806669dce7755a83141a73e9a8dcff992c67bb220df77cc5536259c1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T07:06:26Z","title_canon_sha256":"274434ce81f5bb6ea1a4a7cc7796db93151987c7dbaeb9500972acb84ba28a6e"},"schema_version":"1.0","source":{"id":"1709.07180","kind":"arxiv","version":1}},"canonical_sha256":"5ebae51f0407eba2db2174be1b604490de2394e43def9449649c9ba5a8c55951","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ebae51f0407eba2db2174be1b604490de2394e43def9449649c9ba5a8c55951","first_computed_at":"2026-07-05T02:44:00.832092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:44:00.832092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jw2T2+iFMO2+oz4Svn99m8WHNAmY+GciTVG6X3V4fhiqz9MGbLUOWVoQqqk3WX6ZddX2/c/yJfmx/gW48kJvAg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:44:00.832499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f40aa4649907a31e938382a09aa75cd3bd060bcc588d13d46a8c5958a6b0acdd","sha256:eb417986224b98038db37d532e2780ea2670d32b90c3a06c5cf2408ad40f38be"],"state_sha256":"29894e2fd1ba750dcc9fd295988637342e34c62ddb4035c138aa5f87786a06c1"}