{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MDEDCTIEEKTVXKYZZFHXKXG6LS","short_pith_number":"pith:MDEDCTIE","canonical_record":{"source":{"id":"1409.3959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-13T15:33:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7deaa292695eee0169df38181d974bace70607dfa3eeace7fd2721507307d06e","abstract_canon_sha256":"78486d79eef1c949a4030352016a77a0b97c4f7670d808a264947c8fbac3c305"},"schema_version":"1.0"},"canonical_sha256":"60c8314d0422a75bab19c94f755cde5c84c72404fd583adb3b145be569a3b484","source":{"kind":"arxiv","id":"1409.3959","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3959","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3959v2","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3959","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"MDEDCTIEEKTV","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MDEDCTIEEKTVXKYZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MDEDCTIE","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MDEDCTIEEKTVXKYZZFHXKXG6LS","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-13T15:33:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7deaa292695eee0169df38181d974bace70607dfa3eeace7fd2721507307d06e","abstract_canon_sha256":"78486d79eef1c949a4030352016a77a0b97c4f7670d808a264947c8fbac3c305"},"schema_version":"1.0"},"canonical_sha256":"60c8314d0422a75bab19c94f755cde5c84c72404fd583adb3b145be569a3b484","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:20.906404Z","signature_b64":"B2TZ6AKqnnkRVoj0UKTjNJyZDYX4O6xgZXMGP2oEtJFmwKp/4bw0UmJyqLwu/Y885s17JIYd4/b+NWtJt6eWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60c8314d0422a75bab19c94f755cde5c84c72404fd583adb3b145be569a3b484","last_reissued_at":"2026-05-18T02:16:20.905672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:20.905672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3959","source_version":2,"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:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dC4umVyOAsSPLGBpTxgQqPNHCyS2PtQDV+0i+kiWUrxWJnUdgUVDf8HyreczB6Ac4ndxc+cU9RuX43UumP7aBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:13:22.132564Z"},"content_sha256":"60066f2b47b80d115dbcc9334dabadca59b3faf077317b6ac3ba94a44d50f2d2","schema_version":"1.0","event_id":"sha256:60066f2b47b80d115dbcc9334dabadca59b3faf077317b6ac3ba94a44d50f2d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MDEDCTIEEKTVXKYZZFHXKXG6LS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Correctness Result for Online Robust PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brian Lois, Namrata Vaswani","submitted_at":"2014-09-13T15:33:16Z","abstract_excerpt":"This work studies the problem of sequentially recovering a sparse vector $x_t$ and a vector from a low-dimensional subspace $l_t$ from knowledge of their sum $m_t = x_t + l_t$. If the primary goal is to recover the low-dimensional subspace where the $l_t$'s lie, then the problem is one of online or recursive robust principal components analysis (PCA). To the best of our knowledge, this is the first correctness result for online robust PCA. We prove that if the $l_t$'s obey certain denseness and slow subspace change assumptions, and the support of $x_t$ changes by at least a certain amount at l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3959","kind":"arxiv","version":2},"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:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOFw4zhjntqL9QAdZFf6R+CyBZxPCAnh8NC8Hv12XYGlCzBAKL4cVIBSbbg47ri5z3GnS20+LI50R5LzwHq1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:13:22.132918Z"},"content_sha256":"87940fe7a394630824512797d0f56a9b6cadf380f9c80e200d07ce8d8c7239a4","schema_version":"1.0","event_id":"sha256:87940fe7a394630824512797d0f56a9b6cadf380f9c80e200d07ce8d8c7239a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDEDCTIEEKTVXKYZZFHXKXG6LS/bundle.json","state_url":"https://pith.science/pith/MDEDCTIEEKTVXKYZZFHXKXG6LS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDEDCTIEEKTVXKYZZFHXKXG6LS/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-31T03:13:22Z","links":{"resolver":"https://pith.science/pith/MDEDCTIEEKTVXKYZZFHXKXG6LS","bundle":"https://pith.science/pith/MDEDCTIEEKTVXKYZZFHXKXG6LS/bundle.json","state":"https://pith.science/pith/MDEDCTIEEKTVXKYZZFHXKXG6LS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDEDCTIEEKTVXKYZZFHXKXG6LS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MDEDCTIEEKTVXKYZZFHXKXG6LS","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":"78486d79eef1c949a4030352016a77a0b97c4f7670d808a264947c8fbac3c305","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-13T15:33:16Z","title_canon_sha256":"7deaa292695eee0169df38181d974bace70607dfa3eeace7fd2721507307d06e"},"schema_version":"1.0","source":{"id":"1409.3959","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3959","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3959v2","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3959","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"MDEDCTIEEKTV","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MDEDCTIEEKTVXKYZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MDEDCTIE","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:87940fe7a394630824512797d0f56a9b6cadf380f9c80e200d07ce8d8c7239a4","target":"graph","created_at":"2026-05-18T02:16:20Z","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 problem of sequentially recovering a sparse vector $x_t$ and a vector from a low-dimensional subspace $l_t$ from knowledge of their sum $m_t = x_t + l_t$. If the primary goal is to recover the low-dimensional subspace where the $l_t$'s lie, then the problem is one of online or recursive robust principal components analysis (PCA). To the best of our knowledge, this is the first correctness result for online robust PCA. We prove that if the $l_t$'s obey certain denseness and slow subspace change assumptions, and the support of $x_t$ changes by at least a certain amount at l","authors_text":"Brian Lois, Namrata Vaswani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-13T15:33:16Z","title":"A Correctness Result for Online Robust PCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3959","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:60066f2b47b80d115dbcc9334dabadca59b3faf077317b6ac3ba94a44d50f2d2","target":"record","created_at":"2026-05-18T02:16:20Z","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":"78486d79eef1c949a4030352016a77a0b97c4f7670d808a264947c8fbac3c305","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-13T15:33:16Z","title_canon_sha256":"7deaa292695eee0169df38181d974bace70607dfa3eeace7fd2721507307d06e"},"schema_version":"1.0","source":{"id":"1409.3959","kind":"arxiv","version":2}},"canonical_sha256":"60c8314d0422a75bab19c94f755cde5c84c72404fd583adb3b145be569a3b484","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60c8314d0422a75bab19c94f755cde5c84c72404fd583adb3b145be569a3b484","first_computed_at":"2026-05-18T02:16:20.905672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:20.905672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B2TZ6AKqnnkRVoj0UKTjNJyZDYX4O6xgZXMGP2oEtJFmwKp/4bw0UmJyqLwu/Y885s17JIYd4/b+NWtJt6eWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:20.906404Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3959","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60066f2b47b80d115dbcc9334dabadca59b3faf077317b6ac3ba94a44d50f2d2","sha256:87940fe7a394630824512797d0f56a9b6cadf380f9c80e200d07ce8d8c7239a4"],"state_sha256":"01b5e3145b959953aa545a86732e17bbb796913d68ed6074955252c381c09082"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4GY8cbQALnV0uakSPdwanZhPY4bgdsTFi65pRX8iXo8ihCDDX67euwckIyxpvqYWvofjYfH8Ngbnqb+HjN4nBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:13:22.135160Z","bundle_sha256":"a73926c3b227b32c46f859ec6004c7d1fa6a499e11f57924ea1577af93ec81d0"}}