{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7ZMUBS5SNRDBJEOKZZ5MYYNBUO","short_pith_number":"pith:7ZMUBS5S","schema_version":"1.0","canonical_sha256":"fe5940cbb26c461491cace7acc61a1a3821e1bf8ad0c9358c08b768142dba218","source":{"kind":"arxiv","id":"1709.10276","version":1},"attestation_state":"computed","paper":{"title":"Fast online low-rank tensor subspace tracking by CP decomposition using recursive least squares from incomplete observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.NA","authors_text":"Hiroyuki Kasai","submitted_at":"2017-09-29T08:12:39Z","abstract_excerpt":"We consider the problem of online subspace tracking of a partially observed high-dimensional data stream corrupted by noise, where we assume that the data lie in a low-dimensional linear subspace. This problem is cast as an online low-rank tensor completion problem. We propose a novel online tensor subspace tracking algorithm based on the CANDECOMP/PARAFAC (CP) decomposition, dubbed OnLine Low-rank Subspace tracking by TEnsor CP Decomposition (OLSTEC). The proposed algorithm especially addresses the case in which the subspace of interest is dynamically time-varying. To this end, we build up ou"},"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":"1709.10276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-09-29T08:12:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eb70999dc48e04025e50d74ff7077f4e3a063407d822397120ae2761c4a69cab","abstract_canon_sha256":"1a82ae730c102f07292f9ef0fa0b359e619e2a5ad3e261b7996a0a0ca0f8c87c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:03.671932Z","signature_b64":"elRCGvEMZGSU1dZ12xwEfk+U8lekEqJ631/bKO9cZ0WYEhhBADVu1beoO//sN18Af/+8H8IwsmCy8PtqST0KBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe5940cbb26c461491cace7acc61a1a3821e1bf8ad0c9358c08b768142dba218","last_reissued_at":"2026-05-18T00:34:03.671411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:03.671411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast online low-rank tensor subspace tracking by CP decomposition using recursive least squares from incomplete observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.NA","authors_text":"Hiroyuki Kasai","submitted_at":"2017-09-29T08:12:39Z","abstract_excerpt":"We consider the problem of online subspace tracking of a partially observed high-dimensional data stream corrupted by noise, where we assume that the data lie in a low-dimensional linear subspace. This problem is cast as an online low-rank tensor completion problem. We propose a novel online tensor subspace tracking algorithm based on the CANDECOMP/PARAFAC (CP) decomposition, dubbed OnLine Low-rank Subspace tracking by TEnsor CP Decomposition (OLSTEC). The proposed algorithm especially addresses the case in which the subspace of interest is dynamically time-varying. To this end, we build up ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10276","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":"1709.10276","created_at":"2026-05-18T00:34:03.671495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.10276v1","created_at":"2026-05-18T00:34:03.671495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10276","created_at":"2026-05-18T00:34:03.671495+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZMUBS5SNRDB","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZMUBS5SNRDBJEOK","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZMUBS5S","created_at":"2026-05-18T12:31:05.417338+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/7ZMUBS5SNRDBJEOKZZ5MYYNBUO","json":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO.json","graph_json":"https://pith.science/api/pith-number/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/graph.json","events_json":"https://pith.science/api/pith-number/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/events.json","paper":"https://pith.science/paper/7ZMUBS5S"},"agent_actions":{"view_html":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO","download_json":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO.json","view_paper":"https://pith.science/paper/7ZMUBS5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.10276&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/action/storage_attestation","attest_author":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/action/author_attestation","sign_citation":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/action/citation_signature","submit_replication":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/action/replication_record"}},"created_at":"2026-05-18T00:34:03.671495+00:00","updated_at":"2026-05-18T00:34:03.671495+00:00"}