{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QSC2BZQUSOXBLWRGDT2C55LN42","short_pith_number":"pith:QSC2BZQU","canonical_record":{"source":{"id":"1807.07563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-19T17:59:37Z","cross_cats_sorted":[],"title_canon_sha256":"3f3c1330f82adeb6b5068fe6a639b7f3d32a034d904fbaaf3ab2a740f55271dd","abstract_canon_sha256":"c6b58388cf51a68254f8c2221552b78b09664b4b49e81a704ba983f50897359e"},"schema_version":"1.0"},"canonical_sha256":"8485a0e61493ae15da261cf42ef56de6b546b4563a5ac0ba2c1aba9b509881b0","source":{"kind":"arxiv","id":"1807.07563","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07563","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07563v2","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07563","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"QSC2BZQUSOXB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QSC2BZQUSOXBLWRG","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QSC2BZQU","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QSC2BZQUSOXBLWRGDT2C55LN42","target":"record","payload":{"canonical_record":{"source":{"id":"1807.07563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-19T17:59:37Z","cross_cats_sorted":[],"title_canon_sha256":"3f3c1330f82adeb6b5068fe6a639b7f3d32a034d904fbaaf3ab2a740f55271dd","abstract_canon_sha256":"c6b58388cf51a68254f8c2221552b78b09664b4b49e81a704ba983f50897359e"},"schema_version":"1.0"},"canonical_sha256":"8485a0e61493ae15da261cf42ef56de6b546b4563a5ac0ba2c1aba9b509881b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:03.053352Z","signature_b64":"xiZrSu76U727noGO3xbJA04m06o44k7hnSH/rZUYSFTkRhkTsQ2xBehtbRat2hmQ2pD6FBRpXuvq6vhxxEy0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8485a0e61493ae15da261cf42ef56de6b546b4563a5ac0ba2c1aba9b509881b0","last_reissued_at":"2026-05-17T23:47:03.052641Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:03.052641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.07563","source_version":2,"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-17T23:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+n7JoFg/scQxLH3pVRRy8sqggcsaTvMB/H4lD6AvCabZaCP8dR+dQ63J9NzKnY4KVeplpzWyie75SNa3fzoYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:11:09.588918Z"},"content_sha256":"9512a30d0ace65e4f774665f4192677a2bf0e405783dc852b65feb812a5d8ff2","schema_version":"1.0","event_id":"sha256:9512a30d0ace65e4f774665f4192677a2bf0e405783dc852b65feb812a5d8ff2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QSC2BZQUSOXBLWRGDT2C55LN42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear-time algorithm for generalized trust region subproblems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Duan Li, Rujun Jiang","submitted_at":"2018-07-19T17:59:37Z","abstract_excerpt":"In this paper, we provide the first provable linear-time (in the number of non-zero entries of the input) algorithm for approximately solving the generalized trust region subproblem (GTRS) of minimizing a quadratic function over a quadratic constraint under some regular conditions. Our algorithm is motivated by and extends a recent linear-time algorithm for the trust region subproblem by Hazan and Koren [Math. Program., 2016, 158(1-2): 363-381]. However, due to the non-convexity and non-compactness of the feasible region, such an extension is nontrivial. Our main contribution is to demonstrate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07563","kind":"arxiv","version":2},"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-17T23:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"op5NTkkDMvD7PWDwG5dEEAUekkwgGRDCL8CFygePCJGSJ8MGOVrAeIuZUqZFHVH2Xk98Rfw3xG46YdsMyu2mCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:11:09.589256Z"},"content_sha256":"e0356eea6d688dc44452fa49bcd1ddeb589832b69fe06ce14d0461eaabd2b1fc","schema_version":"1.0","event_id":"sha256:e0356eea6d688dc44452fa49bcd1ddeb589832b69fe06ce14d0461eaabd2b1fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42/bundle.json","state_url":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSC2BZQUSOXBLWRGDT2C55LN42/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-05T12:11:09Z","links":{"resolver":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42","bundle":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42/bundle.json","state":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSC2BZQUSOXBLWRGDT2C55LN42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QSC2BZQUSOXBLWRGDT2C55LN42","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":"c6b58388cf51a68254f8c2221552b78b09664b4b49e81a704ba983f50897359e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-19T17:59:37Z","title_canon_sha256":"3f3c1330f82adeb6b5068fe6a639b7f3d32a034d904fbaaf3ab2a740f55271dd"},"schema_version":"1.0","source":{"id":"1807.07563","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07563","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07563v2","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07563","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"QSC2BZQUSOXB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QSC2BZQUSOXBLWRG","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QSC2BZQU","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:e0356eea6d688dc44452fa49bcd1ddeb589832b69fe06ce14d0461eaabd2b1fc","target":"graph","created_at":"2026-05-17T23:47:03Z","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":"In this paper, we provide the first provable linear-time (in the number of non-zero entries of the input) algorithm for approximately solving the generalized trust region subproblem (GTRS) of minimizing a quadratic function over a quadratic constraint under some regular conditions. Our algorithm is motivated by and extends a recent linear-time algorithm for the trust region subproblem by Hazan and Koren [Math. Program., 2016, 158(1-2): 363-381]. However, due to the non-convexity and non-compactness of the feasible region, such an extension is nontrivial. Our main contribution is to demonstrate","authors_text":"Duan Li, Rujun Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-19T17:59:37Z","title":"A linear-time algorithm for generalized trust region subproblems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07563","kind":"arxiv","version":2},"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:9512a30d0ace65e4f774665f4192677a2bf0e405783dc852b65feb812a5d8ff2","target":"record","created_at":"2026-05-17T23:47:03Z","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":"c6b58388cf51a68254f8c2221552b78b09664b4b49e81a704ba983f50897359e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-19T17:59:37Z","title_canon_sha256":"3f3c1330f82adeb6b5068fe6a639b7f3d32a034d904fbaaf3ab2a740f55271dd"},"schema_version":"1.0","source":{"id":"1807.07563","kind":"arxiv","version":2}},"canonical_sha256":"8485a0e61493ae15da261cf42ef56de6b546b4563a5ac0ba2c1aba9b509881b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8485a0e61493ae15da261cf42ef56de6b546b4563a5ac0ba2c1aba9b509881b0","first_computed_at":"2026-05-17T23:47:03.052641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:03.052641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xiZrSu76U727noGO3xbJA04m06o44k7hnSH/rZUYSFTkRhkTsQ2xBehtbRat2hmQ2pD6FBRpXuvq6vhxxEy0AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:03.053352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07563","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9512a30d0ace65e4f774665f4192677a2bf0e405783dc852b65feb812a5d8ff2","sha256:e0356eea6d688dc44452fa49bcd1ddeb589832b69fe06ce14d0461eaabd2b1fc"],"state_sha256":"de004a2ef9d8f373d3b76305779ccce4e71fce1143b8c5328802f3bc04cea0b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C5FolRUMHt3C3Hsth6zRsPVGpJTVooZ7LIAJ00PbSwtfWrNvlt+pRBavGg/l82BBVAt0UFSdU/shSlAUsAAtDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:11:09.600103Z","bundle_sha256":"d7afab78f8132c82f2cba8c1ac84c6cbbe56919712923fbd1c487fe4f72d52bb"}}