{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:423MBXNFXFVZUBRUWDT2ELH3CL","short_pith_number":"pith:423MBXNF","canonical_record":{"source":{"id":"1109.3827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-18T00:53:53Z","cross_cats_sorted":["cs.CV","cs.SY","math.IT","math.OC","stat.ML"],"title_canon_sha256":"4adfcaf1b1909ccbc5d87317ef9e1645107aa3d4fa3372dac3721da8de6082ac","abstract_canon_sha256":"61afa767fdb853feba4dea9a605368d5918ab8d9e75f9d420d8b31494eb6531a"},"schema_version":"1.0"},"canonical_sha256":"e6b6c0dda5b96b9a0634b0e7a22cfb12c1332a07d58fa3121d707d18424e2b96","source":{"kind":"arxiv","id":"1109.3827","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3827","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3827v2","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3827","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"423MBXNFXFVZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"423MBXNFXFVZUBRU","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"423MBXNF","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:423MBXNFXFVZUBRUWDT2ELH3CL","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-18T00:53:53Z","cross_cats_sorted":["cs.CV","cs.SY","math.IT","math.OC","stat.ML"],"title_canon_sha256":"4adfcaf1b1909ccbc5d87317ef9e1645107aa3d4fa3372dac3721da8de6082ac","abstract_canon_sha256":"61afa767fdb853feba4dea9a605368d5918ab8d9e75f9d420d8b31494eb6531a"},"schema_version":"1.0"},"canonical_sha256":"e6b6c0dda5b96b9a0634b0e7a22cfb12c1332a07d58fa3121d707d18424e2b96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:44.107878Z","signature_b64":"vJi+Vd2RzZpJzf4GeGbYkOV4kxJvESOtJGiisqELerSNjnrKQdwR912GQECpDvDcbcsG/opEAET5fDWHRiooAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6b6c0dda5b96b9a0634b0e7a22cfb12c1332a07d58fa3121d707d18424e2b96","last_reissued_at":"2026-05-18T04:12:44.107170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:44.107170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3827","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-18T04:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ydhR5LxHr8GGGdmypskpUnlMufsSAT2R6rNZi2vSv60hdI1iHwvKgVn0Fnmcrd1xdA4O4tNLDCy8W/ukG9z6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:05:02.703029Z"},"content_sha256":"494b54994ac4cfe9d7eff4475de391120fb0d52751ac071f56a332fcfea53b90","schema_version":"1.0","event_id":"sha256:494b54994ac4cfe9d7eff4475de391120fb0d52751ac071f56a332fcfea53b90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:423MBXNFXFVZUBRUWDT2ELH3CL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Robust Subspace Tracking from Partial Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.SY","math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"John C.S. Lui, Jun He, Laura Balzano","submitted_at":"2011-09-18T00:53:53Z","abstract_excerpt":"This paper presents GRASTA (Grassmannian Robust Adaptive Subspace Tracking Algorithm), an efficient and robust online algorithm for tracking subspaces from highly incomplete information. The algorithm uses a robust $l^1$-norm cost function in order to estimate and track non-stationary subspaces when the streaming data vectors are corrupted with outliers. We apply GRASTA to the problems of robust matrix completion and real-time separation of background from foreground in video. In this second application, we show that GRASTA performs high-quality separation of moving objects from background at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3827","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-18T04:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NRINfPY/mMQtES50sIxlmf6W66rgExDHGQtNJsQ98p6M4V1K9Qn50UwiYiEm78EKH/mHSa+TaIIMcvjN8jipCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:05:02.703412Z"},"content_sha256":"0c8df04383b280f626d948efc04a02b3ac931d7c631af2fceeb34f2a368e8d6e","schema_version":"1.0","event_id":"sha256:0c8df04383b280f626d948efc04a02b3ac931d7c631af2fceeb34f2a368e8d6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/423MBXNFXFVZUBRUWDT2ELH3CL/bundle.json","state_url":"https://pith.science/pith/423MBXNFXFVZUBRUWDT2ELH3CL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/423MBXNFXFVZUBRUWDT2ELH3CL/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-25T10:05:02Z","links":{"resolver":"https://pith.science/pith/423MBXNFXFVZUBRUWDT2ELH3CL","bundle":"https://pith.science/pith/423MBXNFXFVZUBRUWDT2ELH3CL/bundle.json","state":"https://pith.science/pith/423MBXNFXFVZUBRUWDT2ELH3CL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/423MBXNFXFVZUBRUWDT2ELH3CL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:423MBXNFXFVZUBRUWDT2ELH3CL","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":"61afa767fdb853feba4dea9a605368d5918ab8d9e75f9d420d8b31494eb6531a","cross_cats_sorted":["cs.CV","cs.SY","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-18T00:53:53Z","title_canon_sha256":"4adfcaf1b1909ccbc5d87317ef9e1645107aa3d4fa3372dac3721da8de6082ac"},"schema_version":"1.0","source":{"id":"1109.3827","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3827","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3827v2","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3827","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"423MBXNFXFVZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"423MBXNFXFVZUBRU","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"423MBXNF","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:0c8df04383b280f626d948efc04a02b3ac931d7c631af2fceeb34f2a368e8d6e","target":"graph","created_at":"2026-05-18T04:12:44Z","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 paper presents GRASTA (Grassmannian Robust Adaptive Subspace Tracking Algorithm), an efficient and robust online algorithm for tracking subspaces from highly incomplete information. The algorithm uses a robust $l^1$-norm cost function in order to estimate and track non-stationary subspaces when the streaming data vectors are corrupted with outliers. We apply GRASTA to the problems of robust matrix completion and real-time separation of background from foreground in video. In this second application, we show that GRASTA performs high-quality separation of moving objects from background at ","authors_text":"John C.S. Lui, Jun He, Laura Balzano","cross_cats":["cs.CV","cs.SY","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-18T00:53:53Z","title":"Online Robust Subspace Tracking from Partial Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3827","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:494b54994ac4cfe9d7eff4475de391120fb0d52751ac071f56a332fcfea53b90","target":"record","created_at":"2026-05-18T04:12:44Z","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":"61afa767fdb853feba4dea9a605368d5918ab8d9e75f9d420d8b31494eb6531a","cross_cats_sorted":["cs.CV","cs.SY","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-18T00:53:53Z","title_canon_sha256":"4adfcaf1b1909ccbc5d87317ef9e1645107aa3d4fa3372dac3721da8de6082ac"},"schema_version":"1.0","source":{"id":"1109.3827","kind":"arxiv","version":2}},"canonical_sha256":"e6b6c0dda5b96b9a0634b0e7a22cfb12c1332a07d58fa3121d707d18424e2b96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6b6c0dda5b96b9a0634b0e7a22cfb12c1332a07d58fa3121d707d18424e2b96","first_computed_at":"2026-05-18T04:12:44.107170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:44.107170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vJi+Vd2RzZpJzf4GeGbYkOV4kxJvESOtJGiisqELerSNjnrKQdwR912GQECpDvDcbcsG/opEAET5fDWHRiooAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:44.107878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3827","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:494b54994ac4cfe9d7eff4475de391120fb0d52751ac071f56a332fcfea53b90","sha256:0c8df04383b280f626d948efc04a02b3ac931d7c631af2fceeb34f2a368e8d6e"],"state_sha256":"ca99181e18e692d919e629ab2aa4a66f3ffebf6548b32058afe05a9620e104ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8nJAaAFSezeB0aLTI1AeZJuoJcGB3GBKbv2K2cP7W8a1t4Iw14WE0jn5k5MSLr5I0LVcNk1tpErat/YHMJkpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:05:02.708212Z","bundle_sha256":"fbbe31aa8e8bd3d282bfb95b8a281db14412c47c09eee8c9c6f3af036a8578c2"}}