{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3SVY2UB7SWXBOCKB5RKZOPHF3E","short_pith_number":"pith:3SVY2UB7","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"},"canonical_sha256":"dcab8d503f95ae170941ec55973ce5d90f8ea043a83b1739910f2b3ca925e016","source":{"kind":"arxiv","id":"1706.03131","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03131","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03131v2","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03131","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"3SVY2UB7SWXB","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3SVY2UB7SWXBOCKB","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3SVY2UB7","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3SVY2UB7SWXBOCKB5RKZOPHF3E","target":"record","payload":{"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"},"canonical_sha256":"dcab8d503f95ae170941ec55973ce5d90f8ea043a83b1739910f2b3ca925e016","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"},"source_kind":"arxiv","source_id":"1706.03131","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixHf2F2a3im4kpo4V9cWQlHv6UIrF26VnpoIjccay5A1ZzLuMac4mh30lOBtbOYoPSbeJntL/U8cB59jCgQzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:18:33.330508Z"},"content_sha256":"ea694ad303d5bc0465f3a029582c89875a04cf507a3957289b03a10efc8550d9","schema_version":"1.0","event_id":"sha256:ea694ad303d5bc0465f3a029582c89875a04cf507a3957289b03a10efc8550d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3SVY2UB7SWXBOCKB5RKZOPHF3E","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S/R9uvBLX3iCsHY09641JIQb8V3mpgHR82JwY14xf6HwczEaGl7DjqVbVQWUE2WSwsrHU3XuFdD/eiMNun3XDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:18:33.330849Z"},"content_sha256":"d81e5ccf36ff17c6d48add7c4c001e800c4e18b19776718abe6b47f0c3c10b3f","schema_version":"1.0","event_id":"sha256:d81e5ccf36ff17c6d48add7c4c001e800c4e18b19776718abe6b47f0c3c10b3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E/bundle.json","state_url":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T04:18:33Z","links":{"resolver":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E","bundle":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E/bundle.json","state":"https://pith.science/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SVY2UB7SWXBOCKB5RKZOPHF3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3SVY2UB7SWXBOCKB5RKZOPHF3E","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":"2f216d555f7451d0b4fbddf1f413d1bf8a702ff6d15e3338c641601c24c8e691","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-09T21:26:20Z","title_canon_sha256":"09070ca3e53a364fbbcd5e350a814425f0b0c17d2299878ec192daf417f421f1"},"schema_version":"1.0","source":{"id":"1706.03131","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03131","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03131v2","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03131","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"3SVY2UB7SWXB","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3SVY2UB7SWXBOCKB","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3SVY2UB7","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:d81e5ccf36ff17c6d48add7c4c001e800c4e18b19776718abe6b47f0c3c10b3f","target":"graph","created_at":"2026-05-18T00:28:25Z","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"},"paper":{"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","authors_text":"Cl\\'ement W. Royer, Stephen J. Wright","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-09T21:26:20Z","title":"Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03131","kind":"arxiv","version":2},"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:ea694ad303d5bc0465f3a029582c89875a04cf507a3957289b03a10efc8550d9","target":"record","created_at":"2026-05-18T00:28:25Z","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":"2f216d555f7451d0b4fbddf1f413d1bf8a702ff6d15e3338c641601c24c8e691","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-09T21:26:20Z","title_canon_sha256":"09070ca3e53a364fbbcd5e350a814425f0b0c17d2299878ec192daf417f421f1"},"schema_version":"1.0","source":{"id":"1706.03131","kind":"arxiv","version":2}},"canonical_sha256":"dcab8d503f95ae170941ec55973ce5d90f8ea043a83b1739910f2b3ca925e016","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcab8d503f95ae170941ec55973ce5d90f8ea043a83b1739910f2b3ca925e016","first_computed_at":"2026-05-18T00:28:25.236190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:25.236190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M30D0qJXzUFxXfKfuyKy9ed9vCtgNVHBA+dLz99y5ZYH7mTK25Pf50DeK8ThdC98qmiwsSW5C701si3ENsGCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:25.237120Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03131","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea694ad303d5bc0465f3a029582c89875a04cf507a3957289b03a10efc8550d9","sha256:d81e5ccf36ff17c6d48add7c4c001e800c4e18b19776718abe6b47f0c3c10b3f"],"state_sha256":"8ee2e4f3a2aea5b0aa9ef41de2043bee80adfc59de80ab3e6a4a4af597e763d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKqxhGhqqXxO1Dwg+/vhB5HW+iWGZ0pBqOtrTlfGVUa38kAjqWRv3v5XL6y5fa4kpmbKFDkXF2ZZIIcwpJjWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:18:33.332727Z","bundle_sha256":"a0dd2a8aea8c8674c41b9f8d3ba5a17508c8eb04a61a42e5dfbd8547739c4eb5"}}