{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W26HT47SHP7VAKXLSST2J5XIML","short_pith_number":"pith:W26HT47S","canonical_record":{"source":{"id":"1701.06852","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T13:02:27Z","cross_cats_sorted":["cs.AI","math.IT","stat.ML"],"title_canon_sha256":"5654f31a63ff07136c073014d534af1f730e38d79f67b8b061beb81e8a277376","abstract_canon_sha256":"999f038203206564bc36a6d0686f597e82e4a0110ca8ac871f3356c585189613"},"schema_version":"1.0"},"canonical_sha256":"b6bc79f3f23bff502aeb94a7a4f6e862c664a6c97b03c566f62aedcb0d61fca0","source":{"kind":"arxiv","id":"1701.06852","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06852","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06852v2","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06852","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"pith_short_12","alias_value":"W26HT47SHP7V","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W26HT47SHP7VAKXL","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W26HT47S","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W26HT47SHP7VAKXLSST2J5XIML","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06852","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T13:02:27Z","cross_cats_sorted":["cs.AI","math.IT","stat.ML"],"title_canon_sha256":"5654f31a63ff07136c073014d534af1f730e38d79f67b8b061beb81e8a277376","abstract_canon_sha256":"999f038203206564bc36a6d0686f597e82e4a0110ca8ac871f3356c585189613"},"schema_version":"1.0"},"canonical_sha256":"b6bc79f3f23bff502aeb94a7a4f6e862c664a6c97b03c566f62aedcb0d61fca0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:35.291576Z","signature_b64":"w0eGlJuKjJ6HDGm0ZuoF1maE3f5WEdck9MZcaXTHfpdHYGOG3EEVJg8xwUvf2vryIatx7dhXRbRG2XQLHPN0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6bc79f3f23bff502aeb94a7a4f6e862c664a6c97b03c566f62aedcb0d61fca0","last_reissued_at":"2026-05-18T00:43:35.291190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:35.291190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06852","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-18T00:43:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v/CuCzVv8GprvaYclQj/G/eQ6xrT7T4nbYh5RPqFujWBCCkgWBdkrnfH5VJZ18fNhHfGmgaZ5z5X2w3fZidzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:08:12.752643Z"},"content_sha256":"271dc54b41493cd7ebdd0d48e17b5425d4ae4d47e9aeab5faee8e28ce0b7e17a","schema_version":"1.0","event_id":"sha256:271dc54b41493cd7ebdd0d48e17b5425d4ae4d47e9aeab5faee8e28ce0b7e17a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W26HT47SHP7VAKXLSST2J5XIML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incorporating Prior Information in Compressive Online Robust Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Andre Kaup, Huynh Van Luong, Jurgen Seiler, Nikos Deligiannis, Soren Forchhammer","submitted_at":"2017-01-24T13:02:27Z","abstract_excerpt":"We consider an online version of the robust Principle Component Analysis (PCA), which arises naturally in time-varying source separations such as video foreground-background separation. This paper proposes a compressive online robust PCA with prior information for recursively separating a sequences of frames into sparse and low-rank components from a small set of measurements. In contrast to conventional batch-based PCA, which processes all the frames directly, the proposed method processes measurements taken from each frame. Moreover, this method can efficiently incorporate multiple prior inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06852","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-18T00:43:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eeF2In/RdX65xcOz47ewRapBL5auY+sfT7mvUaVsPTn2tYXCqbO0RRqXM37HC3lqSA3Uxz5olxR702TWDddQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:08:12.753003Z"},"content_sha256":"dafd7cb3eaeac7c314af02c27471d847cb6a00e169750c098ad1ff82466cdc74","schema_version":"1.0","event_id":"sha256:dafd7cb3eaeac7c314af02c27471d847cb6a00e169750c098ad1ff82466cdc74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W26HT47SHP7VAKXLSST2J5XIML/bundle.json","state_url":"https://pith.science/pith/W26HT47SHP7VAKXLSST2J5XIML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W26HT47SHP7VAKXLSST2J5XIML/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-20T05:08:12Z","links":{"resolver":"https://pith.science/pith/W26HT47SHP7VAKXLSST2J5XIML","bundle":"https://pith.science/pith/W26HT47SHP7VAKXLSST2J5XIML/bundle.json","state":"https://pith.science/pith/W26HT47SHP7VAKXLSST2J5XIML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W26HT47SHP7VAKXLSST2J5XIML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W26HT47SHP7VAKXLSST2J5XIML","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":"999f038203206564bc36a6d0686f597e82e4a0110ca8ac871f3356c585189613","cross_cats_sorted":["cs.AI","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T13:02:27Z","title_canon_sha256":"5654f31a63ff07136c073014d534af1f730e38d79f67b8b061beb81e8a277376"},"schema_version":"1.0","source":{"id":"1701.06852","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06852","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06852v2","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06852","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"pith_short_12","alias_value":"W26HT47SHP7V","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W26HT47SHP7VAKXL","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W26HT47S","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:dafd7cb3eaeac7c314af02c27471d847cb6a00e169750c098ad1ff82466cdc74","target":"graph","created_at":"2026-05-18T00:43:35Z","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":"We consider an online version of the robust Principle Component Analysis (PCA), which arises naturally in time-varying source separations such as video foreground-background separation. This paper proposes a compressive online robust PCA with prior information for recursively separating a sequences of frames into sparse and low-rank components from a small set of measurements. In contrast to conventional batch-based PCA, which processes all the frames directly, the proposed method processes measurements taken from each frame. Moreover, this method can efficiently incorporate multiple prior inf","authors_text":"Andre Kaup, Huynh Van Luong, Jurgen Seiler, Nikos Deligiannis, Soren Forchhammer","cross_cats":["cs.AI","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T13:02:27Z","title":"Incorporating Prior Information in Compressive Online Robust Principal Component Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06852","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:271dc54b41493cd7ebdd0d48e17b5425d4ae4d47e9aeab5faee8e28ce0b7e17a","target":"record","created_at":"2026-05-18T00:43:35Z","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":"999f038203206564bc36a6d0686f597e82e4a0110ca8ac871f3356c585189613","cross_cats_sorted":["cs.AI","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T13:02:27Z","title_canon_sha256":"5654f31a63ff07136c073014d534af1f730e38d79f67b8b061beb81e8a277376"},"schema_version":"1.0","source":{"id":"1701.06852","kind":"arxiv","version":2}},"canonical_sha256":"b6bc79f3f23bff502aeb94a7a4f6e862c664a6c97b03c566f62aedcb0d61fca0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6bc79f3f23bff502aeb94a7a4f6e862c664a6c97b03c566f62aedcb0d61fca0","first_computed_at":"2026-05-18T00:43:35.291190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:35.291190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w0eGlJuKjJ6HDGm0ZuoF1maE3f5WEdck9MZcaXTHfpdHYGOG3EEVJg8xwUvf2vryIatx7dhXRbRG2XQLHPN0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:35.291576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06852","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:271dc54b41493cd7ebdd0d48e17b5425d4ae4d47e9aeab5faee8e28ce0b7e17a","sha256:dafd7cb3eaeac7c314af02c27471d847cb6a00e169750c098ad1ff82466cdc74"],"state_sha256":"869a8d34be16eb2df6c90c793bf640afcc879fefbb6bf76d07d9b787fc13e914"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7rL6yqScL0ysm8H5O3SewbwREyp6diKyhiz2Iqa0odqcKrJNzdSyda2i1eigoyWJWl1A/2oHoqihfjgNht7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:08:12.755016Z","bundle_sha256":"157637c2db53f2c6784de6ca29c5cc34e825a68efb2fbbc8d8bee7ef9aa64161"}}