{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VYXDYMY5RVAKOPR7LSF7SFK4XA","short_pith_number":"pith:VYXDYMY5","schema_version":"1.0","canonical_sha256":"ae2e3c331d8d40a73e3f5c8bf9155cb80af5adf8cb6be4686c9a18fd1b1a6868","source":{"kind":"arxiv","id":"2102.09693","version":1},"attestation_state":"computed","paper":{"title":"A comparison of eigenvalue-based algorithms and the generalized Lanczos trust-region algorithm for Solving the trust-region subproblem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Fa Wang, Zhongxiao Jia","submitted_at":"2021-02-19T00:42:35Z","abstract_excerpt":"Solving the trust-region subproblem (TRS) plays a key role in numerical optimization and many other applications. Based on a fundamental result that the solution of TRS of size $n$ is mathematically equivalent to finding the rightmost eigenpair of a certain matrix pair of size $2n$, eigenvalue-based methods are promising due to their simplicity. For $n$ large, the implicitly restarted Arnoldi (IRA) and refined Arnoldi (IRRA) algorithms are well suited for this eigenproblem. For a reasonable comparison of overall efficiency of the algorithms for solving TRS directly and eigenvalue-based algorit"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2102.09693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2021-02-19T00:42:35Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"cbccd0cb62b38f16764996989b0f6d1c11b32780dee14fcedd5f8291e1c8e558","abstract_canon_sha256":"4bdc4ebef88596a87b92cc1379b97c42ed4f2bd78d456f5bb12e28ebd8852a16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:30.131909Z","signature_b64":"xEO0cvBUT5umvHf9vadsH04/mPZj2iIZppOvbVHkdXkAxQz3jPFOfEvWpGqD6h0QXSSOA06uIkIW0eHpdoRDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae2e3c331d8d40a73e3f5c8bf9155cb80af5adf8cb6be4686c9a18fd1b1a6868","last_reissued_at":"2026-07-05T02:16:30.131527Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:30.131527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A comparison of eigenvalue-based algorithms and the generalized Lanczos trust-region algorithm for Solving the trust-region subproblem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Fa Wang, Zhongxiao Jia","submitted_at":"2021-02-19T00:42:35Z","abstract_excerpt":"Solving the trust-region subproblem (TRS) plays a key role in numerical optimization and many other applications. Based on a fundamental result that the solution of TRS of size $n$ is mathematically equivalent to finding the rightmost eigenpair of a certain matrix pair of size $2n$, eigenvalue-based methods are promising due to their simplicity. For $n$ large, the implicitly restarted Arnoldi (IRA) and refined Arnoldi (IRRA) algorithms are well suited for this eigenproblem. For a reasonable comparison of overall efficiency of the algorithms for solving TRS directly and eigenvalue-based algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.09693","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.09693/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2102.09693","created_at":"2026-07-05T02:16:30.131575+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.09693v1","created_at":"2026-07-05T02:16:30.131575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.09693","created_at":"2026-07-05T02:16:30.131575+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYXDYMY5RVAK","created_at":"2026-07-05T02:16:30.131575+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYXDYMY5RVAKOPR7","created_at":"2026-07-05T02:16:30.131575+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYXDYMY5","created_at":"2026-07-05T02:16:30.131575+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VYXDYMY5RVAKOPR7LSF7SFK4XA","json":"https://pith.science/pith/VYXDYMY5RVAKOPR7LSF7SFK4XA.json","graph_json":"https://pith.science/api/pith-number/VYXDYMY5RVAKOPR7LSF7SFK4XA/graph.json","events_json":"https://pith.science/api/pith-number/VYXDYMY5RVAKOPR7LSF7SFK4XA/events.json","paper":"https://pith.science/paper/VYXDYMY5"},"agent_actions":{"view_html":"https://pith.science/pith/VYXDYMY5RVAKOPR7LSF7SFK4XA","download_json":"https://pith.science/pith/VYXDYMY5RVAKOPR7LSF7SFK4XA.json","view_paper":"https://pith.science/paper/VYXDYMY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.09693&json=true","fetch_graph":"https://pith.science/api/pith-number/VYXDYMY5RVAKOPR7LSF7SFK4XA/graph.json","fetch_events":"https://pith.science/api/pith-number/VYXDYMY5RVAKOPR7LSF7SFK4XA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYXDYMY5RVAKOPR7LSF7SFK4XA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYXDYMY5RVAKOPR7LSF7SFK4XA/action/storage_attestation","attest_author":"https://pith.science/pith/VYXDYMY5RVAKOPR7LSF7SFK4XA/action/author_attestation","sign_citation":"https://pith.science/pith/VYXDYMY5RVAKOPR7LSF7SFK4XA/action/citation_signature","submit_replication":"https://pith.science/pith/VYXDYMY5RVAKOPR7LSF7SFK4XA/action/replication_record"}},"created_at":"2026-07-05T02:16:30.131575+00:00","updated_at":"2026-07-05T02:16:30.131575+00:00"}