{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A3NC6SQWRVXYJPANY4C25ZHRZV","short_pith_number":"pith:A3NC6SQW","canonical_record":{"source":{"id":"1712.06061","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-17T06:14:58Z","cross_cats_sorted":["cs.CV","math.IT","stat.ML"],"title_canon_sha256":"4d6f9e43a5cd166883770d5277feab2986fa6acc1c2e5661731dd98ab0f583ed","abstract_canon_sha256":"84c877186901b9cd5b7f86a1c95ff94b01d94528dfb38444970a2a09046d4911"},"schema_version":"1.0"},"canonical_sha256":"06da2f4a168d6f84bc0dc705aee4f1cd6738a9e7d6b81817418fb8b11994cfa2","source":{"kind":"arxiv","id":"1712.06061","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06061","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06061v4","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06061","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"A3NC6SQWRVXY","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A3NC6SQWRVXYJPAN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A3NC6SQW","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A3NC6SQWRVXYJPANY4C25ZHRZV","target":"record","payload":{"canonical_record":{"source":{"id":"1712.06061","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-17T06:14:58Z","cross_cats_sorted":["cs.CV","math.IT","stat.ML"],"title_canon_sha256":"4d6f9e43a5cd166883770d5277feab2986fa6acc1c2e5661731dd98ab0f583ed","abstract_canon_sha256":"84c877186901b9cd5b7f86a1c95ff94b01d94528dfb38444970a2a09046d4911"},"schema_version":"1.0"},"canonical_sha256":"06da2f4a168d6f84bc0dc705aee4f1cd6738a9e7d6b81817418fb8b11994cfa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:18.218895Z","signature_b64":"1fh5PwGyVs0/FDYj/Jq+WDfqcnkhpqTaQYc2xNrBxEq/qNR6Hx31052x9Vch7Ny9ZbCp31B6b86jZusf6SZKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06da2f4a168d6f84bc0dc705aee4f1cd6738a9e7d6b81817418fb8b11994cfa2","last_reissued_at":"2026-05-18T00:11:18.217965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:18.217965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.06061","source_version":4,"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-18T00:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CWMWnHOlmAsRfFpRHljMMV8wO1IKXvs11rD2nuwkjA6JJIksVldOvn2vNngaHbcGFZyoXI1roJ7w1xZTNOwjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:39:04.389402Z"},"content_sha256":"7e2113c4a7f71267135e27a546391aad598cfe5fc12a073a9e23b2c14ae06576","schema_version":"1.0","event_id":"sha256:7e2113c4a7f71267135e27a546391aad598cfe5fc12a073a9e23b2c14ae06576"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A3NC6SQWRVXYJPANY4C25ZHRZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Optimal Robust Subspace Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy","submitted_at":"2017-12-17T06:14:58Z","abstract_excerpt":"In this work, we study the robust subspace tracking (RST) problem and obtain one of the first two provable guarantees for it. The goal of RST is to track sequentially arriving data vectors that lie in a slowly changing low-dimensional subspace, while being robust to corruption by additive sparse outliers. It can also be interpreted as a dynamic (time-varying) extension of robust PCA (RPCA), with the minor difference that RST also requires a short tracking delay. We develop a recursive projected compressive sensing algorithm that we call Nearly Optimal RST via ReProCS (ReProCS-NORST) because it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06061","kind":"arxiv","version":4},"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-18T00:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+4InzOxKU4Q1Bdwwd4egZlmflU0qHKrlulzL8kOCBnRW6pmDVnPnFb5VrtphhTTqWYg1PMIlwR/wSmjN1C/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:39:04.389959Z"},"content_sha256":"660810ccb130a1dd7c19d08c163a418ab431f5b599c05cdb98b1a0e60a408e32","schema_version":"1.0","event_id":"sha256:660810ccb130a1dd7c19d08c163a418ab431f5b599c05cdb98b1a0e60a408e32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3NC6SQWRVXYJPANY4C25ZHRZV/bundle.json","state_url":"https://pith.science/pith/A3NC6SQWRVXYJPANY4C25ZHRZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3NC6SQWRVXYJPANY4C25ZHRZV/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-06-04T08:39:04Z","links":{"resolver":"https://pith.science/pith/A3NC6SQWRVXYJPANY4C25ZHRZV","bundle":"https://pith.science/pith/A3NC6SQWRVXYJPANY4C25ZHRZV/bundle.json","state":"https://pith.science/pith/A3NC6SQWRVXYJPANY4C25ZHRZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3NC6SQWRVXYJPANY4C25ZHRZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A3NC6SQWRVXYJPANY4C25ZHRZV","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":"84c877186901b9cd5b7f86a1c95ff94b01d94528dfb38444970a2a09046d4911","cross_cats_sorted":["cs.CV","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-17T06:14:58Z","title_canon_sha256":"4d6f9e43a5cd166883770d5277feab2986fa6acc1c2e5661731dd98ab0f583ed"},"schema_version":"1.0","source":{"id":"1712.06061","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06061","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06061v4","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06061","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"A3NC6SQWRVXY","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A3NC6SQWRVXYJPAN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A3NC6SQW","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:660810ccb130a1dd7c19d08c163a418ab431f5b599c05cdb98b1a0e60a408e32","target":"graph","created_at":"2026-05-18T00:11:18Z","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 this work, we study the robust subspace tracking (RST) problem and obtain one of the first two provable guarantees for it. The goal of RST is to track sequentially arriving data vectors that lie in a slowly changing low-dimensional subspace, while being robust to corruption by additive sparse outliers. It can also be interpreted as a dynamic (time-varying) extension of robust PCA (RPCA), with the minor difference that RST also requires a short tracking delay. We develop a recursive projected compressive sensing algorithm that we call Nearly Optimal RST via ReProCS (ReProCS-NORST) because it","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy","cross_cats":["cs.CV","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-17T06:14:58Z","title":"Nearly Optimal Robust Subspace Tracking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06061","kind":"arxiv","version":4},"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:7e2113c4a7f71267135e27a546391aad598cfe5fc12a073a9e23b2c14ae06576","target":"record","created_at":"2026-05-18T00:11:18Z","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":"84c877186901b9cd5b7f86a1c95ff94b01d94528dfb38444970a2a09046d4911","cross_cats_sorted":["cs.CV","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-17T06:14:58Z","title_canon_sha256":"4d6f9e43a5cd166883770d5277feab2986fa6acc1c2e5661731dd98ab0f583ed"},"schema_version":"1.0","source":{"id":"1712.06061","kind":"arxiv","version":4}},"canonical_sha256":"06da2f4a168d6f84bc0dc705aee4f1cd6738a9e7d6b81817418fb8b11994cfa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06da2f4a168d6f84bc0dc705aee4f1cd6738a9e7d6b81817418fb8b11994cfa2","first_computed_at":"2026-05-18T00:11:18.217965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:18.217965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1fh5PwGyVs0/FDYj/Jq+WDfqcnkhpqTaQYc2xNrBxEq/qNR6Hx31052x9Vch7Ny9ZbCp31B6b86jZusf6SZKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:18.218895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06061","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e2113c4a7f71267135e27a546391aad598cfe5fc12a073a9e23b2c14ae06576","sha256:660810ccb130a1dd7c19d08c163a418ab431f5b599c05cdb98b1a0e60a408e32"],"state_sha256":"91ec2fb8588c9ec26b0f118786ce6735693f9b49fdadbca126e117c849ff6183"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XG6FzXAlrjOsRFnONLLi2nu8ds0dRIHsMARqeaaSAWfJLmoGz8y3M8B3qgKL//JLBAycAUnSKkPvwDC//F6NDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:39:04.392693Z","bundle_sha256":"3a6d00ae4143450562e50fae2b3530a2f6aee1d2613be1ad3e590114ee6ebdb8"}}