{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4ZZDUTLAIAPDBMU4G4MQO4NJBM","short_pith_number":"pith:4ZZDUTLA","schema_version":"1.0","canonical_sha256":"e6723a4d60401e30b29c37190771a90b3b3965d293fec7e1fad1ae9650688887","source":{"kind":"arxiv","id":"1912.04365","version":3},"attestation_state":"computed","paper":{"title":"Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cl\\'ement Royer, Daniel P. Robinson, Frank E. Curtis, Stephen J. Wright","submitted_at":"2019-12-09T20:40:41Z","abstract_excerpt":"Worst-case complexity guarantees for nonconvex optimization algorithms have been a topic of growing interest. Multiple frameworks that achieve the best known complexity bounds among a broad class of first- and second-order strategies have been proposed. These methods have often been designed primarily with complexity guarantees in mind and, as a result, represent a departure from the algorithms that have proved to be the most effective in practice. In this paper, we consider trust-region Newton methods, one of the most popular classes of algorithms for solving nonconvex optimization problems. "},"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":"1912.04365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-09T20:40:41Z","cross_cats_sorted":[],"title_canon_sha256":"02db141d326649bd5c01d734de7813d56bb534b13b27fcf19cf297288f36c786","abstract_canon_sha256":"ce43c3ee8e381ae686f0abd6bedcf0c8b27c260cf84ed0005a2146b68cc2de22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:07.562884Z","signature_b64":"qIvQSP8p6fimvwxQa8QQLcuobxS8LuXuHLuNPH6+xttqDdMcsg7v1uHVGR+Nr3xxT9wSMWbvfIF8NpYYRHwFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6723a4d60401e30b29c37190771a90b3b3965d293fec7e1fad1ae9650688887","last_reissued_at":"2026-07-05T01:53:07.562477Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:07.562477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cl\\'ement Royer, Daniel P. Robinson, Frank E. Curtis, Stephen J. Wright","submitted_at":"2019-12-09T20:40:41Z","abstract_excerpt":"Worst-case complexity guarantees for nonconvex optimization algorithms have been a topic of growing interest. Multiple frameworks that achieve the best known complexity bounds among a broad class of first- and second-order strategies have been proposed. These methods have often been designed primarily with complexity guarantees in mind and, as a result, represent a departure from the algorithms that have proved to be the most effective in practice. In this paper, we consider trust-region Newton methods, one of the most popular classes of algorithms for solving nonconvex optimization problems. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.04365","kind":"arxiv","version":3},"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/1912.04365/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":"1912.04365","created_at":"2026-07-05T01:53:07.562535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.04365v3","created_at":"2026-07-05T01:53:07.562535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.04365","created_at":"2026-07-05T01:53:07.562535+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZZDUTLAIAPD","created_at":"2026-07-05T01:53:07.562535+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZZDUTLAIAPDBMU4","created_at":"2026-07-05T01:53:07.562535+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZZDUTLA","created_at":"2026-07-05T01:53:07.562535+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/4ZZDUTLAIAPDBMU4G4MQO4NJBM","json":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM.json","graph_json":"https://pith.science/api/pith-number/4ZZDUTLAIAPDBMU4G4MQO4NJBM/graph.json","events_json":"https://pith.science/api/pith-number/4ZZDUTLAIAPDBMU4G4MQO4NJBM/events.json","paper":"https://pith.science/paper/4ZZDUTLA"},"agent_actions":{"view_html":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM","download_json":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM.json","view_paper":"https://pith.science/paper/4ZZDUTLA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.04365&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZZDUTLAIAPDBMU4G4MQO4NJBM/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZZDUTLAIAPDBMU4G4MQO4NJBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM/action/storage_attestation","attest_author":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM/action/author_attestation","sign_citation":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM/action/citation_signature","submit_replication":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM/action/replication_record"}},"created_at":"2026-07-05T01:53:07.562535+00:00","updated_at":"2026-07-05T01:53:07.562535+00:00"}