{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TIJP747OEYKX23VLYI73O3M4C4","short_pith_number":"pith:TIJP747O","canonical_record":{"source":{"id":"1708.00475","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-01T18:56:39Z","cross_cats_sorted":[],"title_canon_sha256":"df5ab342c6ed963749b6cbaf757a5d84696f51f46c5fed9bdd41283d0293bd8e","abstract_canon_sha256":"9236eb30fb8543ae5ca046ddfbd6a7ba19ce1f7fa3ba80bb6f42c552b92d6c6f"},"schema_version":"1.0"},"canonical_sha256":"9a12fff3ee26157d6eabc23fb76d9c173e39f5e3cbb46e919065bc9914b3ef11","source":{"kind":"arxiv","id":"1708.00475","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00475","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00475v4","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00475","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"TIJP747OEYKX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TIJP747OEYKX23VL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TIJP747O","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TIJP747OEYKX23VLYI73O3M4C4","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00475","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-01T18:56:39Z","cross_cats_sorted":[],"title_canon_sha256":"df5ab342c6ed963749b6cbaf757a5d84696f51f46c5fed9bdd41283d0293bd8e","abstract_canon_sha256":"9236eb30fb8543ae5ca046ddfbd6a7ba19ce1f7fa3ba80bb6f42c552b92d6c6f"},"schema_version":"1.0"},"canonical_sha256":"9a12fff3ee26157d6eabc23fb76d9c173e39f5e3cbb46e919065bc9914b3ef11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:56.331361Z","signature_b64":"e1jQ0P2+QOdDE2XYPi6rcdlVcPOliM1nJ+8DfKjryHHoJiEgrf9TO0jhVUL37xdnbhmh/8sva/2taosTiJPqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a12fff3ee26157d6eabc23fb76d9c173e39f5e3cbb46e919065bc9914b3ef11","last_reissued_at":"2026-05-18T00:20:56.330918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:56.330918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00475","source_version":4,"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:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q0KzeZx6X9KSja5sYV7v5Z6OrhE8vGMc8P/RjZgqmjqYbanWAbf7U5pkDugQSz80UH1/CuTGVKlZcZYmCHVIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:09:12.060296Z"},"content_sha256":"1c872b2de95d3567775ff9217babe14c78f8e37a2f90485a4320158ca53a043a","schema_version":"1.0","event_id":"sha256:1c872b2de95d3567775ff9217babe14c78f8e37a2f90485a4320158ca53a043a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TIJP747OEYKX23VLYI73O3M4C4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Inexact Regularized Newton Framework with a Worst-Case Iteration Complexity of $\\mathcal{O}(\\epsilon^{-3/2})$ for Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel P. Robinson, Frank E. Curtis, Mohammadreza Samadi","submitted_at":"2017-08-01T18:56:39Z","abstract_excerpt":"An algorithm for solving smooth nonconvex optimization problems is proposed that, in the worst-case, takes $\\mathcal{O}(\\epsilon^{-3/2})$ iterations to drive the norm of the gradient of the objective function below a prescribed positive real number $\\epsilon$ and can take $\\mathcal{O}(\\epsilon^{-3})$ iterations to drive the leftmost eigenvalue of the Hessian of the objective above $-\\epsilon$. The proposed algorithm is a general framework that covers a wide range of techniques including quadratically and cubically regularized Newton methods, such as the Adaptive Regularisation using Cubics (AR"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00475","kind":"arxiv","version":4},"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:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O1YW3F0a1W83csZxEnByWKfRpd+9JxMPSv2odwkQI/JAmKXtZHoyggNxZTXXgHLk6ckFQOW2vFF5gb3AsIsaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:09:12.060939Z"},"content_sha256":"6b2a5cf0af0582c8ede806073b46113d94cb12a0a84eb5e57e921577951d8e6d","schema_version":"1.0","event_id":"sha256:6b2a5cf0af0582c8ede806073b46113d94cb12a0a84eb5e57e921577951d8e6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIJP747OEYKX23VLYI73O3M4C4/bundle.json","state_url":"https://pith.science/pith/TIJP747OEYKX23VLYI73O3M4C4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIJP747OEYKX23VLYI73O3M4C4/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-04T15:09:12Z","links":{"resolver":"https://pith.science/pith/TIJP747OEYKX23VLYI73O3M4C4","bundle":"https://pith.science/pith/TIJP747OEYKX23VLYI73O3M4C4/bundle.json","state":"https://pith.science/pith/TIJP747OEYKX23VLYI73O3M4C4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIJP747OEYKX23VLYI73O3M4C4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TIJP747OEYKX23VLYI73O3M4C4","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":"9236eb30fb8543ae5ca046ddfbd6a7ba19ce1f7fa3ba80bb6f42c552b92d6c6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-01T18:56:39Z","title_canon_sha256":"df5ab342c6ed963749b6cbaf757a5d84696f51f46c5fed9bdd41283d0293bd8e"},"schema_version":"1.0","source":{"id":"1708.00475","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00475","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00475v4","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00475","created_at":"2026-05-18T00:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"TIJP747OEYKX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TIJP747OEYKX23VL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TIJP747O","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:6b2a5cf0af0582c8ede806073b46113d94cb12a0a84eb5e57e921577951d8e6d","target":"graph","created_at":"2026-05-18T00:20:56Z","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":"An algorithm for solving smooth nonconvex optimization problems is proposed that, in the worst-case, takes $\\mathcal{O}(\\epsilon^{-3/2})$ iterations to drive the norm of the gradient of the objective function below a prescribed positive real number $\\epsilon$ and can take $\\mathcal{O}(\\epsilon^{-3})$ iterations to drive the leftmost eigenvalue of the Hessian of the objective above $-\\epsilon$. The proposed algorithm is a general framework that covers a wide range of techniques including quadratically and cubically regularized Newton methods, such as the Adaptive Regularisation using Cubics (AR","authors_text":"Daniel P. Robinson, Frank E. Curtis, Mohammadreza Samadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-01T18:56:39Z","title":"An Inexact Regularized Newton Framework with a Worst-Case Iteration Complexity of $\\mathcal{O}(\\epsilon^{-3/2})$ for Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00475","kind":"arxiv","version":4},"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:1c872b2de95d3567775ff9217babe14c78f8e37a2f90485a4320158ca53a043a","target":"record","created_at":"2026-05-18T00:20:56Z","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":"9236eb30fb8543ae5ca046ddfbd6a7ba19ce1f7fa3ba80bb6f42c552b92d6c6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-01T18:56:39Z","title_canon_sha256":"df5ab342c6ed963749b6cbaf757a5d84696f51f46c5fed9bdd41283d0293bd8e"},"schema_version":"1.0","source":{"id":"1708.00475","kind":"arxiv","version":4}},"canonical_sha256":"9a12fff3ee26157d6eabc23fb76d9c173e39f5e3cbb46e919065bc9914b3ef11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a12fff3ee26157d6eabc23fb76d9c173e39f5e3cbb46e919065bc9914b3ef11","first_computed_at":"2026-05-18T00:20:56.330918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:56.330918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e1jQ0P2+QOdDE2XYPi6rcdlVcPOliM1nJ+8DfKjryHHoJiEgrf9TO0jhVUL37xdnbhmh/8sva/2taosTiJPqDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:56.331361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00475","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c872b2de95d3567775ff9217babe14c78f8e37a2f90485a4320158ca53a043a","sha256:6b2a5cf0af0582c8ede806073b46113d94cb12a0a84eb5e57e921577951d8e6d"],"state_sha256":"0a8c5d090a05a5b2333e2071e69dc9d404ace9af9dc047fa10a452198fa0b67d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LYThEP/ao2n7K8Male6SmUmNOR6tIHTJAxFyLpJhOyNl1hVSF9lPDMsGJNWvBMosdctvB3m9+fx8LLeIYcQ0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:09:12.064135Z","bundle_sha256":"61d520abe07b50463724f26b0f577a3dd881105f93ce6e5549a3d95a7bc0bb0d"}}