{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3EQ32YBUDAXARQWW6SJX47KJCB","short_pith_number":"pith:3EQ32YBU","schema_version":"1.0","canonical_sha256":"d921bd6034182e08c2d6f4937e7d49106a79754ae18c6d0474d74bc96aaf4dc1","source":{"kind":"arxiv","id":"1810.11972","version":1},"attestation_state":"computed","paper":{"title":"A fast algorithm for globally solving Tikhonov regularized total least squares problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Longfei Wang, Meijia Yang, Yong Xia","submitted_at":"2018-10-29T06:27:52Z","abstract_excerpt":"The total least squares problem with the general Tikhonov regularization can be reformulated as a one-dimensional parametric minimization problem (PM), where each parameterized function evaluation corresponds to solving an n-dimensional trust region subproblem. Under a mild assumption, the parametric function is differentiable and then an efficient bisection method has been proposed for solving (PM) in literature. In the first part of this paper, we show that the bisection algorithm can be greatly improved by reducing the initially estimated interval covering the optimal parameter. It is obser"},"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":"1810.11972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-29T06:27:52Z","cross_cats_sorted":[],"title_canon_sha256":"9b120ab6a8790d9ae747bf32f2c4a5fbcdbbd52701f8bae016341fe82b8aff14","abstract_canon_sha256":"b18f33ade3fbd7a6caf0910d1f74af81db14c1ddf0725108d25603ca4c798ecc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:06.825030Z","signature_b64":"Cpne4DN+sTBXPTMmPcqaUhoqQN+w4n2irApkOaPPptWaOBg4HB2kiOKwxH8neoVKudsmp9OXm8LQXJ9pdtmLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d921bd6034182e08c2d6f4937e7d49106a79754ae18c6d0474d74bc96aaf4dc1","last_reissued_at":"2026-05-18T00:02:06.824334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:06.824334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast algorithm for globally solving Tikhonov regularized total least squares problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Longfei Wang, Meijia Yang, Yong Xia","submitted_at":"2018-10-29T06:27:52Z","abstract_excerpt":"The total least squares problem with the general Tikhonov regularization can be reformulated as a one-dimensional parametric minimization problem (PM), where each parameterized function evaluation corresponds to solving an n-dimensional trust region subproblem. Under a mild assumption, the parametric function is differentiable and then an efficient bisection method has been proposed for solving (PM) in literature. In the first part of this paper, we show that the bisection algorithm can be greatly improved by reducing the initially estimated interval covering the optimal parameter. It is obser"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11972","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.11972","created_at":"2026-05-18T00:02:06.824436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11972v1","created_at":"2026-05-18T00:02:06.824436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11972","created_at":"2026-05-18T00:02:06.824436+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EQ32YBUDAXA","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EQ32YBUDAXARQWW","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EQ32YBU","created_at":"2026-05-18T12:32:02.567920+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/3EQ32YBUDAXARQWW6SJX47KJCB","json":"https://pith.science/pith/3EQ32YBUDAXARQWW6SJX47KJCB.json","graph_json":"https://pith.science/api/pith-number/3EQ32YBUDAXARQWW6SJX47KJCB/graph.json","events_json":"https://pith.science/api/pith-number/3EQ32YBUDAXARQWW6SJX47KJCB/events.json","paper":"https://pith.science/paper/3EQ32YBU"},"agent_actions":{"view_html":"https://pith.science/pith/3EQ32YBUDAXARQWW6SJX47KJCB","download_json":"https://pith.science/pith/3EQ32YBUDAXARQWW6SJX47KJCB.json","view_paper":"https://pith.science/paper/3EQ32YBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11972&json=true","fetch_graph":"https://pith.science/api/pith-number/3EQ32YBUDAXARQWW6SJX47KJCB/graph.json","fetch_events":"https://pith.science/api/pith-number/3EQ32YBUDAXARQWW6SJX47KJCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EQ32YBUDAXARQWW6SJX47KJCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EQ32YBUDAXARQWW6SJX47KJCB/action/storage_attestation","attest_author":"https://pith.science/pith/3EQ32YBUDAXARQWW6SJX47KJCB/action/author_attestation","sign_citation":"https://pith.science/pith/3EQ32YBUDAXARQWW6SJX47KJCB/action/citation_signature","submit_replication":"https://pith.science/pith/3EQ32YBUDAXARQWW6SJX47KJCB/action/replication_record"}},"created_at":"2026-05-18T00:02:06.824436+00:00","updated_at":"2026-05-18T00:02:06.824436+00:00"}