{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3SVY2UB7SWXBOCKB5RKZOPHF3E","short_pith_number":"pith:3SVY2UB7","schema_version":"1.0","canonical_sha256":"dcab8d503f95ae170941ec55973ce5d90f8ea043a83b1739910f2b3ca925e016","source":{"kind":"arxiv","id":"1706.03131","version":2},"attestation_state":"computed","paper":{"title":"Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cl\\'ement W. Royer, Stephen J. Wright","submitted_at":"2017-06-09T21:26:20Z","abstract_excerpt":"There has been much recent interest in finding unconstrained local minima of smooth functions, due in part of the prevalence of such problems in machine learning and robust statistics. A particular focus is algorithms with good complexity guarantees. Second-order Newton-type methods that make use of regularization and trust regions have been analyzed from such a perspective. More recent proposals, based chiefly on first-order methodology, have also been shown to enjoy optimal iteration complexity rates, while providing additional guarantees on computational cost.\n  In this paper, we present an"},"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":"1706.03131","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-09T21:26:20Z","cross_cats_sorted":[],"title_canon_sha256":"09070ca3e53a364fbbcd5e350a814425f0b0c17d2299878ec192daf417f421f1","abstract_canon_sha256":"2f216d555f7451d0b4fbddf1f413d1bf8a702ff6d15e3338c641601c24c8e691"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:25.237120Z","signature_b64":"M30D0qJXzUFxXfKfuyKy9ed9vCtgNVHBA+dLz99y5ZYH7mTK25Pf50DeK8ThdC98qmiwsSW5C701si3ENsGCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcab8d503f95ae170941ec55973ce5d90f8ea043a83b1739910f2b3ca925e016","last_reissued_at":"2026-05-18T00:28:25.236190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:25.236190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cl\\'ement W. Royer, Stephen J. Wright","submitted_at":"2017-06-09T21:26:20Z","abstract_excerpt":"There has been much recent interest in finding unconstrained local minima of smooth functions, due in part of the prevalence of such problems in machine learning and robust statistics. A particular focus is algorithms with good complexity guarantees. Second-order Newton-type methods that make use of regularization and trust regions have been analyzed from such a perspective. More recent proposals, based chiefly on first-order methodology, have also been shown to enjoy optimal iteration complexity rates, while providing additional guarantees on computational cost.\n  In this paper, we present an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03131","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":""},"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":"1706.03131","created_at":"2026-05-18T00:28:25.236329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03131v2","created_at":"2026-05-18T00:28:25.236329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03131","created_at":"2026-05-18T00:28:25.236329+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SVY2UB7SWXB","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SVY2UB7SWXBOCKB","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SVY2UB7","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E","json":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E.json","graph_json":"https://pith.science/api/pith-number/3SVY2UB7SWXBOCKB5RKZOPHF3E/graph.json","events_json":"https://pith.science/api/pith-number/3SVY2UB7SWXBOCKB5RKZOPHF3E/events.json","paper":"https://pith.science/paper/3SVY2UB7"},"agent_actions":{"view_html":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E","download_json":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E.json","view_paper":"https://pith.science/paper/3SVY2UB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03131&json=true","fetch_graph":"https://pith.science/api/pith-number/3SVY2UB7SWXBOCKB5RKZOPHF3E/graph.json","fetch_events":"https://pith.science/api/pith-number/3SVY2UB7SWXBOCKB5RKZOPHF3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E/action/storage_attestation","attest_author":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E/action/author_attestation","sign_citation":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E/action/citation_signature","submit_replication":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E/action/replication_record"}},"created_at":"2026-05-18T00:28:25.236329+00:00","updated_at":"2026-05-18T00:28:25.236329+00:00"}