{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EY7CVO2XCZQ7GAU5XHYACMQ37I","short_pith_number":"pith:EY7CVO2X","canonical_record":{"source":{"id":"1512.07628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-23T20:57:20Z","cross_cats_sorted":[],"title_canon_sha256":"edb668c0f0c259c68c3fa3109fac96c692a8e88f5f0cfaa92163f4a9190f6805","abstract_canon_sha256":"7c757209ec475680209e304b453d623f26d013b505976337f70e6ec1e4f66794"},"schema_version":"1.0"},"canonical_sha256":"263e2abb571661f3029db9f001321bfa344d2837f4e4f8ffb662ffd38a280d72","source":{"kind":"arxiv","id":"1512.07628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07628","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07628v1","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07628","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"EY7CVO2XCZQ7","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EY7CVO2XCZQ7GAU5","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EY7CVO2X","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EY7CVO2XCZQ7GAU5XHYACMQ37I","target":"record","payload":{"canonical_record":{"source":{"id":"1512.07628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-23T20:57:20Z","cross_cats_sorted":[],"title_canon_sha256":"edb668c0f0c259c68c3fa3109fac96c692a8e88f5f0cfaa92163f4a9190f6805","abstract_canon_sha256":"7c757209ec475680209e304b453d623f26d013b505976337f70e6ec1e4f66794"},"schema_version":"1.0"},"canonical_sha256":"263e2abb571661f3029db9f001321bfa344d2837f4e4f8ffb662ffd38a280d72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:49.248328Z","signature_b64":"joHTqawRdmH3LAXg5I97vqmJU8KSpZSyssmFTDBCwo5MsYztENfhqE51NJtz7jaQ8DNcpJit91LGb5kEBhBbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"263e2abb571661f3029db9f001321bfa344d2837f4e4f8ffb662ffd38a280d72","last_reissued_at":"2026-05-18T01:23:49.247780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:49.247780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.07628","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:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXqiae2PPqXAwU4vcomTyiXIV2OJRhF/+joploTKIZ8OrFHDCgzlPHV0SJXO0X1ryJHBez7v5hbLuh81GjuTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:01:46.867399Z"},"content_sha256":"d3932d48ffb62c2350ca58ea7074a8d47225c851b57320545a309313c7f21820","schema_version":"1.0","event_id":"sha256:d3932d48ffb62c2350ca58ea7074a8d47225c851b57320545a309313c7f21820"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EY7CVO2XCZQ7GAU5XHYACMQ37I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Nonglobal Minima for Solving Large Scale Extended Trust Region Subproblems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akram Taati, Henry Wolkowicz, Maziar Salahi","submitted_at":"2015-12-23T20:57:20Z","abstract_excerpt":"We study large scale extended trust region subproblems (eTRS) i.e., the minimization of a general quadratic function subject to a norm constraint, known as the trust region subproblem (TRS) but with an additional linear inequality constraint. It is well known that strong duality holds for the TRS and that there are efficient algorithms for solving large scale TRS problems. It is also known that there can exist at most one local non-global minimizer (LNGM) for TRS. We combine this with known characterizations for strong duality for eTRS and, in particular, connect this with the so-called hard c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07628","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:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKFmt+UhVecAg2DBaxYDjvzJbZDwyp1p+z+WlT8Nb8P5kIVhElbRPJmvyKteRBbWD7fgrssl+YR9OgJgVBEmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:01:46.867740Z"},"content_sha256":"0de7fdc73db6f7a1e9b239d927c71aa9a286833826cfc4eab1138297551fe611","schema_version":"1.0","event_id":"sha256:0de7fdc73db6f7a1e9b239d927c71aa9a286833826cfc4eab1138297551fe611"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EY7CVO2XCZQ7GAU5XHYACMQ37I/bundle.json","state_url":"https://pith.science/pith/EY7CVO2XCZQ7GAU5XHYACMQ37I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EY7CVO2XCZQ7GAU5XHYACMQ37I/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-04T10:01:46Z","links":{"resolver":"https://pith.science/pith/EY7CVO2XCZQ7GAU5XHYACMQ37I","bundle":"https://pith.science/pith/EY7CVO2XCZQ7GAU5XHYACMQ37I/bundle.json","state":"https://pith.science/pith/EY7CVO2XCZQ7GAU5XHYACMQ37I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EY7CVO2XCZQ7GAU5XHYACMQ37I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EY7CVO2XCZQ7GAU5XHYACMQ37I","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":"7c757209ec475680209e304b453d623f26d013b505976337f70e6ec1e4f66794","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-23T20:57:20Z","title_canon_sha256":"edb668c0f0c259c68c3fa3109fac96c692a8e88f5f0cfaa92163f4a9190f6805"},"schema_version":"1.0","source":{"id":"1512.07628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07628","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07628v1","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07628","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"EY7CVO2XCZQ7","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EY7CVO2XCZQ7GAU5","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EY7CVO2X","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:0de7fdc73db6f7a1e9b239d927c71aa9a286833826cfc4eab1138297551fe611","target":"graph","created_at":"2026-05-18T01:23:49Z","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":"We study large scale extended trust region subproblems (eTRS) i.e., the minimization of a general quadratic function subject to a norm constraint, known as the trust region subproblem (TRS) but with an additional linear inequality constraint. It is well known that strong duality holds for the TRS and that there are efficient algorithms for solving large scale TRS problems. It is also known that there can exist at most one local non-global minimizer (LNGM) for TRS. We combine this with known characterizations for strong duality for eTRS and, in particular, connect this with the so-called hard c","authors_text":"Akram Taati, Henry Wolkowicz, Maziar Salahi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-23T20:57:20Z","title":"Local Nonglobal Minima for Solving Large Scale Extended Trust Region Subproblems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07628","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:d3932d48ffb62c2350ca58ea7074a8d47225c851b57320545a309313c7f21820","target":"record","created_at":"2026-05-18T01:23:49Z","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":"7c757209ec475680209e304b453d623f26d013b505976337f70e6ec1e4f66794","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-23T20:57:20Z","title_canon_sha256":"edb668c0f0c259c68c3fa3109fac96c692a8e88f5f0cfaa92163f4a9190f6805"},"schema_version":"1.0","source":{"id":"1512.07628","kind":"arxiv","version":1}},"canonical_sha256":"263e2abb571661f3029db9f001321bfa344d2837f4e4f8ffb662ffd38a280d72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"263e2abb571661f3029db9f001321bfa344d2837f4e4f8ffb662ffd38a280d72","first_computed_at":"2026-05-18T01:23:49.247780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:49.247780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"joHTqawRdmH3LAXg5I97vqmJU8KSpZSyssmFTDBCwo5MsYztENfhqE51NJtz7jaQ8DNcpJit91LGb5kEBhBbAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:49.248328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3932d48ffb62c2350ca58ea7074a8d47225c851b57320545a309313c7f21820","sha256:0de7fdc73db6f7a1e9b239d927c71aa9a286833826cfc4eab1138297551fe611"],"state_sha256":"32ff21faedb96c718b50e8a638e63a2e6cb4236a403be98d34f35ccd3b2fb5d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SiXkJ0zjc1Xz6UUEzaA1Lk70nmz07KmZga0ZQn/lLI7wmE+6Qhah+eJrXa2xAlasq7BZULugxrg3GLOC6ILxBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T10:01:46.869814Z","bundle_sha256":"c75995db97fee7097daa02f1743adf61f7bb725447dd26d190ab9f28d9eb4b4b"}}