{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IXWOOFPILIL7E2LOOSCUQFYLGL","short_pith_number":"pith:IXWOOFPI","canonical_record":{"source":{"id":"1710.05782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-16T15:26:39Z","cross_cats_sorted":[],"title_canon_sha256":"d82468e33d3a67e6f873a67148c04e63759825ab6455fe65df7cefe96461057d","abstract_canon_sha256":"43ef35634220ca3a20e264c7a7a44975ac646cfa875a73723ae8671e08793602"},"schema_version":"1.0"},"canonical_sha256":"45ece715e85a17f2696e748548170b32f410dc87fe29c85b4e18e6bb0abfa3f9","source":{"kind":"arxiv","id":"1710.05782","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05782","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05782v1","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05782","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"IXWOOFPILIL7","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IXWOOFPILIL7E2LO","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IXWOOFPI","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IXWOOFPILIL7E2LOOSCUQFYLGL","target":"record","payload":{"canonical_record":{"source":{"id":"1710.05782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-16T15:26:39Z","cross_cats_sorted":[],"title_canon_sha256":"d82468e33d3a67e6f873a67148c04e63759825ab6455fe65df7cefe96461057d","abstract_canon_sha256":"43ef35634220ca3a20e264c7a7a44975ac646cfa875a73723ae8671e08793602"},"schema_version":"1.0"},"canonical_sha256":"45ece715e85a17f2696e748548170b32f410dc87fe29c85b4e18e6bb0abfa3f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:48.193475Z","signature_b64":"KZHFEdMrHUhJSmLeJNflrodk2gOrldgcgNDyvji+N8Kyd21PNYKuHeU2HObe86KUNeIaN3Ajhz/a4/Y3mqW9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45ece715e85a17f2696e748548170b32f410dc87fe29c85b4e18e6bb0abfa3f9","last_reissued_at":"2026-05-18T00:32:48.192814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:48.192814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.05782","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:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgytlAiJyff6aAT4K4h30aeTQDIFwnKC6MBbOqeSHuqIq1fLjEEnuKpYQyLe1HzQ0FERcWHKYGkGitCBtN3fAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:44:59.855252Z"},"content_sha256":"323b30727f54e98b9b9b443a53512aa0617e78b3642155d253ca9b004d99a572","schema_version":"1.0","event_id":"sha256:323b30727f54e98b9b9b443a53512aa0617e78b3642155d253ca9b004d99a572"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IXWOOFPILIL7E2LOOSCUQFYLGL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Second-Order Methods with Cubic Regularization Under Inexact Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Han Liu, Saeed Ghadimi, Tong Zhang","submitted_at":"2017-10-16T15:26:39Z","abstract_excerpt":"In this paper, we generalize (accelerated) Newton's method with cubic regularization under inexact second-order information for (strongly) convex optimization problems. Under mild assumptions, we provide global rate of convergence of these methods and show the explicit dependence of the rate of convergence on the problem parameters. While the complexity bounds of our presented algorithms are theoretically worse than those of their exact counterparts, they are at least as good as those of the optimal first-order methods. Our numerical experiments also show that using inexact Hessians can signif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05782","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:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Oq3n6fxO/EeUaneCDRWGloMuCiUfhm37QWp1sxwiJuZr1TTdAbrzfnLTUvfaXMvSwfdQKVH1eu1o8c9ImdIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:44:59.855668Z"},"content_sha256":"cb0822b5eb8b67f2e0264f0df918cc24146be8e94ae897af8ff5cbf7b8a1d649","schema_version":"1.0","event_id":"sha256:cb0822b5eb8b67f2e0264f0df918cc24146be8e94ae897af8ff5cbf7b8a1d649"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXWOOFPILIL7E2LOOSCUQFYLGL/bundle.json","state_url":"https://pith.science/pith/IXWOOFPILIL7E2LOOSCUQFYLGL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXWOOFPILIL7E2LOOSCUQFYLGL/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-05-28T16:44:59Z","links":{"resolver":"https://pith.science/pith/IXWOOFPILIL7E2LOOSCUQFYLGL","bundle":"https://pith.science/pith/IXWOOFPILIL7E2LOOSCUQFYLGL/bundle.json","state":"https://pith.science/pith/IXWOOFPILIL7E2LOOSCUQFYLGL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXWOOFPILIL7E2LOOSCUQFYLGL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IXWOOFPILIL7E2LOOSCUQFYLGL","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":"43ef35634220ca3a20e264c7a7a44975ac646cfa875a73723ae8671e08793602","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-16T15:26:39Z","title_canon_sha256":"d82468e33d3a67e6f873a67148c04e63759825ab6455fe65df7cefe96461057d"},"schema_version":"1.0","source":{"id":"1710.05782","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05782","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05782v1","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05782","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"IXWOOFPILIL7","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IXWOOFPILIL7E2LO","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IXWOOFPI","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:cb0822b5eb8b67f2e0264f0df918cc24146be8e94ae897af8ff5cbf7b8a1d649","target":"graph","created_at":"2026-05-18T00:32:48Z","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":"In this paper, we generalize (accelerated) Newton's method with cubic regularization under inexact second-order information for (strongly) convex optimization problems. Under mild assumptions, we provide global rate of convergence of these methods and show the explicit dependence of the rate of convergence on the problem parameters. While the complexity bounds of our presented algorithms are theoretically worse than those of their exact counterparts, they are at least as good as those of the optimal first-order methods. Our numerical experiments also show that using inexact Hessians can signif","authors_text":"Han Liu, Saeed Ghadimi, Tong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-16T15:26:39Z","title":"Second-Order Methods with Cubic Regularization Under Inexact Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05782","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:323b30727f54e98b9b9b443a53512aa0617e78b3642155d253ca9b004d99a572","target":"record","created_at":"2026-05-18T00:32:48Z","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":"43ef35634220ca3a20e264c7a7a44975ac646cfa875a73723ae8671e08793602","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-16T15:26:39Z","title_canon_sha256":"d82468e33d3a67e6f873a67148c04e63759825ab6455fe65df7cefe96461057d"},"schema_version":"1.0","source":{"id":"1710.05782","kind":"arxiv","version":1}},"canonical_sha256":"45ece715e85a17f2696e748548170b32f410dc87fe29c85b4e18e6bb0abfa3f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45ece715e85a17f2696e748548170b32f410dc87fe29c85b4e18e6bb0abfa3f9","first_computed_at":"2026-05-18T00:32:48.192814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:48.192814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KZHFEdMrHUhJSmLeJNflrodk2gOrldgcgNDyvji+N8Kyd21PNYKuHeU2HObe86KUNeIaN3Ajhz/a4/Y3mqW9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:48.193475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05782","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:323b30727f54e98b9b9b443a53512aa0617e78b3642155d253ca9b004d99a572","sha256:cb0822b5eb8b67f2e0264f0df918cc24146be8e94ae897af8ff5cbf7b8a1d649"],"state_sha256":"2ec62d57b1283dfafef7d3b233f2a3d78e9d757abc6e363dd4b552bb4cb257c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a72WrzEHAt4W0Wv2GnrNsVXMOOvnGskywQF8f37ySsqvK8ImaSAQ+AMUM9EGvKN8JVsqupIpDQJWqMnAyJufBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:44:59.857736Z","bundle_sha256":"55f1608d67f029acfe51ab7376c854ac6921b2c2d4b02b147f02fb59c7cb4a1f"}}