{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:L7OLBHRTJYEAQUTLSSASSVMFDK","short_pith_number":"pith:L7OLBHRT","canonical_record":{"source":{"id":"2006.08030","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-14T21:35:30Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"7b0491321c3177b96ee59cbbdeb7b83f38803d0a4bc9ce3c52ea110993f9cf36","abstract_canon_sha256":"08dd1572e29c72b0a95365066faac15c724b354b77c04c59427c4a54b0282fd1"},"schema_version":"1.0"},"canonical_sha256":"5fdcb09e334e0808526b94812955851ab235dbc8730c4e3fca09fbf8d4f0c8cc","source":{"kind":"arxiv","id":"2006.08030","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.08030","created_at":"2026-07-05T04:53:23Z"},{"alias_kind":"arxiv_version","alias_value":"2006.08030v3","created_at":"2026-07-05T04:53:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08030","created_at":"2026-07-05T04:53:23Z"},{"alias_kind":"pith_short_12","alias_value":"L7OLBHRTJYEA","created_at":"2026-07-05T04:53:23Z"},{"alias_kind":"pith_short_16","alias_value":"L7OLBHRTJYEAQUTL","created_at":"2026-07-05T04:53:23Z"},{"alias_kind":"pith_short_8","alias_value":"L7OLBHRT","created_at":"2026-07-05T04:53:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:L7OLBHRTJYEAQUTLSSASSVMFDK","target":"record","payload":{"canonical_record":{"source":{"id":"2006.08030","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-14T21:35:30Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"7b0491321c3177b96ee59cbbdeb7b83f38803d0a4bc9ce3c52ea110993f9cf36","abstract_canon_sha256":"08dd1572e29c72b0a95365066faac15c724b354b77c04c59427c4a54b0282fd1"},"schema_version":"1.0"},"canonical_sha256":"5fdcb09e334e0808526b94812955851ab235dbc8730c4e3fca09fbf8d4f0c8cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:53:23.750598Z","signature_b64":"KHI/xioH/VWCztfithL85IQHyNCSB92cKGHQFIPJa9UoLRKMDIY0Hznc5jnOfJqLZG2hVY71KebSV2UQ84zBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fdcb09e334e0808526b94812955851ab235dbc8730c4e3fca09fbf8d4f0c8cc","last_reissued_at":"2026-07-05T04:53:23.750153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:53:23.750153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.08030","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-07-05T04:53:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDbJvmfS7bYj82VKH4LT7Da7C6kDEaqyMJgt0s413qSdyCovnZRGgMjcASUPQshzbhHbshPGyMMepDqbjyx/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T17:18:41.042153Z"},"content_sha256":"0efe24b9818e73ce81ce0fa052a9da6bf79edbf0b8f5d8032895b10a796be836","schema_version":"1.0","event_id":"sha256:0efe24b9818e73ce81ce0fa052a9da6bf79edbf0b8f5d8032895b10a796be836"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:L7OLBHRTJYEAQUTLSSASSVMFDK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Robust Subspace Tracking via PCA in Sparse Data-Dependent Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy","submitted_at":"2020-06-14T21:35:30Z","abstract_excerpt":"This work studies the robust subspace tracking (ST) problem. Robust ST can be simply understood as a (slow) time-varying subspace extension of robust PCA. It assumes that the true data lies in a low-dimensional subspace that is either fixed or changes slowly with time. The goal is to track the changing subspaces over time in the presence of additive sparse outliers and to do this quickly (with a short delay). We introduce a \"fast\" mini-batch robust ST solution that is provably correct under mild assumptions. Here \"fast\" means two things: (i) the subspace changes can be detected and the subspac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08030","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.08030/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:53:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lGrYv7iDvX02l99vtNvqUuJvVlc7AhAQ6bx0woiH6KpkPswLJTaZlhi60xmvOsVXpztJtEnXn6mqmBVsIP62Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T17:18:41.042805Z"},"content_sha256":"d7fae8218067289def66ca5c08bc320a4111ccbc8fc0af5db7ed77753f0494a3","schema_version":"1.0","event_id":"sha256:d7fae8218067289def66ca5c08bc320a4111ccbc8fc0af5db7ed77753f0494a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK/bundle.json","state_url":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7OLBHRTJYEAQUTLSSASSVMFDK/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-07-10T17:18:41Z","links":{"resolver":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK","bundle":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK/bundle.json","state":"https://pith.science/pith/L7OLBHRTJYEAQUTLSSASSVMFDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7OLBHRTJYEAQUTLSSASSVMFDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:L7OLBHRTJYEAQUTLSSASSVMFDK","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":"08dd1572e29c72b0a95365066faac15c724b354b77c04c59427c4a54b0282fd1","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-14T21:35:30Z","title_canon_sha256":"7b0491321c3177b96ee59cbbdeb7b83f38803d0a4bc9ce3c52ea110993f9cf36"},"schema_version":"1.0","source":{"id":"2006.08030","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.08030","created_at":"2026-07-05T04:53:23Z"},{"alias_kind":"arxiv_version","alias_value":"2006.08030v3","created_at":"2026-07-05T04:53:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08030","created_at":"2026-07-05T04:53:23Z"},{"alias_kind":"pith_short_12","alias_value":"L7OLBHRTJYEA","created_at":"2026-07-05T04:53:23Z"},{"alias_kind":"pith_short_16","alias_value":"L7OLBHRTJYEAQUTL","created_at":"2026-07-05T04:53:23Z"},{"alias_kind":"pith_short_8","alias_value":"L7OLBHRT","created_at":"2026-07-05T04:53:23Z"}],"graph_snapshots":[{"event_id":"sha256:d7fae8218067289def66ca5c08bc320a4111ccbc8fc0af5db7ed77753f0494a3","target":"graph","created_at":"2026-07-05T04:53:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.08030/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work studies the robust subspace tracking (ST) problem. Robust ST can be simply understood as a (slow) time-varying subspace extension of robust PCA. It assumes that the true data lies in a low-dimensional subspace that is either fixed or changes slowly with time. The goal is to track the changing subspaces over time in the presence of additive sparse outliers and to do this quickly (with a short delay). We introduce a \"fast\" mini-batch robust ST solution that is provably correct under mild assumptions. Here \"fast\" means two things: (i) the subspace changes can be detected and the subspac","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-14T21:35:30Z","title":"Fast Robust Subspace Tracking via PCA in Sparse Data-Dependent Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08030","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:0efe24b9818e73ce81ce0fa052a9da6bf79edbf0b8f5d8032895b10a796be836","target":"record","created_at":"2026-07-05T04:53:23Z","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":"08dd1572e29c72b0a95365066faac15c724b354b77c04c59427c4a54b0282fd1","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-14T21:35:30Z","title_canon_sha256":"7b0491321c3177b96ee59cbbdeb7b83f38803d0a4bc9ce3c52ea110993f9cf36"},"schema_version":"1.0","source":{"id":"2006.08030","kind":"arxiv","version":3}},"canonical_sha256":"5fdcb09e334e0808526b94812955851ab235dbc8730c4e3fca09fbf8d4f0c8cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fdcb09e334e0808526b94812955851ab235dbc8730c4e3fca09fbf8d4f0c8cc","first_computed_at":"2026-07-05T04:53:23.750153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:53:23.750153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KHI/xioH/VWCztfithL85IQHyNCSB92cKGHQFIPJa9UoLRKMDIY0Hznc5jnOfJqLZG2hVY71KebSV2UQ84zBAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:53:23.750598Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.08030","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0efe24b9818e73ce81ce0fa052a9da6bf79edbf0b8f5d8032895b10a796be836","sha256:d7fae8218067289def66ca5c08bc320a4111ccbc8fc0af5db7ed77753f0494a3"],"state_sha256":"c3291dcbac7b50df7da9c244080915344e6f854062c0251cc400fd94236dd0be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gJ3K4IL/WSN56hHb/N6qpr2MoOu6VnB8MfPF4ymBrtfB1fKn9etuHUKIenfuKqN1aRmnP6mH9/zY/Pu/0smUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T17:18:41.050025Z","bundle_sha256":"b825ec5ffaf6fc4bb5c203f8692999b2f58c2e859b25cc91bf4c76cb7f5a961e"}}