{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4ZZDUTLAIAPDBMU4G4MQO4NJBM","short_pith_number":"pith:4ZZDUTLA","canonical_record":{"source":{"id":"1912.04365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-09T20:40:41Z","cross_cats_sorted":[],"title_canon_sha256":"02db141d326649bd5c01d734de7813d56bb534b13b27fcf19cf297288f36c786","abstract_canon_sha256":"ce43c3ee8e381ae686f0abd6bedcf0c8b27c260cf84ed0005a2146b68cc2de22"},"schema_version":"1.0"},"canonical_sha256":"e6723a4d60401e30b29c37190771a90b3b3965d293fec7e1fad1ae9650688887","source":{"kind":"arxiv","id":"1912.04365","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.04365","created_at":"2026-07-05T01:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1912.04365v3","created_at":"2026-07-05T01:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.04365","created_at":"2026-07-05T01:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"4ZZDUTLAIAPD","created_at":"2026-07-05T01:53:07Z"},{"alias_kind":"pith_short_16","alias_value":"4ZZDUTLAIAPDBMU4","created_at":"2026-07-05T01:53:07Z"},{"alias_kind":"pith_short_8","alias_value":"4ZZDUTLA","created_at":"2026-07-05T01:53:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4ZZDUTLAIAPDBMU4G4MQO4NJBM","target":"record","payload":{"canonical_record":{"source":{"id":"1912.04365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-09T20:40:41Z","cross_cats_sorted":[],"title_canon_sha256":"02db141d326649bd5c01d734de7813d56bb534b13b27fcf19cf297288f36c786","abstract_canon_sha256":"ce43c3ee8e381ae686f0abd6bedcf0c8b27c260cf84ed0005a2146b68cc2de22"},"schema_version":"1.0"},"canonical_sha256":"e6723a4d60401e30b29c37190771a90b3b3965d293fec7e1fad1ae9650688887","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:07.562884Z","signature_b64":"qIvQSP8p6fimvwxQa8QQLcuobxS8LuXuHLuNPH6+xttqDdMcsg7v1uHVGR+Nr3xxT9wSMWbvfIF8NpYYRHwFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6723a4d60401e30b29c37190771a90b3b3965d293fec7e1fad1ae9650688887","last_reissued_at":"2026-07-05T01:53:07.562477Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:07.562477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.04365","source_version":3,"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-07-05T01:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aPjBVnbDP6TY+e/sSmFRfs+JNi75f4rWOOHYRytZM+f63XTGawd+Dkj07mjNRWBQy83iClll1NJy2ALRP4i9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:17:58.997441Z"},"content_sha256":"f1d8c05fbbf32548e41ae7fd030a2875577204756d229ef16805319c8174825e","schema_version":"1.0","event_id":"sha256:f1d8c05fbbf32548e41ae7fd030a2875577204756d229ef16805319c8174825e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4ZZDUTLAIAPDBMU4G4MQO4NJBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cl\\'ement Royer, Daniel P. Robinson, Frank E. Curtis, Stephen J. Wright","submitted_at":"2019-12-09T20:40:41Z","abstract_excerpt":"Worst-case complexity guarantees for nonconvex optimization algorithms have been a topic of growing interest. Multiple frameworks that achieve the best known complexity bounds among a broad class of first- and second-order strategies have been proposed. These methods have often been designed primarily with complexity guarantees in mind and, as a result, represent a departure from the algorithms that have proved to be the most effective in practice. In this paper, we consider trust-region Newton methods, one of the most popular classes of algorithms for solving nonconvex optimization problems. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.04365","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.04365/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TeESkcDlP9rbDDl3uxoHMBUASJ3DxETlydzt3RD4ZFsks0Rq6WVw9lInv/16qyR+EBXs0+72ikLdjLDUFRl/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:17:58.997964Z"},"content_sha256":"bbaa800e7e4d47146602ce78c3c4a2ee810b37a58b177487289d4ef8b8a0c420","schema_version":"1.0","event_id":"sha256:bbaa800e7e4d47146602ce78c3c4a2ee810b37a58b177487289d4ef8b8a0c420"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM/bundle.json","state_url":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM/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-08-04T10:17:58Z","links":{"resolver":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM","bundle":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM/bundle.json","state":"https://pith.science/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZZDUTLAIAPDBMU4G4MQO4NJBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4ZZDUTLAIAPDBMU4G4MQO4NJBM","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":"ce43c3ee8e381ae686f0abd6bedcf0c8b27c260cf84ed0005a2146b68cc2de22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-09T20:40:41Z","title_canon_sha256":"02db141d326649bd5c01d734de7813d56bb534b13b27fcf19cf297288f36c786"},"schema_version":"1.0","source":{"id":"1912.04365","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.04365","created_at":"2026-07-05T01:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1912.04365v3","created_at":"2026-07-05T01:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.04365","created_at":"2026-07-05T01:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"4ZZDUTLAIAPD","created_at":"2026-07-05T01:53:07Z"},{"alias_kind":"pith_short_16","alias_value":"4ZZDUTLAIAPDBMU4","created_at":"2026-07-05T01:53:07Z"},{"alias_kind":"pith_short_8","alias_value":"4ZZDUTLA","created_at":"2026-07-05T01:53:07Z"}],"graph_snapshots":[{"event_id":"sha256:bbaa800e7e4d47146602ce78c3c4a2ee810b37a58b177487289d4ef8b8a0c420","target":"graph","created_at":"2026-07-05T01:53:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.04365/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Worst-case complexity guarantees for nonconvex optimization algorithms have been a topic of growing interest. Multiple frameworks that achieve the best known complexity bounds among a broad class of first- and second-order strategies have been proposed. These methods have often been designed primarily with complexity guarantees in mind and, as a result, represent a departure from the algorithms that have proved to be the most effective in practice. In this paper, we consider trust-region Newton methods, one of the most popular classes of algorithms for solving nonconvex optimization problems. ","authors_text":"Cl\\'ement Royer, Daniel P. Robinson, Frank E. Curtis, Stephen J. Wright","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-09T20:40:41Z","title":"Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.04365","kind":"arxiv","version":3},"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:f1d8c05fbbf32548e41ae7fd030a2875577204756d229ef16805319c8174825e","target":"record","created_at":"2026-07-05T01:53:07Z","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":"ce43c3ee8e381ae686f0abd6bedcf0c8b27c260cf84ed0005a2146b68cc2de22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-09T20:40:41Z","title_canon_sha256":"02db141d326649bd5c01d734de7813d56bb534b13b27fcf19cf297288f36c786"},"schema_version":"1.0","source":{"id":"1912.04365","kind":"arxiv","version":3}},"canonical_sha256":"e6723a4d60401e30b29c37190771a90b3b3965d293fec7e1fad1ae9650688887","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6723a4d60401e30b29c37190771a90b3b3965d293fec7e1fad1ae9650688887","first_computed_at":"2026-07-05T01:53:07.562477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:53:07.562477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qIvQSP8p6fimvwxQa8QQLcuobxS8LuXuHLuNPH6+xttqDdMcsg7v1uHVGR+Nr3xxT9wSMWbvfIF8NpYYRHwFCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:53:07.562884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.04365","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1d8c05fbbf32548e41ae7fd030a2875577204756d229ef16805319c8174825e","sha256:bbaa800e7e4d47146602ce78c3c4a2ee810b37a58b177487289d4ef8b8a0c420"],"state_sha256":"e2be75bc3414bad0d6d658d2cac8ef3e0421ee3e76bd46c4b45d52e31a82b156"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9g2mbIdC4DtekOKPueWuVevnFQNsaxwkTBtc8PInbMdstO/97HuiZtyNBgqSqI0dzNyFTfMeQwn+cvrefNLODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T10:17:59.001492Z","bundle_sha256":"9aa20a8085a84c9aba96a7c16a78367a4b24a5a8ca2336b830f20dbcd7782445"}}