{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ALGM77IOJGJ6SOG6AWOI4ANNIT","short_pith_number":"pith:ALGM77IO","canonical_record":{"source":{"id":"1106.3286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-16T17:36:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cbf38c1ad2b45dbd3882631f932bb24d8f2f931c9cf7039b84178508e891bf2d","abstract_canon_sha256":"ada846cf86a45441f8a667ab4abf80fb5a7356389da6555e215df1b32c774306"},"schema_version":"1.0"},"canonical_sha256":"02cccffd0e4993e938de059c8e01ad44e1a048109c65c48330defb158abfeac1","source":{"kind":"arxiv","id":"1106.3286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3286","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3286v1","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3286","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"ALGM77IOJGJ6","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ALGM77IOJGJ6SOG6","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ALGM77IO","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ALGM77IOJGJ6SOG6AWOI4ANNIT","target":"record","payload":{"canonical_record":{"source":{"id":"1106.3286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-16T17:36:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cbf38c1ad2b45dbd3882631f932bb24d8f2f931c9cf7039b84178508e891bf2d","abstract_canon_sha256":"ada846cf86a45441f8a667ab4abf80fb5a7356389da6555e215df1b32c774306"},"schema_version":"1.0"},"canonical_sha256":"02cccffd0e4993e938de059c8e01ad44e1a048109c65c48330defb158abfeac1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:53.791527Z","signature_b64":"rd6WvhDgq7IkE5QSVI1q6CRmbBLTmQsBgz5vjOACQuqKjr24qyHWhYuBWdAkEYsJM6T0Jq6bRuoOkcrQ53IzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02cccffd0e4993e938de059c8e01ad44e1a048109c65c48330defb158abfeac1","last_reissued_at":"2026-05-18T04:19:53.790796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:53.790796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.3286","source_version":1,"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-18T04:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TpgNFAHXKuHqpLk0kNfAtYb0k+UoEAxTyfjYqw0q+ilh7tXG+djvoywVjKFhs/DJpG4wwhc3T5kZtGJZDfRaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:43:37.780339Z"},"content_sha256":"b2ba8bc738c78ba31ef14587f194c6d9c1a1807e6f6de176230aa121adae5edb","schema_version":"1.0","event_id":"sha256:b2ba8bc738c78ba31ef14587f194c6d9c1a1807e6f6de176230aa121adae5edb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ALGM77IOJGJ6SOG6AWOI4ANNIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ReProCS: A Missing Link between Recursive Robust PCA and Recursive Sparse Recovery in Large but Correlated Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chenlu Qiu, Namrata Vaswani","submitted_at":"2011-06-16T17:36:58Z","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, although we focus on the latter. A key application where this problem occurs is in video surveillance where the goal is to separate a slowly changing background from moving foreground objects on-the-fly. The background sequence is well modeled as lying in a low dimensional subspace, that can gradually change over time, while the moving foreground objects constitute the correlated sparse outliers. In this and many other appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3286","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"},"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-18T04:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45+3mMcEnq8S/SRp0JsWIGJYyHwFMZSHXKqDnT6+lf92GTTYg6DMDcBFdaWH92QUtYR4n/YKvEGtAaWQ+zQ/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:43:37.781011Z"},"content_sha256":"97be50891b6daa61d27e80897e59a7fc03bc88943447c2d859d2ee1b003a5f69","schema_version":"1.0","event_id":"sha256:97be50891b6daa61d27e80897e59a7fc03bc88943447c2d859d2ee1b003a5f69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALGM77IOJGJ6SOG6AWOI4ANNIT/bundle.json","state_url":"https://pith.science/pith/ALGM77IOJGJ6SOG6AWOI4ANNIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALGM77IOJGJ6SOG6AWOI4ANNIT/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-30T07:43:37Z","links":{"resolver":"https://pith.science/pith/ALGM77IOJGJ6SOG6AWOI4ANNIT","bundle":"https://pith.science/pith/ALGM77IOJGJ6SOG6AWOI4ANNIT/bundle.json","state":"https://pith.science/pith/ALGM77IOJGJ6SOG6AWOI4ANNIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALGM77IOJGJ6SOG6AWOI4ANNIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ALGM77IOJGJ6SOG6AWOI4ANNIT","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":"ada846cf86a45441f8a667ab4abf80fb5a7356389da6555e215df1b32c774306","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-16T17:36:58Z","title_canon_sha256":"cbf38c1ad2b45dbd3882631f932bb24d8f2f931c9cf7039b84178508e891bf2d"},"schema_version":"1.0","source":{"id":"1106.3286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3286","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3286v1","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3286","created_at":"2026-05-18T04:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"ALGM77IOJGJ6","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ALGM77IOJGJ6SOG6","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ALGM77IO","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:97be50891b6daa61d27e80897e59a7fc03bc88943447c2d859d2ee1b003a5f69","target":"graph","created_at":"2026-05-18T04:19:53Z","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. Here, \"robust\" refers to robustness to both independent and correlated sparse outliers, although we focus on the latter. A key application where this problem occurs is in video surveillance where the goal is to separate a slowly changing background from moving foreground objects on-the-fly. The background sequence is well modeled as lying in a low dimensional subspace, that can gradually change over time, while the moving foreground objects constitute the correlated sparse outliers. In this and many other appl","authors_text":"Chenlu Qiu, Namrata Vaswani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-16T17:36:58Z","title":"ReProCS: A Missing Link between Recursive Robust PCA and Recursive Sparse Recovery in Large but Correlated Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3286","kind":"arxiv","version":1},"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:b2ba8bc738c78ba31ef14587f194c6d9c1a1807e6f6de176230aa121adae5edb","target":"record","created_at":"2026-05-18T04:19:53Z","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":"ada846cf86a45441f8a667ab4abf80fb5a7356389da6555e215df1b32c774306","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-16T17:36:58Z","title_canon_sha256":"cbf38c1ad2b45dbd3882631f932bb24d8f2f931c9cf7039b84178508e891bf2d"},"schema_version":"1.0","source":{"id":"1106.3286","kind":"arxiv","version":1}},"canonical_sha256":"02cccffd0e4993e938de059c8e01ad44e1a048109c65c48330defb158abfeac1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02cccffd0e4993e938de059c8e01ad44e1a048109c65c48330defb158abfeac1","first_computed_at":"2026-05-18T04:19:53.790796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:53.790796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rd6WvhDgq7IkE5QSVI1q6CRmbBLTmQsBgz5vjOACQuqKjr24qyHWhYuBWdAkEYsJM6T0Jq6bRuoOkcrQ53IzBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:53.791527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2ba8bc738c78ba31ef14587f194c6d9c1a1807e6f6de176230aa121adae5edb","sha256:97be50891b6daa61d27e80897e59a7fc03bc88943447c2d859d2ee1b003a5f69"],"state_sha256":"40ca162bfc0746d794f475519136beb902f7fb77a6ec51acfc881588baa60f93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D486G7i6sSWUCoF5Vpp7KTRBrfhJ3vBg32gEZQj9kdZGo9jowsn57rJSZ7bJs9AZn4LNKqKlOduKJqHjzmujBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:43:37.784677Z","bundle_sha256":"79c0dbee394ee510d21326e5198add66c0fb5616459306bb2e4d30a4c9ccb23b"}}