{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OHTSG4XMEPNTDN4QTFJN6ZU4BB","short_pith_number":"pith:OHTSG4XM","schema_version":"1.0","canonical_sha256":"71e72372ec23db31b7909952df669c087018884b632ee43605dc7af4c141f772","source":{"kind":"arxiv","id":"1211.3754","version":10},"attestation_state":"computed","paper":{"title":"Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brian Lois, Chenlu Qiu, Leslie Hogben, Namrata Vaswani","submitted_at":"2012-11-15T21:10:32Z","abstract_excerpt":"This work studies the recursive robust principal components' analysis(PCA) problem. Here, \"robust\" refers to robustness to both independent and correlated sparse outliers. If the outlier is the signal-of-interest, this problem can be interpreted as one of recursively recovering a time sequence of sparse vectors, St, in the presence of large but structured noise, Lt. The structure that we assume on Lt is that Lt is dense and lies in a low dimensional subspace that is either fixed or changes \"slowly enough\". A key application where this problem occurs is in video surveillance where the goal is t"},"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":"1211.3754","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-15T21:10:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"95bc6ca2505a5d94405ccc6e899130d66fe338e9cb36f7350f12cb7497fcf969","abstract_canon_sha256":"921e7a85611ad482da36be7bd4fd5d98b09fa2c95e34d1df773a434d41122e34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:57.039163Z","signature_b64":"oGhcCy+0RZ02Jd6ThrKj5wgru6LRjbSDdd1I+PW1xtK4u4M5twoi+atne0eQcQv3F1eTlJhmrbMNnJ1afIlsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71e72372ec23db31b7909952df669c087018884b632ee43605dc7af4c141f772","last_reissued_at":"2026-05-18T02:44:57.038605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:57.038605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brian Lois, Chenlu Qiu, Leslie Hogben, Namrata Vaswani","submitted_at":"2012-11-15T21:10:32Z","abstract_excerpt":"This work studies the recursive robust principal components' analysis(PCA) problem. Here, \"robust\" refers to robustness to both independent and correlated sparse outliers. If the outlier is the signal-of-interest, this problem can be interpreted as one of recursively recovering a time sequence of sparse vectors, St, in the presence of large but structured noise, Lt. The structure that we assume on Lt is that Lt is dense and lies in a low dimensional subspace that is either fixed or changes \"slowly enough\". A key application where this problem occurs is in video surveillance where the goal is t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3754","kind":"arxiv","version":10},"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":"1211.3754","created_at":"2026-05-18T02:44:57.038689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3754v10","created_at":"2026-05-18T02:44:57.038689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3754","created_at":"2026-05-18T02:44:57.038689+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHTSG4XMEPNT","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHTSG4XMEPNTDN4Q","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHTSG4XM","created_at":"2026-05-18T12:27:16.716162+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/OHTSG4XMEPNTDN4QTFJN6ZU4BB","json":"https://pith.science/pith/OHTSG4XMEPNTDN4QTFJN6ZU4BB.json","graph_json":"https://pith.science/api/pith-number/OHTSG4XMEPNTDN4QTFJN6ZU4BB/graph.json","events_json":"https://pith.science/api/pith-number/OHTSG4XMEPNTDN4QTFJN6ZU4BB/events.json","paper":"https://pith.science/paper/OHTSG4XM"},"agent_actions":{"view_html":"https://pith.science/pith/OHTSG4XMEPNTDN4QTFJN6ZU4BB","download_json":"https://pith.science/pith/OHTSG4XMEPNTDN4QTFJN6ZU4BB.json","view_paper":"https://pith.science/paper/OHTSG4XM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3754&json=true","fetch_graph":"https://pith.science/api/pith-number/OHTSG4XMEPNTDN4QTFJN6ZU4BB/graph.json","fetch_events":"https://pith.science/api/pith-number/OHTSG4XMEPNTDN4QTFJN6ZU4BB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHTSG4XMEPNTDN4QTFJN6ZU4BB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHTSG4XMEPNTDN4QTFJN6ZU4BB/action/storage_attestation","attest_author":"https://pith.science/pith/OHTSG4XMEPNTDN4QTFJN6ZU4BB/action/author_attestation","sign_citation":"https://pith.science/pith/OHTSG4XMEPNTDN4QTFJN6ZU4BB/action/citation_signature","submit_replication":"https://pith.science/pith/OHTSG4XMEPNTDN4QTFJN6ZU4BB/action/replication_record"}},"created_at":"2026-05-18T02:44:57.038689+00:00","updated_at":"2026-05-18T02:44:57.038689+00:00"}