{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GDAK47GOW5CVYAHPVUNIEL2S7P","short_pith_number":"pith:GDAK47GO","canonical_record":{"source":{"id":"1309.3000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-11T23:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"7c0876ce400d9a4da03a03e63efaaec45a57deeb68e8ac5412afbc8fcca8405b","abstract_canon_sha256":"c42d6218fdfa872cea9b373b87e08c13a1e7e7a2da2a41d5466f07f6547dab75"},"schema_version":"1.0"},"canonical_sha256":"30c0ae7cceb7455c00efad1a822f52fbd5d9387574f592546e237823917b609a","source":{"kind":"arxiv","id":"1309.3000","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3000","created_at":"2026-05-18T03:13:33Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3000v1","created_at":"2026-05-18T03:13:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3000","created_at":"2026-05-18T03:13:33Z"},{"alias_kind":"pith_short_12","alias_value":"GDAK47GOW5CV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GDAK47GOW5CVYAHP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GDAK47GO","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GDAK47GOW5CVYAHPVUNIEL2S7P","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-11T23:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"7c0876ce400d9a4da03a03e63efaaec45a57deeb68e8ac5412afbc8fcca8405b","abstract_canon_sha256":"c42d6218fdfa872cea9b373b87e08c13a1e7e7a2da2a41d5466f07f6547dab75"},"schema_version":"1.0"},"canonical_sha256":"30c0ae7cceb7455c00efad1a822f52fbd5d9387574f592546e237823917b609a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:33.139556Z","signature_b64":"PED9pSZ62JM47KiLDxZWZ30NPjwL7C9SWoZzsNIKXDUNpOgbSAjrxPzdGm0vcSPyVe/TFf0rrReRbc4MPHanBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c0ae7cceb7455c00efad1a822f52fbd5d9387574f592546e237823917b609a","last_reissued_at":"2026-05-18T03:13:33.138552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:33.138552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3000","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-18T03:13:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BpRUp7rcPf0NMrzD/qRTdYUmn+/apxmw/AyR7mkxCA69RHY4uuP727cX/AxNrccKoJ8eJdijfCX+01PTaIfpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:02:29.199471Z"},"content_sha256":"8b6c6f042521d12e1b89075f299243228bbda1abc40af69468b76407f9e3297f","schema_version":"1.0","event_id":"sha256:8b6c6f042521d12e1b89075f299243228bbda1abc40af69468b76407f9e3297f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GDAK47GOW5CVYAHPVUNIEL2S7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trust--Region Problems with Linear Inequality Constraints: Exact SDP Relaxation, Global Optimality and Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"G. Li, V. Jeyakumar","submitted_at":"2013-09-11T23:20:36Z","abstract_excerpt":"The trust-region problem, which minimizes a nonconvex quadratic function over a ball, is a key subproblem in trust-region methods for solving nonlinear optimization problems. It enjoys many attractive properties such as an exact semi-definite linear programming relaxation (SDP relaxation) and strong duality. Unfortunately, such properties do not, in general, hold for an extended trust-region problem having extra linear constraints. This paper shows that two useful and powerful features of the classical trust-region problem continue to hold for an extended trust-region problem with linear inequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3000","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-18T03:13:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aLSZv3K6qlpaYTV3wlvnPYoJ+KERr7at/rhpU+/knuzmSiFSZFF6Dm33ID1MKolHAX4g/toOCGi7gcqW9/UZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:02:29.199811Z"},"content_sha256":"c1ce4e1637433e214cc0577c9852ead54a24d39b13c7d996d76492bcd0a764dc","schema_version":"1.0","event_id":"sha256:c1ce4e1637433e214cc0577c9852ead54a24d39b13c7d996d76492bcd0a764dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P/bundle.json","state_url":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDAK47GOW5CVYAHPVUNIEL2S7P/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-26T01:02:29Z","links":{"resolver":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P","bundle":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P/bundle.json","state":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDAK47GOW5CVYAHPVUNIEL2S7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GDAK47GOW5CVYAHPVUNIEL2S7P","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":"c42d6218fdfa872cea9b373b87e08c13a1e7e7a2da2a41d5466f07f6547dab75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-11T23:20:36Z","title_canon_sha256":"7c0876ce400d9a4da03a03e63efaaec45a57deeb68e8ac5412afbc8fcca8405b"},"schema_version":"1.0","source":{"id":"1309.3000","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3000","created_at":"2026-05-18T03:13:33Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3000v1","created_at":"2026-05-18T03:13:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3000","created_at":"2026-05-18T03:13:33Z"},{"alias_kind":"pith_short_12","alias_value":"GDAK47GOW5CV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GDAK47GOW5CVYAHP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GDAK47GO","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:c1ce4e1637433e214cc0577c9852ead54a24d39b13c7d996d76492bcd0a764dc","target":"graph","created_at":"2026-05-18T03:13: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":"The trust-region problem, which minimizes a nonconvex quadratic function over a ball, is a key subproblem in trust-region methods for solving nonlinear optimization problems. It enjoys many attractive properties such as an exact semi-definite linear programming relaxation (SDP relaxation) and strong duality. Unfortunately, such properties do not, in general, hold for an extended trust-region problem having extra linear constraints. This paper shows that two useful and powerful features of the classical trust-region problem continue to hold for an extended trust-region problem with linear inequ","authors_text":"G. Li, V. Jeyakumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-11T23:20:36Z","title":"Trust--Region Problems with Linear Inequality Constraints: Exact SDP Relaxation, Global Optimality and Robust Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3000","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:8b6c6f042521d12e1b89075f299243228bbda1abc40af69468b76407f9e3297f","target":"record","created_at":"2026-05-18T03:13: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":"c42d6218fdfa872cea9b373b87e08c13a1e7e7a2da2a41d5466f07f6547dab75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-11T23:20:36Z","title_canon_sha256":"7c0876ce400d9a4da03a03e63efaaec45a57deeb68e8ac5412afbc8fcca8405b"},"schema_version":"1.0","source":{"id":"1309.3000","kind":"arxiv","version":1}},"canonical_sha256":"30c0ae7cceb7455c00efad1a822f52fbd5d9387574f592546e237823917b609a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30c0ae7cceb7455c00efad1a822f52fbd5d9387574f592546e237823917b609a","first_computed_at":"2026-05-18T03:13:33.138552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:33.138552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PED9pSZ62JM47KiLDxZWZ30NPjwL7C9SWoZzsNIKXDUNpOgbSAjrxPzdGm0vcSPyVe/TFf0rrReRbc4MPHanBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:33.139556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3000","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b6c6f042521d12e1b89075f299243228bbda1abc40af69468b76407f9e3297f","sha256:c1ce4e1637433e214cc0577c9852ead54a24d39b13c7d996d76492bcd0a764dc"],"state_sha256":"252267a92e12dbacb87b7f83ef83c741c06b349139e202e45761466b3f0da0e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3g8R5QcBTrg/SG1pZuf6dJC0YXoN+B0cNxrzd/1Z0LOExsKYjeCUvX6lJ2yyC3gTaVQpbMQNfHYNzMcmGywBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:02:29.201760Z","bundle_sha256":"b299dd2650696a53ec68170fc8eb4b2d1338135e475cf5c3ea8defe4b002812a"}}