{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MB4HEXUD7XTDFB3VOZJAH64LRP","short_pith_number":"pith:MB4HEXUD","canonical_record":{"source":{"id":"1603.05117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T14:32:30Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"4da1613f77d60cca973f48993c63a575d64e245c5b2bc27ec0441969115183d2","abstract_canon_sha256":"c2f7f12caf36fe62c0390371e05aec646a33cb2ebe62aa487ed0c8f13062fbad"},"schema_version":"1.0"},"canonical_sha256":"6078725e83fde6328775765203fb8b8bc1111964ba5f89615bd432a5684af420","source":{"kind":"arxiv","id":"1603.05117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05117","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05117v1","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05117","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"MB4HEXUD7XTD","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MB4HEXUD7XTDFB3V","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MB4HEXUD","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MB4HEXUD7XTDFB3VOZJAH64LRP","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T14:32:30Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"4da1613f77d60cca973f48993c63a575d64e245c5b2bc27ec0441969115183d2","abstract_canon_sha256":"c2f7f12caf36fe62c0390371e05aec646a33cb2ebe62aa487ed0c8f13062fbad"},"schema_version":"1.0"},"canonical_sha256":"6078725e83fde6328775765203fb8b8bc1111964ba5f89615bd432a5684af420","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:58.008172Z","signature_b64":"1aIb+q16O+lxoPenfxBBgBnBNONOV8jvclKuDLitasRVEEGJIgrgZgPR+GlezCdjWbBbE5QS5D/UgCvu3CpNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6078725e83fde6328775765203fb8b8bc1111964ba5f89615bd432a5684af420","last_reissued_at":"2026-05-18T01:18:58.007758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:58.007758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05117","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-18T01:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FcJJlX4bKrWQ/ZUKIXClOyi6kUv4dQ8VHviz7Uytpp3Y4QxqtXCoxXGbCEL5GFJLqcbJ+6z9PExdl5OlHvwzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:54:41.622097Z"},"content_sha256":"9c900e1bf01cf98cb298979d115c44f025f9d0abf185a3b6077c3591d9ee5add","schema_version":"1.0","event_id":"sha256:9c900e1bf01cf98cb298979d115c44f025f9d0abf185a3b6077c3591d9ee5add"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MB4HEXUD7XTDFB3VOZJAH64LRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm for Solving Quadratic Optimization Problems with Nonlinear Equality Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Hans Butler, Mircea Lazar, Tuan T. Nguyen","submitted_at":"2016-03-16T14:32:30Z","abstract_excerpt":"The classical method to solve a quadratic optimization problem with nonlinear equality constraints is to solve the Karush-Kuhn-Tucker (KKT) optimality conditions using Newton's method. This approach however is usually computationally demanding, especially for large-scale problems. This paper presents a new computationally efficient algorithm for solving quadratic optimization problems with nonlinear equality constraints. It is proven that the proposed algorithm converges locally to a solution of the KKT optimality conditions. Two relevant application problems, fitting of ellipses and state ref"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05117","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-18T01:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIe91/DzN8mTTzZ46kz527ZPopbwOps+dTUEm4AGQsxj8zdUMCRvgwW2OOPEa9xcP0tayKWEHVXVlp3gMDxDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:54:41.622451Z"},"content_sha256":"d400fe9727276c90fc9933b00d0c7b224e319c24d00db9d5d06dcf8a40caae21","schema_version":"1.0","event_id":"sha256:d400fe9727276c90fc9933b00d0c7b224e319c24d00db9d5d06dcf8a40caae21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MB4HEXUD7XTDFB3VOZJAH64LRP/bundle.json","state_url":"https://pith.science/pith/MB4HEXUD7XTDFB3VOZJAH64LRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MB4HEXUD7XTDFB3VOZJAH64LRP/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-28T04:54:41Z","links":{"resolver":"https://pith.science/pith/MB4HEXUD7XTDFB3VOZJAH64LRP","bundle":"https://pith.science/pith/MB4HEXUD7XTDFB3VOZJAH64LRP/bundle.json","state":"https://pith.science/pith/MB4HEXUD7XTDFB3VOZJAH64LRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MB4HEXUD7XTDFB3VOZJAH64LRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MB4HEXUD7XTDFB3VOZJAH64LRP","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":"c2f7f12caf36fe62c0390371e05aec646a33cb2ebe62aa487ed0c8f13062fbad","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T14:32:30Z","title_canon_sha256":"4da1613f77d60cca973f48993c63a575d64e245c5b2bc27ec0441969115183d2"},"schema_version":"1.0","source":{"id":"1603.05117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05117","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05117v1","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05117","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"MB4HEXUD7XTD","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MB4HEXUD7XTDFB3V","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MB4HEXUD","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:d400fe9727276c90fc9933b00d0c7b224e319c24d00db9d5d06dcf8a40caae21","target":"graph","created_at":"2026-05-18T01:18:58Z","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":"The classical method to solve a quadratic optimization problem with nonlinear equality constraints is to solve the Karush-Kuhn-Tucker (KKT) optimality conditions using Newton's method. This approach however is usually computationally demanding, especially for large-scale problems. This paper presents a new computationally efficient algorithm for solving quadratic optimization problems with nonlinear equality constraints. It is proven that the proposed algorithm converges locally to a solution of the KKT optimality conditions. Two relevant application problems, fitting of ellipses and state ref","authors_text":"Hans Butler, Mircea Lazar, Tuan T. Nguyen","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T14:32:30Z","title":"An Algorithm for Solving Quadratic Optimization Problems with Nonlinear Equality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05117","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:9c900e1bf01cf98cb298979d115c44f025f9d0abf185a3b6077c3591d9ee5add","target":"record","created_at":"2026-05-18T01:18:58Z","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":"c2f7f12caf36fe62c0390371e05aec646a33cb2ebe62aa487ed0c8f13062fbad","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T14:32:30Z","title_canon_sha256":"4da1613f77d60cca973f48993c63a575d64e245c5b2bc27ec0441969115183d2"},"schema_version":"1.0","source":{"id":"1603.05117","kind":"arxiv","version":1}},"canonical_sha256":"6078725e83fde6328775765203fb8b8bc1111964ba5f89615bd432a5684af420","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6078725e83fde6328775765203fb8b8bc1111964ba5f89615bd432a5684af420","first_computed_at":"2026-05-18T01:18:58.007758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:58.007758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1aIb+q16O+lxoPenfxBBgBnBNONOV8jvclKuDLitasRVEEGJIgrgZgPR+GlezCdjWbBbE5QS5D/UgCvu3CpNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:58.008172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c900e1bf01cf98cb298979d115c44f025f9d0abf185a3b6077c3591d9ee5add","sha256:d400fe9727276c90fc9933b00d0c7b224e319c24d00db9d5d06dcf8a40caae21"],"state_sha256":"a0c8e31df7a933f3e47ad7eb21e493a9613b4bc6e4e6d29a49172525b7ce9347"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6iP6S+GJPyGnIcsbvhuif+GmM7DvT055Ii3L2HA6dmB/cSm5b8Fj+FpA6owD3ftVaZkFvwaeKJDXhxQHqBAKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T04:54:41.624183Z","bundle_sha256":"305e5b91b0273135a6505a7f5a9dc5cb2ea76766d286fc2136e4a867903e7262"}}