{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2GHJ4Q64HSCHHN4BX6GTKNGTSL","short_pith_number":"pith:2GHJ4Q64","schema_version":"1.0","canonical_sha256":"d18e9e43dc3c8473b781bf8d3534d392d22927c51571d83ab6db1f7bfb408e74","source":{"kind":"arxiv","id":"1705.08948","version":4},"attestation_state":"computed","paper":{"title":"Provable Dynamic Robust PCA or Robust Subspace Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy","submitted_at":"2017-05-24T19:55:51Z","abstract_excerpt":"Dynamic robust PCA refers to the dynamic (time-varying) extension of robust PCA (RPCA). It assumes that the true (uncorrupted) data lies in a low-dimensional subspace that can change with time, albeit slowly. The goal is to track this changing subspace over time in the presence of sparse outliers. We develop and study a novel algorithm, that we call simple-ReProCS, based on the recently introduced Recursive Projected Compressive Sensing (ReProCS) framework. Our work provides the first guarantee for dynamic RPCA that holds under weakened versions of standard RPCA assumptions, slow subspace chan"},"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":"1705.08948","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-24T19:55:51Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"a94e2b1902585e9684641d281399348c37f479a73b1bbfac5a5e12737bdec035","abstract_canon_sha256":"9b75692ba4979ce48120ca13d1869d4ba2c52860a30a23ddcf693a882c38a251"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:56.089889Z","signature_b64":"IqcyPZ7hQH/lV0xoDrLlJJbsXX6je2nuSUAfje/vTZ+D2qd/knLzAZx14rpb4j1mkxmJslncxPoyiDG4N33rAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d18e9e43dc3c8473b781bf8d3534d392d22927c51571d83ab6db1f7bfb408e74","last_reissued_at":"2026-05-17T23:52:56.089203Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:56.089203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable Dynamic Robust PCA or Robust Subspace Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy","submitted_at":"2017-05-24T19:55:51Z","abstract_excerpt":"Dynamic robust PCA refers to the dynamic (time-varying) extension of robust PCA (RPCA). It assumes that the true (uncorrupted) data lies in a low-dimensional subspace that can change with time, albeit slowly. The goal is to track this changing subspace over time in the presence of sparse outliers. We develop and study a novel algorithm, that we call simple-ReProCS, based on the recently introduced Recursive Projected Compressive Sensing (ReProCS) framework. Our work provides the first guarantee for dynamic RPCA that holds under weakened versions of standard RPCA assumptions, slow subspace chan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08948","kind":"arxiv","version":4},"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":"1705.08948","created_at":"2026-05-17T23:52:56.089309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08948v4","created_at":"2026-05-17T23:52:56.089309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08948","created_at":"2026-05-17T23:52:56.089309+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GHJ4Q64HSCH","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GHJ4Q64HSCHHN4B","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GHJ4Q64","created_at":"2026-05-18T12:30:55.937587+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/2GHJ4Q64HSCHHN4BX6GTKNGTSL","json":"https://pith.science/pith/2GHJ4Q64HSCHHN4BX6GTKNGTSL.json","graph_json":"https://pith.science/api/pith-number/2GHJ4Q64HSCHHN4BX6GTKNGTSL/graph.json","events_json":"https://pith.science/api/pith-number/2GHJ4Q64HSCHHN4BX6GTKNGTSL/events.json","paper":"https://pith.science/paper/2GHJ4Q64"},"agent_actions":{"view_html":"https://pith.science/pith/2GHJ4Q64HSCHHN4BX6GTKNGTSL","download_json":"https://pith.science/pith/2GHJ4Q64HSCHHN4BX6GTKNGTSL.json","view_paper":"https://pith.science/paper/2GHJ4Q64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08948&json=true","fetch_graph":"https://pith.science/api/pith-number/2GHJ4Q64HSCHHN4BX6GTKNGTSL/graph.json","fetch_events":"https://pith.science/api/pith-number/2GHJ4Q64HSCHHN4BX6GTKNGTSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GHJ4Q64HSCHHN4BX6GTKNGTSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GHJ4Q64HSCHHN4BX6GTKNGTSL/action/storage_attestation","attest_author":"https://pith.science/pith/2GHJ4Q64HSCHHN4BX6GTKNGTSL/action/author_attestation","sign_citation":"https://pith.science/pith/2GHJ4Q64HSCHHN4BX6GTKNGTSL/action/citation_signature","submit_replication":"https://pith.science/pith/2GHJ4Q64HSCHHN4BX6GTKNGTSL/action/replication_record"}},"created_at":"2026-05-17T23:52:56.089309+00:00","updated_at":"2026-05-17T23:52:56.089309+00:00"}