{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:I7VUUAWLUADRS5OLBJ22SKZ4R5","short_pith_number":"pith:I7VUUAWL","canonical_record":{"source":{"id":"1010.0608","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-10-04T14:50:43Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5b5a2b84f1face0deff184f42c30cdb15567f4c8ad723141ac2695cc99d859eb","abstract_canon_sha256":"8ab3bca40f3924bfdf9662ed7101186f8b60786e95d840bfc7db8a31d3b9ac53"},"schema_version":"1.0"},"canonical_sha256":"47eb4a02cba0071975cb0a75a92b3c8f712d1d2aed27dc43c2bafb5b5208f550","source":{"kind":"arxiv","id":"1010.0608","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0608","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0608v3","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0608","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"I7VUUAWLUADR","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"I7VUUAWLUADRS5OL","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"I7VUUAWL","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:I7VUUAWLUADRS5OLBJ22SKZ4R5","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0608","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-10-04T14:50:43Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5b5a2b84f1face0deff184f42c30cdb15567f4c8ad723141ac2695cc99d859eb","abstract_canon_sha256":"8ab3bca40f3924bfdf9662ed7101186f8b60786e95d840bfc7db8a31d3b9ac53"},"schema_version":"1.0"},"canonical_sha256":"47eb4a02cba0071975cb0a75a92b3c8f712d1d2aed27dc43c2bafb5b5208f550","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:47.271438Z","signature_b64":"RQXarP0wKNHPmi+3hi0K87/LMI1NHfM0vphZd3Rdj68Z8A8+LTrzqfS8v8C9ZvmuKyzryY1xtGyo+BHJFMONDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47eb4a02cba0071975cb0a75a92b3c8f712d1d2aed27dc43c2bafb5b5208f550","last_reissued_at":"2026-05-18T02:23:47.270756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:47.270756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0608","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:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IdW+vUWNpFsLGNMvHz4ZKWqANSUVApHn7Jkk14N8Iqoym8HL7845B9m3Y9mab7YMO4GINP2V78H89esJe9OSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:51:26.967858Z"},"content_sha256":"5a92599e38bb8cd35418cbc4124b5fb3e7d646acdda656f97542702f62298a20","schema_version":"1.0","event_id":"sha256:5a92599e38bb8cd35418cbc4124b5fb3e7d646acdda656f97542702f62298a20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:I7VUUAWLUADRS5OLBJ22SKZ4R5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Real-time Robust Principal Components' Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CV","authors_text":"Chenlu Qiu, Namrata Vaswani","submitted_at":"2010-10-04T14:50:43Z","abstract_excerpt":"In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursuit, is proposed. It is motivated as a tool for video surveillance applications with the background image sequence forming the low rank part and the moving objects/persons/abnormalities forming the sparse part. Each image frame is treated as a column vector of the data matrix made up of a low rank matrix and a sparse corruption matrix. Principal component pursuit solves the problem under the assumptions that the singul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0608","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:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebGCGC7eoePnJbuRINE+LNw2AN75wj789FLZtP7lsyEYsLPzEJpBMcWwWTfHLUpzgrsge6/Pk46SDa3dnivhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:51:26.968489Z"},"content_sha256":"7b5258847adbe0863152681fe6a5f7fd8cf4b7d0cd0114a6a9afe0f6c6560a06","schema_version":"1.0","event_id":"sha256:7b5258847adbe0863152681fe6a5f7fd8cf4b7d0cd0114a6a9afe0f6c6560a06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7VUUAWLUADRS5OLBJ22SKZ4R5/bundle.json","state_url":"https://pith.science/pith/I7VUUAWLUADRS5OLBJ22SKZ4R5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7VUUAWLUADRS5OLBJ22SKZ4R5/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-30T16:51:26Z","links":{"resolver":"https://pith.science/pith/I7VUUAWLUADRS5OLBJ22SKZ4R5","bundle":"https://pith.science/pith/I7VUUAWLUADRS5OLBJ22SKZ4R5/bundle.json","state":"https://pith.science/pith/I7VUUAWLUADRS5OLBJ22SKZ4R5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7VUUAWLUADRS5OLBJ22SKZ4R5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:I7VUUAWLUADRS5OLBJ22SKZ4R5","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":"8ab3bca40f3924bfdf9662ed7101186f8b60786e95d840bfc7db8a31d3b9ac53","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-10-04T14:50:43Z","title_canon_sha256":"5b5a2b84f1face0deff184f42c30cdb15567f4c8ad723141ac2695cc99d859eb"},"schema_version":"1.0","source":{"id":"1010.0608","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0608","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0608v3","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0608","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"I7VUUAWLUADR","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"I7VUUAWLUADRS5OL","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"I7VUUAWL","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:7b5258847adbe0863152681fe6a5f7fd8cf4b7d0cd0114a6a9afe0f6c6560a06","target":"graph","created_at":"2026-05-18T02:23:47Z","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":"In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursuit, is proposed. It is motivated as a tool for video surveillance applications with the background image sequence forming the low rank part and the moving objects/persons/abnormalities forming the sparse part. Each image frame is treated as a column vector of the data matrix made up of a low rank matrix and a sparse corruption matrix. Principal component pursuit solves the problem under the assumptions that the singul","authors_text":"Chenlu Qiu, Namrata Vaswani","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-10-04T14:50:43Z","title":"Real-time Robust Principal Components' Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0608","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:5a92599e38bb8cd35418cbc4124b5fb3e7d646acdda656f97542702f62298a20","target":"record","created_at":"2026-05-18T02:23:47Z","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":"8ab3bca40f3924bfdf9662ed7101186f8b60786e95d840bfc7db8a31d3b9ac53","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-10-04T14:50:43Z","title_canon_sha256":"5b5a2b84f1face0deff184f42c30cdb15567f4c8ad723141ac2695cc99d859eb"},"schema_version":"1.0","source":{"id":"1010.0608","kind":"arxiv","version":3}},"canonical_sha256":"47eb4a02cba0071975cb0a75a92b3c8f712d1d2aed27dc43c2bafb5b5208f550","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47eb4a02cba0071975cb0a75a92b3c8f712d1d2aed27dc43c2bafb5b5208f550","first_computed_at":"2026-05-18T02:23:47.270756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:47.270756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RQXarP0wKNHPmi+3hi0K87/LMI1NHfM0vphZd3Rdj68Z8A8+LTrzqfS8v8C9ZvmuKyzryY1xtGyo+BHJFMONDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:47.271438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0608","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a92599e38bb8cd35418cbc4124b5fb3e7d646acdda656f97542702f62298a20","sha256:7b5258847adbe0863152681fe6a5f7fd8cf4b7d0cd0114a6a9afe0f6c6560a06"],"state_sha256":"4dcdb5c46f098e6a6e8e0cb3e2086bdfa9c21b2b70f972fa3f3955890cbc0300"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"id7ymwt50os13w4N0vt57cfc2DebFeM0CsXwzQBV4VRHXyqbkX36zPRvf9dSg/vJmIsMjiFd0xS9lzEUYYFOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:51:26.971600Z","bundle_sha256":"dce0ecb56428404cfaf29c7f2431f2a6120d4ef0c30fee85b728e816ac281581"}}