{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JC4BH5ODM74P4HR47OBPCDFMRR","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":"5253119552644ce5b04811e848e88934c27b4168cb436421ac7be39d1d871c2b","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-11T22:20:16Z","title_canon_sha256":"573a50c7f80d6457c7c61fe3d412b7f4d0dfb2bdd9aaea25096cf688eaa77e4e"},"schema_version":"1.0","source":{"id":"1503.03525","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03525","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03525v2","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03525","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"JC4BH5ODM74P","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JC4BH5ODM74P4HR4","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JC4BH5OD","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:45e18534789fb65c80b6aab96e2c7c8f13871cbc04a593ab4721160de0fe24c8","target":"graph","created_at":"2026-05-18T01:37:48Z","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":"This work studies two interrelated problems - online robust PCA (RPCA) and online low-rank matrix completion (MC). In recent work by Cand\\`{e}s et al., RPCA has been defined as a problem of separating a low-rank matrix (true data), $L:=[\\ell_1, \\ell_2, \\dots \\ell_{t}, \\dots , \\ell_{t_{\\max}}]$ and a sparse matrix (outliers), $S:=[x_1, x_2, \\dots x_{t}, \\dots, x_{t_{\\max}}]$ from their sum, $M:=L+S$. Our work uses this definition of RPCA. An important application where both these problems occur is in video analytics in trying to separate sparse foregrounds (e.g., moving objects) and slowly chan","authors_text":"Brian Lois, Namrata Vaswani","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-11T22:20:16Z","title":"Online Matrix Completion and Online Robust PCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03525","kind":"arxiv","version":2},"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:2e7c5096d74c0fbda89f900a3bbc642f47833daf9e2eb2387ec195130288d474","target":"record","created_at":"2026-05-18T01:37:48Z","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":"5253119552644ce5b04811e848e88934c27b4168cb436421ac7be39d1d871c2b","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-11T22:20:16Z","title_canon_sha256":"573a50c7f80d6457c7c61fe3d412b7f4d0dfb2bdd9aaea25096cf688eaa77e4e"},"schema_version":"1.0","source":{"id":"1503.03525","kind":"arxiv","version":2}},"canonical_sha256":"48b813f5c367f8fe1e3cfb82f10cac8c457e4a2bab7df2d0c6d02ccb1e384291","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48b813f5c367f8fe1e3cfb82f10cac8c457e4a2bab7df2d0c6d02ccb1e384291","first_computed_at":"2026-05-18T01:37:48.988896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:48.988896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lx1pmrtiuSnRq4DcIUuwRRP84BWig3nmIL5iVjZpd/Jkxm7osYaHkqgOW2BUkP7ASEeDjKQdX2FUKLRaWj/TBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:48.989434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03525","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e7c5096d74c0fbda89f900a3bbc642f47833daf9e2eb2387ec195130288d474","sha256:45e18534789fb65c80b6aab96e2c7c8f13871cbc04a593ab4721160de0fe24c8"],"state_sha256":"2d8b9a0aedb48aaa295081556d1ec352c74bb42f675795b14ae08ddf7b74d0bd"}