{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KAQIRWIYD7MDQSYCBN4LCKH7ZU","short_pith_number":"pith:KAQIRWIY","canonical_record":{"source":{"id":"1802.06925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-20T00:53:34Z","cross_cats_sorted":[],"title_canon_sha256":"b5698ac469547df3346eacb7354863d9c424428f6d3524ffaf3d9107ac46b4f6","abstract_canon_sha256":"c2b17cadb24fb31268af9429d49c8ea6e63ca2f5b9feb276600c7fb6c066bf3d"},"schema_version":"1.0"},"canonical_sha256":"502088d9181fd8384b020b78b128ffcd1929bf628bd811dea11e1459dbc4f24c","source":{"kind":"arxiv","id":"1802.06925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06925","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06925v1","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06925","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"KAQIRWIYD7MD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KAQIRWIYD7MDQSYC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KAQIRWIY","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KAQIRWIYD7MDQSYCBN4LCKH7ZU","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-20T00:53:34Z","cross_cats_sorted":[],"title_canon_sha256":"b5698ac469547df3346eacb7354863d9c424428f6d3524ffaf3d9107ac46b4f6","abstract_canon_sha256":"c2b17cadb24fb31268af9429d49c8ea6e63ca2f5b9feb276600c7fb6c066bf3d"},"schema_version":"1.0"},"canonical_sha256":"502088d9181fd8384b020b78b128ffcd1929bf628bd811dea11e1459dbc4f24c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:53.979065Z","signature_b64":"E3gKjpnylR0bh0h8eXUKjM/kIpUV8Q2ttwRFHjW2Mt47QkdDjnw/s2jHQP8osqdnQ13N1Ky1Lclu5psvb8a6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"502088d9181fd8384b020b78b128ffcd1929bf628bd811dea11e1459dbc4f24c","last_reissued_at":"2026-05-18T00:22:53.978529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:53.978529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06925","source_version":1,"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:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71vnfHAUjaZTs8BIBwI6VX++MyqQgEIvWG2i7dYAicL/JA3GgfYYFOyZAQqXUMVOqD0UGHV5bC10f6DYOeN4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:45:53.891419Z"},"content_sha256":"273cbf6f3cccfb09d381e23edfc2d2aab28f0ec234eb818c719407dca87f9223","schema_version":"1.0","event_id":"sha256:273cbf6f3cccfb09d381e23edfc2d2aab28f0ec234eb818c719407dca87f9223"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KAQIRWIYD7MDQSYCBN4LCKH7ZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inexact Non-Convex Newton-Type Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Farbod Roosta-Khorasani, Michael W. Mahoney, Peng Xu, Zhewei Yao","submitted_at":"2018-02-20T00:53:34Z","abstract_excerpt":"For solving large-scale non-convex problems, we propose inexact variants of trust region and adaptive cubic regularization methods, which, to increase efficiency, incorporate various approximations. In particular, in addition to approximate sub-problem solves, both the Hessian and the gradient are suitably approximated. Using rather mild conditions on such approximations, we show that our proposed inexact methods achieve similar optimal worst-case iteration complexities as the exact counterparts. Our proposed algorithms, and their respective theoretical analysis, do not require knowledge of an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06925","kind":"arxiv","version":1},"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:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtWFGwWDUpx/oQqcFbWt0W07iot1xgrSZ1aPcQ/6d93TP6sWGf2JwlYW1LW+Tn4g72iiSGDBNvsza6TTfhXVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:45:53.891757Z"},"content_sha256":"00ae318b0ebe149fc0139fa2116900fbd61566e682a39c42b62d6338a0a60283","schema_version":"1.0","event_id":"sha256:00ae318b0ebe149fc0139fa2116900fbd61566e682a39c42b62d6338a0a60283"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU/bundle.json","state_url":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU/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-05T09:45:53Z","links":{"resolver":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU","bundle":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU/bundle.json","state":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KAQIRWIYD7MDQSYCBN4LCKH7ZU","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":"c2b17cadb24fb31268af9429d49c8ea6e63ca2f5b9feb276600c7fb6c066bf3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-20T00:53:34Z","title_canon_sha256":"b5698ac469547df3346eacb7354863d9c424428f6d3524ffaf3d9107ac46b4f6"},"schema_version":"1.0","source":{"id":"1802.06925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06925","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06925v1","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06925","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"KAQIRWIYD7MD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KAQIRWIYD7MDQSYC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KAQIRWIY","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:00ae318b0ebe149fc0139fa2116900fbd61566e682a39c42b62d6338a0a60283","target":"graph","created_at":"2026-05-18T00:22:53Z","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":"For solving large-scale non-convex problems, we propose inexact variants of trust region and adaptive cubic regularization methods, which, to increase efficiency, incorporate various approximations. In particular, in addition to approximate sub-problem solves, both the Hessian and the gradient are suitably approximated. Using rather mild conditions on such approximations, we show that our proposed inexact methods achieve similar optimal worst-case iteration complexities as the exact counterparts. Our proposed algorithms, and their respective theoretical analysis, do not require knowledge of an","authors_text":"Farbod Roosta-Khorasani, Michael W. Mahoney, Peng Xu, Zhewei Yao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-20T00:53:34Z","title":"Inexact Non-Convex Newton-Type Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06925","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:273cbf6f3cccfb09d381e23edfc2d2aab28f0ec234eb818c719407dca87f9223","target":"record","created_at":"2026-05-18T00:22:53Z","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":"c2b17cadb24fb31268af9429d49c8ea6e63ca2f5b9feb276600c7fb6c066bf3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-20T00:53:34Z","title_canon_sha256":"b5698ac469547df3346eacb7354863d9c424428f6d3524ffaf3d9107ac46b4f6"},"schema_version":"1.0","source":{"id":"1802.06925","kind":"arxiv","version":1}},"canonical_sha256":"502088d9181fd8384b020b78b128ffcd1929bf628bd811dea11e1459dbc4f24c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"502088d9181fd8384b020b78b128ffcd1929bf628bd811dea11e1459dbc4f24c","first_computed_at":"2026-05-18T00:22:53.978529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:53.978529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E3gKjpnylR0bh0h8eXUKjM/kIpUV8Q2ttwRFHjW2Mt47QkdDjnw/s2jHQP8osqdnQ13N1Ky1Lclu5psvb8a6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:53.979065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:273cbf6f3cccfb09d381e23edfc2d2aab28f0ec234eb818c719407dca87f9223","sha256:00ae318b0ebe149fc0139fa2116900fbd61566e682a39c42b62d6338a0a60283"],"state_sha256":"1e9ab0c4aeec72e442b2365104bd8ec93c70f3859213b7584a8a31e921c3e87a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgPTJRw08OrB++zgieY20JxmlijSNM8+8feEi8hfrjZgF+zO2mKIpUR608OxjTFLjo8uP/NGEG/UZpyCrjzvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:45:53.893708Z","bundle_sha256":"b7e77551797ef68786d93dc83dada59a71700213f3d2d0c8bf6aef39daa895f9"}}