{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZLB7CKMGPNOFIQBIUK6MNXQJFV","short_pith_number":"pith:ZLB7CKMG","schema_version":"1.0","canonical_sha256":"cac3f129867b5c544028a2bcc6de092d4caff122834ae9b6d9d976346303bd78","source":{"kind":"arxiv","id":"1601.07985","version":1},"attestation_state":"computed","paper":{"title":"Online (and Offline) Robust PCA: Novel Algorithms and Performance Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brian Lois, Jinchun Zhan, Namrata Vaswani","submitted_at":"2016-01-29T06:29:36Z","abstract_excerpt":"In this work, we study the online robust principal components' analysis (RPCA) problem. In recent work, RPCA has been defined as a problem of separating a low-rank matrix (true data), $L$, and a sparse matrix (outliers), $S$, from their sum, $M:=L + S$. A more general version of this problem is to recover $L$ and $S$ from $M:=L + S + W$ where $W$ is the matrix of unstructured small noise/corruptions. An important application where this problem occurs is in video analytics in trying to separate sparse foregrounds (e.g., moving objects) from slowly changing backgrounds. While there has been a la"},"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":"1601.07985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-29T06:29:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"812f0f822f1553d14593a05bc586fe0785a54cf5e8888f62f32d21573dd7766a","abstract_canon_sha256":"576cf7f52e32ea46b109b3de0924c4b09724df80dbfb30ea768dd04106e404b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:41.324102Z","signature_b64":"MIDzd1JYcKUYROWYhsoLLsS4y35dugY4sF4QDv5RceLhMiTPPDFv5EgSw1bips0AChCj/PuysWsDX45725NHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cac3f129867b5c544028a2bcc6de092d4caff122834ae9b6d9d976346303bd78","last_reissued_at":"2026-05-18T01:21:41.323508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:41.323508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online (and Offline) Robust PCA: Novel Algorithms and Performance Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brian Lois, Jinchun Zhan, Namrata Vaswani","submitted_at":"2016-01-29T06:29:36Z","abstract_excerpt":"In this work, we study the online robust principal components' analysis (RPCA) problem. In recent work, RPCA has been defined as a problem of separating a low-rank matrix (true data), $L$, and a sparse matrix (outliers), $S$, from their sum, $M:=L + S$. A more general version of this problem is to recover $L$ and $S$ from $M:=L + S + W$ where $W$ is the matrix of unstructured small noise/corruptions. An important application where this problem occurs is in video analytics in trying to separate sparse foregrounds (e.g., moving objects) from slowly changing backgrounds. While there has been a la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07985","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":"1601.07985","created_at":"2026-05-18T01:21:41.323598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07985v1","created_at":"2026-05-18T01:21:41.323598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07985","created_at":"2026-05-18T01:21:41.323598+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLB7CKMGPNOF","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLB7CKMGPNOFIQBI","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLB7CKMG","created_at":"2026-05-18T12:30:53.716459+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/ZLB7CKMGPNOFIQBIUK6MNXQJFV","json":"https://pith.science/pith/ZLB7CKMGPNOFIQBIUK6MNXQJFV.json","graph_json":"https://pith.science/api/pith-number/ZLB7CKMGPNOFIQBIUK6MNXQJFV/graph.json","events_json":"https://pith.science/api/pith-number/ZLB7CKMGPNOFIQBIUK6MNXQJFV/events.json","paper":"https://pith.science/paper/ZLB7CKMG"},"agent_actions":{"view_html":"https://pith.science/pith/ZLB7CKMGPNOFIQBIUK6MNXQJFV","download_json":"https://pith.science/pith/ZLB7CKMGPNOFIQBIUK6MNXQJFV.json","view_paper":"https://pith.science/paper/ZLB7CKMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07985&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLB7CKMGPNOFIQBIUK6MNXQJFV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLB7CKMGPNOFIQBIUK6MNXQJFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLB7CKMGPNOFIQBIUK6MNXQJFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLB7CKMGPNOFIQBIUK6MNXQJFV/action/storage_attestation","attest_author":"https://pith.science/pith/ZLB7CKMGPNOFIQBIUK6MNXQJFV/action/author_attestation","sign_citation":"https://pith.science/pith/ZLB7CKMGPNOFIQBIUK6MNXQJFV/action/citation_signature","submit_replication":"https://pith.science/pith/ZLB7CKMGPNOFIQBIUK6MNXQJFV/action/replication_record"}},"created_at":"2026-05-18T01:21:41.323598+00:00","updated_at":"2026-05-18T01:21:41.323598+00:00"}