{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7ZMUBS5SNRDBJEOKZZ5MYYNBUO","short_pith_number":"pith:7ZMUBS5S","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"},"canonical_sha256":"fe5940cbb26c461491cace7acc61a1a3821e1bf8ad0c9358c08b768142dba218","source":{"kind":"arxiv","id":"1709.10276","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10276","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10276v1","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10276","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"pith_short_12","alias_value":"7ZMUBS5SNRDB","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7ZMUBS5SNRDBJEOK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7ZMUBS5S","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7ZMUBS5SNRDBJEOKZZ5MYYNBUO","target":"record","payload":{"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"},"canonical_sha256":"fe5940cbb26c461491cace7acc61a1a3821e1bf8ad0c9358c08b768142dba218","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"},"source_kind":"arxiv","source_id":"1709.10276","source_version":1,"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-18T00:34:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UpI/5OGKJZSPBqYdnyFfwCrKix71qPnqVPaaUK4cspiYRTZzjaWfYriuNWh9nssn2V2n8jn75LQn4pPBiYrgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:30:38.527036Z"},"content_sha256":"fed164b02704f2f2bd5d80e3c16253d6798249aeeea470b3e54337645f225d2a","schema_version":"1.0","event_id":"sha256:fed164b02704f2f2bd5d80e3c16253d6798249aeeea470b3e54337645f225d2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7ZMUBS5SNRDBJEOKZZ5MYYNBUO","target":"graph","payload":{"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"},"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-18T00:34:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajAI+8q2C+ZiJINO40cPLDAkuqvrACQ9R5jlX8AJuwRkFP+1vnwAAxukM5Tz8Jm6vbIkHfAT74yXkb7+N380AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:30:38.527864Z"},"content_sha256":"34ef94c3935b9e1e10f33f0166128eb9f74df2af674601a429b9799c80fc1b38","schema_version":"1.0","event_id":"sha256:34ef94c3935b9e1e10f33f0166128eb9f74df2af674601a429b9799c80fc1b38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/bundle.json","state_url":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/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-08-04T23:30:38Z","links":{"resolver":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO","bundle":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/bundle.json","state":"https://pith.science/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZMUBS5SNRDBJEOKZZ5MYYNBUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7ZMUBS5SNRDBJEOKZZ5MYYNBUO","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":"1a82ae730c102f07292f9ef0fa0b359e619e2a5ad3e261b7996a0a0ca0f8c87c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-09-29T08:12:39Z","title_canon_sha256":"eb70999dc48e04025e50d74ff7077f4e3a063407d822397120ae2761c4a69cab"},"schema_version":"1.0","source":{"id":"1709.10276","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10276","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10276v1","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10276","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"pith_short_12","alias_value":"7ZMUBS5SNRDB","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7ZMUBS5SNRDBJEOK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7ZMUBS5S","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:34ef94c3935b9e1e10f33f0166128eb9f74df2af674601a429b9799c80fc1b38","target":"graph","created_at":"2026-05-18T00:34: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":"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","authors_text":"Hiroyuki Kasai","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-09-29T08:12:39Z","title":"Fast online low-rank tensor subspace tracking by CP decomposition using recursive least squares from incomplete observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10276","kind":"arxiv","version":1},"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:fed164b02704f2f2bd5d80e3c16253d6798249aeeea470b3e54337645f225d2a","target":"record","created_at":"2026-05-18T00:34: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":"1a82ae730c102f07292f9ef0fa0b359e619e2a5ad3e261b7996a0a0ca0f8c87c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-09-29T08:12:39Z","title_canon_sha256":"eb70999dc48e04025e50d74ff7077f4e3a063407d822397120ae2761c4a69cab"},"schema_version":"1.0","source":{"id":"1709.10276","kind":"arxiv","version":1}},"canonical_sha256":"fe5940cbb26c461491cace7acc61a1a3821e1bf8ad0c9358c08b768142dba218","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe5940cbb26c461491cace7acc61a1a3821e1bf8ad0c9358c08b768142dba218","first_computed_at":"2026-05-18T00:34:03.671411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:03.671411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"elRCGvEMZGSU1dZ12xwEfk+U8lekEqJ631/bKO9cZ0WYEhhBADVu1beoO//sN18Af/+8H8IwsmCy8PtqST0KBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:03.671932Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.10276","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fed164b02704f2f2bd5d80e3c16253d6798249aeeea470b3e54337645f225d2a","sha256:34ef94c3935b9e1e10f33f0166128eb9f74df2af674601a429b9799c80fc1b38"],"state_sha256":"b3ad62730cfbb16ae2dbbe91670b9b11ab36c6a97f7dc510e2b8821340d441b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5P7rvcZbn1AtDzGNtnqx7vq1g/PozHdZkZk6+Hv/YCHstE3QdZ2y+bOIA1bbGCKYnyxpbiwC3DZLtz6pZ/2iCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T23:30:38.534437Z","bundle_sha256":"0e1bdc7ed025c2adc85c39987287c450885811c60b698e915c0d4da983f5ecdb"}}