{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MQVV5VTN4EJC5ZVSDW5L4ISRLW","short_pith_number":"pith:MQVV5VTN","canonical_record":{"source":{"id":"1708.07164","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-23T19:40:55Z","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"title_canon_sha256":"3b7ffe2b2c7c5b78810644eca630da160e143cd5474b964dc7d3d164025803b2","abstract_canon_sha256":"7a141ca1e6e51c2d8ed539a61d5d506c8f3f57036203e741d78ac75d012a33a9"},"schema_version":"1.0"},"canonical_sha256":"642b5ed66de1122ee6b21dbabe22515db35a499262a4aaf2aa01a7d3442b3364","source":{"kind":"arxiv","id":"1708.07164","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07164","created_at":"2026-05-17T23:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07164v4","created_at":"2026-05-17T23:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07164","created_at":"2026-05-17T23:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"MQVV5VTN4EJC","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MQVV5VTN4EJC5ZVS","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MQVV5VTN","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MQVV5VTN4EJC5ZVSDW5L4ISRLW","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07164","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-23T19:40:55Z","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"title_canon_sha256":"3b7ffe2b2c7c5b78810644eca630da160e143cd5474b964dc7d3d164025803b2","abstract_canon_sha256":"7a141ca1e6e51c2d8ed539a61d5d506c8f3f57036203e741d78ac75d012a33a9"},"schema_version":"1.0"},"canonical_sha256":"642b5ed66de1122ee6b21dbabe22515db35a499262a4aaf2aa01a7d3442b3364","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:22.084702Z","signature_b64":"DXk5Y3fchp4Fy6hGwokMIgazN66MrBtHnh2RebMF540fOfxTXnfPVBF6v0jyDO8UHl9lFIxLA7ys+bpmUbqaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"642b5ed66de1122ee6b21dbabe22515db35a499262a4aaf2aa01a7d3442b3364","last_reissued_at":"2026-05-17T23:46:22.084165Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:22.084165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07164","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-17T23:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fs7D2MYropvTNAAsr4U4pjS9smFbgejJ8t4Fdeeo6hRK58j3W2ZUHQfimu4/A9euFQTV8FKRbFKI2oXHnPUcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:26:47.127510Z"},"content_sha256":"4e28359313e58db83bd35d24c311974c939b6ce785837fb992f287de16543fe3","schema_version":"1.0","event_id":"sha256:4e28359313e58db83bd35d24c311974c939b6ce785837fb992f287de16543fe3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MQVV5VTN4EJC5ZVSDW5L4ISRLW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Newton-Type Methods for Non-Convex Optimization Under Inexact Hessian Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Fred Roosta, Michael W. Mahoney, Peng Xu","submitted_at":"2017-08-23T19:40:55Z","abstract_excerpt":"We consider variants of trust-region and cubic regularization methods for non-convex optimization, in which the Hessian matrix is approximated. Under mild conditions on the inexact Hessian, and using approximate solution of the corresponding sub-problems, we provide iteration complexity to achieve $ \\epsilon $-approximate second-order optimality which have shown to be tight. Our Hessian approximation conditions constitute a major relaxation over the existing ones in the literature. Consequently, we are able to show that such mild conditions allow for the construction of the approximate Hessian"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07164","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-17T23:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DJjjm1AvGlt5DTCs4RKACAEM8F8MiOZU3KHmwcwyZzR7kLodXEhBO3YizpZ4P4WYjATNZPWPMLz3220O6+bNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:26:47.127866Z"},"content_sha256":"dbd039de75866a3aa61f79aded9e1fac139da2786e14a97fc3eada83204f3006","schema_version":"1.0","event_id":"sha256:dbd039de75866a3aa61f79aded9e1fac139da2786e14a97fc3eada83204f3006"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQVV5VTN4EJC5ZVSDW5L4ISRLW/bundle.json","state_url":"https://pith.science/pith/MQVV5VTN4EJC5ZVSDW5L4ISRLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQVV5VTN4EJC5ZVSDW5L4ISRLW/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-23T12:26:47Z","links":{"resolver":"https://pith.science/pith/MQVV5VTN4EJC5ZVSDW5L4ISRLW","bundle":"https://pith.science/pith/MQVV5VTN4EJC5ZVSDW5L4ISRLW/bundle.json","state":"https://pith.science/pith/MQVV5VTN4EJC5ZVSDW5L4ISRLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQVV5VTN4EJC5ZVSDW5L4ISRLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MQVV5VTN4EJC5ZVSDW5L4ISRLW","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":"7a141ca1e6e51c2d8ed539a61d5d506c8f3f57036203e741d78ac75d012a33a9","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-23T19:40:55Z","title_canon_sha256":"3b7ffe2b2c7c5b78810644eca630da160e143cd5474b964dc7d3d164025803b2"},"schema_version":"1.0","source":{"id":"1708.07164","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07164","created_at":"2026-05-17T23:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07164v4","created_at":"2026-05-17T23:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07164","created_at":"2026-05-17T23:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"MQVV5VTN4EJC","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MQVV5VTN4EJC5ZVS","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MQVV5VTN","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:dbd039de75866a3aa61f79aded9e1fac139da2786e14a97fc3eada83204f3006","target":"graph","created_at":"2026-05-17T23:46:22Z","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":"We consider variants of trust-region and cubic regularization methods for non-convex optimization, in which the Hessian matrix is approximated. Under mild conditions on the inexact Hessian, and using approximate solution of the corresponding sub-problems, we provide iteration complexity to achieve $ \\epsilon $-approximate second-order optimality which have shown to be tight. Our Hessian approximation conditions constitute a major relaxation over the existing ones in the literature. Consequently, we are able to show that such mild conditions allow for the construction of the approximate Hessian","authors_text":"Fred Roosta, Michael W. Mahoney, Peng Xu","cross_cats":["cs.CC","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-23T19:40:55Z","title":"Newton-Type Methods for Non-Convex Optimization Under Inexact Hessian Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07164","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:4e28359313e58db83bd35d24c311974c939b6ce785837fb992f287de16543fe3","target":"record","created_at":"2026-05-17T23:46:22Z","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":"7a141ca1e6e51c2d8ed539a61d5d506c8f3f57036203e741d78ac75d012a33a9","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-23T19:40:55Z","title_canon_sha256":"3b7ffe2b2c7c5b78810644eca630da160e143cd5474b964dc7d3d164025803b2"},"schema_version":"1.0","source":{"id":"1708.07164","kind":"arxiv","version":4}},"canonical_sha256":"642b5ed66de1122ee6b21dbabe22515db35a499262a4aaf2aa01a7d3442b3364","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"642b5ed66de1122ee6b21dbabe22515db35a499262a4aaf2aa01a7d3442b3364","first_computed_at":"2026-05-17T23:46:22.084165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:22.084165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DXk5Y3fchp4Fy6hGwokMIgazN66MrBtHnh2RebMF540fOfxTXnfPVBF6v0jyDO8UHl9lFIxLA7ys+bpmUbqaDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:22.084702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07164","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e28359313e58db83bd35d24c311974c939b6ce785837fb992f287de16543fe3","sha256:dbd039de75866a3aa61f79aded9e1fac139da2786e14a97fc3eada83204f3006"],"state_sha256":"a31a27897fe20715e35af1c502ac8db0ff40d84c14483b9721abe13b6f11af08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uPszPFNAWjSWG26cGI2gYDrajC3GgqpwQtu83LcAkXTgXItsQ/JODFuwAIaTdaaFLMhtf/e6ReXgQqiIdR9AAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:26:47.129837Z","bundle_sha256":"02beefc5552319602a8209923e82e9ea1df454ad17218536e0663b08045b0933"}}