{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZGF3RXF6FS7VQI3SEVWKCUCVZC","short_pith_number":"pith:ZGF3RXF6","canonical_record":{"source":{"id":"1704.03064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-10T21:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"0a83af99f579367f2fe55f64b12c627f1909bd2a0565350909b4dc72b9a6c5a3","abstract_canon_sha256":"d6c7eb514c18339830f40c902a1ded2b1366b97934970498e4f58cf7a71b71e8"},"schema_version":"1.0"},"canonical_sha256":"c98bb8dcbe2cbf582372256ca15055c8ae15bccb0708d7e8eb8c4cfe8ce7c7e3","source":{"kind":"arxiv","id":"1704.03064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03064","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03064v1","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03064","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZGF3RXF6FS7V","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZGF3RXF6FS7VQI3S","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZGF3RXF6","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZGF3RXF6FS7VQI3SEVWKCUCVZC","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-10T21:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"0a83af99f579367f2fe55f64b12c627f1909bd2a0565350909b4dc72b9a6c5a3","abstract_canon_sha256":"d6c7eb514c18339830f40c902a1ded2b1366b97934970498e4f58cf7a71b71e8"},"schema_version":"1.0"},"canonical_sha256":"c98bb8dcbe2cbf582372256ca15055c8ae15bccb0708d7e8eb8c4cfe8ce7c7e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:33.786977Z","signature_b64":"ps19OeCPdkzB1VzczbQuZmuLrgPBtCzbYP1stEDf3Vhfa2Iy//6+lh/gS5VK9Xf4fGYeG5+hLZ6ijVn3LY8MAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c98bb8dcbe2cbf582372256ca15055c8ae15bccb0708d7e8eb8c4cfe8ce7c7e3","last_reissued_at":"2026-05-18T00:46:33.786393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:33.786393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03064","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:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UMlIphWgdn12dw8Vj3CLBitg55Or/X37H6P3Z2HWSU7ToWB8DH6bZv/iJ01gozyEO6k+v1epRfMFiosgll+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:16:57.622961Z"},"content_sha256":"6efab01052430c35c1f15b3fda7fe15e2243ccc43c5b34b630061e0399ba8e42","schema_version":"1.0","event_id":"sha256:6efab01052430c35c1f15b3fda7fe15e2243ccc43c5b34b630061e0399ba8e42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZGF3RXF6FS7VQI3SEVWKCUCVZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Method to Guarantee Local Convergence for Sequential Quadratic Programming with Poor Hessian Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hans Butler, Mircea Lazar, Tuan T. Nguyen","submitted_at":"2017-04-10T21:51:09Z","abstract_excerpt":"Sequential Quadratic Programming (SQP) is a powerful class of algorithms for solving nonlinear optimization problems. Local convergence of SQP algorithms is guaranteed when the Hessian approximation used in each Quadratic Programming subproblem is close to the true Hessian. However, a good Hessian approximation can be expensive to compute. Low cost Hessian approximations only guarantee local convergence under some assumptions, which are not always satisfied in practice. To address this problem, this paper proposes a simple method to guarantee local convergence for SQP with poor Hessian approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03064","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:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMhbZU8JSsb+c587fqoX2hP87cC229SlXkV8ChntYXJ50PeXtF8gwWxiCDTJrIYNAuPV034c2/yZYm36R03UAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:16:57.623310Z"},"content_sha256":"d3ac1edf539ff6ff833e5a8e39a5702311c988e0f3fdbf0ca10e849a81ca1118","schema_version":"1.0","event_id":"sha256:d3ac1edf539ff6ff833e5a8e39a5702311c988e0f3fdbf0ca10e849a81ca1118"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGF3RXF6FS7VQI3SEVWKCUCVZC/bundle.json","state_url":"https://pith.science/pith/ZGF3RXF6FS7VQI3SEVWKCUCVZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGF3RXF6FS7VQI3SEVWKCUCVZC/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-28T07:16:57Z","links":{"resolver":"https://pith.science/pith/ZGF3RXF6FS7VQI3SEVWKCUCVZC","bundle":"https://pith.science/pith/ZGF3RXF6FS7VQI3SEVWKCUCVZC/bundle.json","state":"https://pith.science/pith/ZGF3RXF6FS7VQI3SEVWKCUCVZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGF3RXF6FS7VQI3SEVWKCUCVZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZGF3RXF6FS7VQI3SEVWKCUCVZC","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":"d6c7eb514c18339830f40c902a1ded2b1366b97934970498e4f58cf7a71b71e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-10T21:51:09Z","title_canon_sha256":"0a83af99f579367f2fe55f64b12c627f1909bd2a0565350909b4dc72b9a6c5a3"},"schema_version":"1.0","source":{"id":"1704.03064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03064","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03064v1","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03064","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZGF3RXF6FS7V","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZGF3RXF6FS7VQI3S","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZGF3RXF6","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:d3ac1edf539ff6ff833e5a8e39a5702311c988e0f3fdbf0ca10e849a81ca1118","target":"graph","created_at":"2026-05-18T00:46:33Z","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":"Sequential Quadratic Programming (SQP) is a powerful class of algorithms for solving nonlinear optimization problems. Local convergence of SQP algorithms is guaranteed when the Hessian approximation used in each Quadratic Programming subproblem is close to the true Hessian. However, a good Hessian approximation can be expensive to compute. Low cost Hessian approximations only guarantee local convergence under some assumptions, which are not always satisfied in practice. To address this problem, this paper proposes a simple method to guarantee local convergence for SQP with poor Hessian approxi","authors_text":"Hans Butler, Mircea Lazar, Tuan T. Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-10T21:51:09Z","title":"A Method to Guarantee Local Convergence for Sequential Quadratic Programming with Poor Hessian Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03064","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:6efab01052430c35c1f15b3fda7fe15e2243ccc43c5b34b630061e0399ba8e42","target":"record","created_at":"2026-05-18T00:46:33Z","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":"d6c7eb514c18339830f40c902a1ded2b1366b97934970498e4f58cf7a71b71e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-10T21:51:09Z","title_canon_sha256":"0a83af99f579367f2fe55f64b12c627f1909bd2a0565350909b4dc72b9a6c5a3"},"schema_version":"1.0","source":{"id":"1704.03064","kind":"arxiv","version":1}},"canonical_sha256":"c98bb8dcbe2cbf582372256ca15055c8ae15bccb0708d7e8eb8c4cfe8ce7c7e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c98bb8dcbe2cbf582372256ca15055c8ae15bccb0708d7e8eb8c4cfe8ce7c7e3","first_computed_at":"2026-05-18T00:46:33.786393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:33.786393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ps19OeCPdkzB1VzczbQuZmuLrgPBtCzbYP1stEDf3Vhfa2Iy//6+lh/gS5VK9Xf4fGYeG5+hLZ6ijVn3LY8MAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:33.786977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6efab01052430c35c1f15b3fda7fe15e2243ccc43c5b34b630061e0399ba8e42","sha256:d3ac1edf539ff6ff833e5a8e39a5702311c988e0f3fdbf0ca10e849a81ca1118"],"state_sha256":"4919ef697015e53b0baaa43515984618e548980bc73001992a77a2216a494cba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nd5iF8zC/wXh/Wgp/Trv0/3+JpyNvgbr2XU1C2omaLmTa88XNdFZPmPr2Uehc9feDaATI+W7R2CFDY+znw7gDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T07:16:57.625342Z","bundle_sha256":"a1f1d399f9994eb59e1575db6ee23d20f9ea69bf784730dd5c026ce33a2c6dad"}}