{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FJWDORZREGVRI6RVYWCM4CN7GD","short_pith_number":"pith:FJWDORZR","canonical_record":{"source":{"id":"1312.5641","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-19T17:07:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2b97707f840496ba80622ce8d3a4f78678b1fd0a3e45f65180a1182604f0762d","abstract_canon_sha256":"ec0fe623ac0304cf8d1c4abd4ff77215922b85106b583625e69aec24a3f1bb00"},"schema_version":"1.0"},"canonical_sha256":"2a6c37473121ab147a35c584ce09bf30fe5c1843327f53ed9925cdd37cca60ff","source":{"kind":"arxiv","id":"1312.5641","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5641","created_at":"2026-05-18T02:55:27Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5641v3","created_at":"2026-05-18T02:55:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5641","created_at":"2026-05-18T02:55:27Z"},{"alias_kind":"pith_short_12","alias_value":"FJWDORZREGVR","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FJWDORZREGVRI6RV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FJWDORZR","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FJWDORZREGVRI6RVYWCM4CN7GD","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5641","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-19T17:07:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2b97707f840496ba80622ce8d3a4f78678b1fd0a3e45f65180a1182604f0762d","abstract_canon_sha256":"ec0fe623ac0304cf8d1c4abd4ff77215922b85106b583625e69aec24a3f1bb00"},"schema_version":"1.0"},"canonical_sha256":"2a6c37473121ab147a35c584ce09bf30fe5c1843327f53ed9925cdd37cca60ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:27.313441Z","signature_b64":"9VlsQ64jS9JhJY65XICikVP2ftKL85ny+icTuuMaVniKT8aobx1NNC+r/mxzZhF+oE1SOX3X/4CZ+sVakCkUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a6c37473121ab147a35c584ce09bf30fe5c1843327f53ed9925cdd37cca60ff","last_reissued_at":"2026-05-18T02:55:27.312897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:27.312897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5641","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:55:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAaaCbeWQffBoG+4/6MngY+DQv5vqBBRg/9qAXf55Mp6oJJtGpnC4hvbBieDMGfWuG/tYbpmMjns+Fng6BsuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:11:25.855496Z"},"content_sha256":"9ad3567c58017c632d8e19545ea1aa92b5b21974c336c802e2fcf0a61755264b","schema_version":"1.0","event_id":"sha256:9ad3567c58017c632d8e19545ea1aa92b5b21974c336c802e2fcf0a61755264b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FJWDORZREGVRI6RVYWCM4CN7GD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise (parts 1 and 2 combined)","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":"2013-12-19T17:07:57Z","abstract_excerpt":"This work studies the recursive robust principal components analysis (PCA) problem. If the outlier is the signal-of-interest, this problem can be interpreted as one of recursively recovering a time sequence of sparse vectors, $S_t$, in the presence of large but structured noise, $L_t$. The structure that we assume on $L_t$ is that $L_t$ 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 to separate a slowly changing background ($L_t$) from moving foreground objec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5641","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:55:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ciKSpvb5yeF/8JEKKybmC/YCCwQ0OJ9I+agG80K5LPEZcpdGHiW6IMM2YFMHSWq9yo37XMicInTZQAXsdHesBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:11:25.855855Z"},"content_sha256":"746da1bafa38d9f7182d979eb0d2ed284138176c07ecf48fb104fd1c81b448ee","schema_version":"1.0","event_id":"sha256:746da1bafa38d9f7182d979eb0d2ed284138176c07ecf48fb104fd1c81b448ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJWDORZREGVRI6RVYWCM4CN7GD/bundle.json","state_url":"https://pith.science/pith/FJWDORZREGVRI6RVYWCM4CN7GD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJWDORZREGVRI6RVYWCM4CN7GD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T06:11:25Z","links":{"resolver":"https://pith.science/pith/FJWDORZREGVRI6RVYWCM4CN7GD","bundle":"https://pith.science/pith/FJWDORZREGVRI6RVYWCM4CN7GD/bundle.json","state":"https://pith.science/pith/FJWDORZREGVRI6RVYWCM4CN7GD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJWDORZREGVRI6RVYWCM4CN7GD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FJWDORZREGVRI6RVYWCM4CN7GD","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":"ec0fe623ac0304cf8d1c4abd4ff77215922b85106b583625e69aec24a3f1bb00","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-19T17:07:57Z","title_canon_sha256":"2b97707f840496ba80622ce8d3a4f78678b1fd0a3e45f65180a1182604f0762d"},"schema_version":"1.0","source":{"id":"1312.5641","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5641","created_at":"2026-05-18T02:55:27Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5641v3","created_at":"2026-05-18T02:55:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5641","created_at":"2026-05-18T02:55:27Z"},{"alias_kind":"pith_short_12","alias_value":"FJWDORZREGVR","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FJWDORZREGVRI6RV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FJWDORZR","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:746da1bafa38d9f7182d979eb0d2ed284138176c07ecf48fb104fd1c81b448ee","target":"graph","created_at":"2026-05-18T02:55:27Z","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 the recursive robust principal components analysis (PCA) problem. If the outlier is the signal-of-interest, this problem can be interpreted as one of recursively recovering a time sequence of sparse vectors, $S_t$, in the presence of large but structured noise, $L_t$. The structure that we assume on $L_t$ is that $L_t$ 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 to separate a slowly changing background ($L_t$) from moving foreground objec","authors_text":"Brian Lois, Chenlu Qiu, Leslie Hogben, Namrata Vaswani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-19T17:07:57Z","title":"Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise (parts 1 and 2 combined)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5641","kind":"arxiv","version":3},"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:9ad3567c58017c632d8e19545ea1aa92b5b21974c336c802e2fcf0a61755264b","target":"record","created_at":"2026-05-18T02:55:27Z","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":"ec0fe623ac0304cf8d1c4abd4ff77215922b85106b583625e69aec24a3f1bb00","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-19T17:07:57Z","title_canon_sha256":"2b97707f840496ba80622ce8d3a4f78678b1fd0a3e45f65180a1182604f0762d"},"schema_version":"1.0","source":{"id":"1312.5641","kind":"arxiv","version":3}},"canonical_sha256":"2a6c37473121ab147a35c584ce09bf30fe5c1843327f53ed9925cdd37cca60ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a6c37473121ab147a35c584ce09bf30fe5c1843327f53ed9925cdd37cca60ff","first_computed_at":"2026-05-18T02:55:27.312897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:27.312897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9VlsQ64jS9JhJY65XICikVP2ftKL85ny+icTuuMaVniKT8aobx1NNC+r/mxzZhF+oE1SOX3X/4CZ+sVakCkUDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:27.313441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5641","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ad3567c58017c632d8e19545ea1aa92b5b21974c336c802e2fcf0a61755264b","sha256:746da1bafa38d9f7182d979eb0d2ed284138176c07ecf48fb104fd1c81b448ee"],"state_sha256":"ec188789858cde19f804959ece7a476e3272a7f9ad2879f5831871965e21c2df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SRiWyxFBdzf5De7FSPRIt/yI56lESpITN9AuH3HcS34IOslnG5JlxU+I250zttyyWMouYeHz7Rx5kHYH1/j+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:11:25.857859Z","bundle_sha256":"887e517fb50c528da9a82a5908c3f8a924bf8b8ca2812dd077fb5443aebe3578"}}