{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3S5FXIR37SHOCOB6Y6JLRM4NKM","short_pith_number":"pith:3S5FXIR3","schema_version":"1.0","canonical_sha256":"dcba5ba23bfc8ee1383ec792b8b38d532f9d69a9033ea7389f675fdd5caee8c8","source":{"kind":"arxiv","id":"1408.6141","version":2},"attestation_state":"computed","paper":{"title":"Recursive Total Least-Squares Algorithm Based on Inverse Power Method and Dichotomous Coordinate-Descent Iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SY","authors_text":"Kutluy{\\i}l Do\\u{g}an\\c{c}ay, Reza Arablouei, Stefan Werner","submitted_at":"2014-08-25T17:40:44Z","abstract_excerpt":"We develop a recursive total least-squares (RTLS) algorithm for errors-in-variables system identification utilizing the inverse power method and the dichotomous coordinate-descent (DCD) iterations. The proposed algorithm, called DCD-RTLS, outperforms the previously-proposed RTLS algorithms, which are based on the line-search method, with reduced computational complexity. We perform a comprehensive analysis of the DCD-RTLS algorithm and show that it is asymptotically unbiased as well as being stable in the mean. We also find a lower bound for the forgetting factor that ensures mean-square stabi"},"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":"1408.6141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-08-25T17:40:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3b150c8ccf5f30325a31a7811a1693c8e67a78ced9f8f763dbf98099c621215c","abstract_canon_sha256":"e5ea54d6e904207f6d99128c2abba93c1722382dd0c09659276f8ceed5ce6716"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:13.007943Z","signature_b64":"W71vQmUCV4q4sFjKe+QC2g30ZWbWaCTLaNYmFharNU49PXQKCa3wZLPWxJ3zNnDHS7iVeQ3t9vttijG/6vymAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcba5ba23bfc8ee1383ec792b8b38d532f9d69a9033ea7389f675fdd5caee8c8","last_reissued_at":"2026-05-18T01:42:13.007434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:13.007434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Total Least-Squares Algorithm Based on Inverse Power Method and Dichotomous Coordinate-Descent Iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SY","authors_text":"Kutluy{\\i}l Do\\u{g}an\\c{c}ay, Reza Arablouei, Stefan Werner","submitted_at":"2014-08-25T17:40:44Z","abstract_excerpt":"We develop a recursive total least-squares (RTLS) algorithm for errors-in-variables system identification utilizing the inverse power method and the dichotomous coordinate-descent (DCD) iterations. The proposed algorithm, called DCD-RTLS, outperforms the previously-proposed RTLS algorithms, which are based on the line-search method, with reduced computational complexity. We perform a comprehensive analysis of the DCD-RTLS algorithm and show that it is asymptotically unbiased as well as being stable in the mean. We also find a lower bound for the forgetting factor that ensures mean-square stabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6141","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.6141","created_at":"2026-05-18T01:42:13.007505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6141v2","created_at":"2026-05-18T01:42:13.007505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6141","created_at":"2026-05-18T01:42:13.007505+00:00"},{"alias_kind":"pith_short_12","alias_value":"3S5FXIR37SHO","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3S5FXIR37SHOCOB6","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3S5FXIR3","created_at":"2026-05-18T12:28:11.866339+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/3S5FXIR37SHOCOB6Y6JLRM4NKM","json":"https://pith.science/pith/3S5FXIR37SHOCOB6Y6JLRM4NKM.json","graph_json":"https://pith.science/api/pith-number/3S5FXIR37SHOCOB6Y6JLRM4NKM/graph.json","events_json":"https://pith.science/api/pith-number/3S5FXIR37SHOCOB6Y6JLRM4NKM/events.json","paper":"https://pith.science/paper/3S5FXIR3"},"agent_actions":{"view_html":"https://pith.science/pith/3S5FXIR37SHOCOB6Y6JLRM4NKM","download_json":"https://pith.science/pith/3S5FXIR37SHOCOB6Y6JLRM4NKM.json","view_paper":"https://pith.science/paper/3S5FXIR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6141&json=true","fetch_graph":"https://pith.science/api/pith-number/3S5FXIR37SHOCOB6Y6JLRM4NKM/graph.json","fetch_events":"https://pith.science/api/pith-number/3S5FXIR37SHOCOB6Y6JLRM4NKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3S5FXIR37SHOCOB6Y6JLRM4NKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3S5FXIR37SHOCOB6Y6JLRM4NKM/action/storage_attestation","attest_author":"https://pith.science/pith/3S5FXIR37SHOCOB6Y6JLRM4NKM/action/author_attestation","sign_citation":"https://pith.science/pith/3S5FXIR37SHOCOB6Y6JLRM4NKM/action/citation_signature","submit_replication":"https://pith.science/pith/3S5FXIR37SHOCOB6Y6JLRM4NKM/action/replication_record"}},"created_at":"2026-05-18T01:42:13.007505+00:00","updated_at":"2026-05-18T01:42:13.007505+00:00"}