{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:L7OLBHRTJYEAQUTLSSASSVMFDK","short_pith_number":"pith:L7OLBHRT","schema_version":"1.0","canonical_sha256":"5fdcb09e334e0808526b94812955851ab235dbc8730c4e3fca09fbf8d4f0c8cc","source":{"kind":"arxiv","id":"2006.08030","version":3},"attestation_state":"computed","paper":{"title":"Fast Robust Subspace Tracking via PCA in Sparse Data-Dependent Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy","submitted_at":"2020-06-14T21:35:30Z","abstract_excerpt":"This work studies the robust subspace tracking (ST) problem. Robust ST can be simply understood as a (slow) time-varying subspace extension of robust PCA. It assumes that the true data lies in a low-dimensional subspace that is either fixed or changes slowly with time. The goal is to track the changing subspaces over time in the presence of additive sparse outliers and to do this quickly (with a short delay). We introduce a \"fast\" mini-batch robust ST solution that is provably correct under mild assumptions. Here \"fast\" means two things: (i) the subspace changes can be detected and the subspac"},"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":"2006.08030","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-14T21:35:30Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"7b0491321c3177b96ee59cbbdeb7b83f38803d0a4bc9ce3c52ea110993f9cf36","abstract_canon_sha256":"08dd1572e29c72b0a95365066faac15c724b354b77c04c59427c4a54b0282fd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:53:23.750598Z","signature_b64":"KHI/xioH/VWCztfithL85IQHyNCSB92cKGHQFIPJa9UoLRKMDIY0Hznc5jnOfJqLZG2hVY71KebSV2UQ84zBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fdcb09e334e0808526b94812955851ab235dbc8730c4e3fca09fbf8d4f0c8cc","last_reissued_at":"2026-07-05T04:53:23.750153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:53:23.750153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Robust Subspace Tracking via PCA in Sparse Data-Dependent Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy","submitted_at":"2020-06-14T21:35:30Z","abstract_excerpt":"This work studies the robust subspace tracking (ST) problem. Robust ST can be simply understood as a (slow) time-varying subspace extension of robust PCA. It assumes that the true data lies in a low-dimensional subspace that is either fixed or changes slowly with time. The goal is to track the changing subspaces over time in the presence of additive sparse outliers and to do this quickly (with a short delay). We introduce a \"fast\" mini-batch robust ST solution that is provably correct under mild assumptions. Here \"fast\" means two things: (i) the subspace changes can be detected and the subspac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08030","kind":"arxiv","version":3},"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/2006.08030/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":"2006.08030","created_at":"2026-07-05T04:53:23.750208+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.08030v3","created_at":"2026-07-05T04:53:23.750208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08030","created_at":"2026-07-05T04:53:23.750208+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7OLBHRTJYEA","created_at":"2026-07-05T04:53:23.750208+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7OLBHRTJYEAQUTL","created_at":"2026-07-05T04:53:23.750208+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7OLBHRT","created_at":"2026-07-05T04:53:23.750208+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/L7OLBHRTJYEAQUTLSSASSVMFDK","json":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK.json","graph_json":"https://pith.science/api/pith-number/L7OLBHRTJYEAQUTLSSASSVMFDK/graph.json","events_json":"https://pith.science/api/pith-number/L7OLBHRTJYEAQUTLSSASSVMFDK/events.json","paper":"https://pith.science/paper/L7OLBHRT"},"agent_actions":{"view_html":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK","download_json":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK.json","view_paper":"https://pith.science/paper/L7OLBHRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.08030&json=true","fetch_graph":"https://pith.science/api/pith-number/L7OLBHRTJYEAQUTLSSASSVMFDK/graph.json","fetch_events":"https://pith.science/api/pith-number/L7OLBHRTJYEAQUTLSSASSVMFDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK/action/storage_attestation","attest_author":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK/action/author_attestation","sign_citation":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK/action/citation_signature","submit_replication":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK/action/replication_record"}},"created_at":"2026-07-05T04:53:23.750208+00:00","updated_at":"2026-07-05T04:53:23.750208+00:00"}