{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EURNXX3O2XJSTMDNVMNBET2IXE","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":"2f29557a9e87e6a9362cd44d2d5b1a9b58ba654c32f522141fca69d82fcb44d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-16T22:59:31Z","title_canon_sha256":"95f99fc88577cefdf7e29086097c775eb6f813023078c3152ebeeac0f052fdda"},"schema_version":"1.0","source":{"id":"1811.07057","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07057","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07057v1","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07057","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"pith_short_12","alias_value":"EURNXX3O2XJS","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EURNXX3O2XJSTMDN","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EURNXX3O","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:5e0cabfa1e04dbd09e618e955de0c95d3a9309cb9c4bd5902d72309f78262e55","target":"graph","created_at":"2026-05-18T00:00:29Z","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":"Adaptive cubic regularization methods have emerged as a credible alternative to linesearch and trust-region for smooth nonconvex optimization, with optimal complexity amongst second-order methods. Here we consider a general/new class of adaptive regularization methods, that use first- or higher-order local Taylor models of the objective regularized by a(ny) power of the step size and applied to convexly-constrained optimization problems. We investigate the worst-case evaluation complexity/global rate of convergence of these algorithms, when the level of sufficient smoothness of the objective m","authors_text":"Coralia Cartis, Nicholas I.M. Gould, Philippe L. Toint","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-16T22:59:31Z","title":"Universal regularization methods - varying the power, the smoothness and the accuracy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07057","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:15259206d7e31420f7f01879715ffc0d2ed4d39577d85ad31d538c7527fb14e3","target":"record","created_at":"2026-05-18T00:00:29Z","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":"2f29557a9e87e6a9362cd44d2d5b1a9b58ba654c32f522141fca69d82fcb44d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-16T22:59:31Z","title_canon_sha256":"95f99fc88577cefdf7e29086097c775eb6f813023078c3152ebeeac0f052fdda"},"schema_version":"1.0","source":{"id":"1811.07057","kind":"arxiv","version":1}},"canonical_sha256":"2522dbdf6ed5d329b06dab1a124f48b902c8c521728dd82d27b9fe25c43d498d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2522dbdf6ed5d329b06dab1a124f48b902c8c521728dd82d27b9fe25c43d498d","first_computed_at":"2026-05-18T00:00:29.124619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:29.124619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rEcjLlWu6d2LZQ6Eh/8dWBneFLp/CjGq83OAqgrFWvUehOi6s21GBvGT95N637J02BOFsGqlYuCDRiBlI867AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:29.125355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07057","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15259206d7e31420f7f01879715ffc0d2ed4d39577d85ad31d538c7527fb14e3","sha256:5e0cabfa1e04dbd09e618e955de0c95d3a9309cb9c4bd5902d72309f78262e55"],"state_sha256":"593275fc86000489f5c877264a238e3b699ebaec53ac1f9a37b1c01dab95c0d5"}