{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5AZNC23FROYF2KRFR5FSH2KJYE","short_pith_number":"pith:5AZNC23F","canonical_record":{"source":{"id":"1802.02885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-08T14:42:13Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"a22fe5504042440d96ba59a597fd98aea9114a87a8980473fb71bedd4fa852d7","abstract_canon_sha256":"f83633420a643213e753a829885aacd313cef80addf8901fdbbc7f53c31ac938"},"schema_version":"1.0"},"canonical_sha256":"e832d16b658bb05d2a258f4b23e949c1298c9adce79755646d5b4d409c244d39","source":{"kind":"arxiv","id":"1802.02885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02885","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02885v1","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02885","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"5AZNC23FROYF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5AZNC23FROYF2KRF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5AZNC23F","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5AZNC23FROYF2KRFR5FSH2KJYE","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-08T14:42:13Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"a22fe5504042440d96ba59a597fd98aea9114a87a8980473fb71bedd4fa852d7","abstract_canon_sha256":"f83633420a643213e753a829885aacd313cef80addf8901fdbbc7f53c31ac938"},"schema_version":"1.0"},"canonical_sha256":"e832d16b658bb05d2a258f4b23e949c1298c9adce79755646d5b4d409c244d39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:02.888664Z","signature_b64":"JYgVcccgvKvB/vPnz0PSlUxcAopL0FkEcsm972lUL8CFOzwGLZxH0vLduhgKGw8zdR8IXXrBenZ4rDLp/w8SDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e832d16b658bb05d2a258f4b23e949c1298c9adce79755646d5b4d409c244d39","last_reissued_at":"2026-05-18T00:24:02.888007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:02.888007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02885","source_version":1,"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:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPyTxWNB0lilVWb7FBUsuNED545o8ugR3fKWnpXA8u2kadxomWSif1ZfucXfjYKiNoZB460TVDq/J/aZ6iJpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:19:17.934259Z"},"content_sha256":"a13a298cf6a061e1f8a98ebb95acca6876328a88b5b49e368a8e439f44099194","schema_version":"1.0","event_id":"sha256:a13a298cf6a061e1f8a98ebb95acca6876328a88b5b49e368a8e439f44099194"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5AZNC23FROYF2KRFR5FSH2KJYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Decomposition of Compressive Streaming Data Using $n$-$\\ell_1$ Cluster-Weighted Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Andr\\'e Kaup, Huynh Van Luong, Nikos Deligiannis, S{\\o}ren Forchhammer","submitted_at":"2018-02-08T14:42:13Z","abstract_excerpt":"We consider a decomposition method for compressive streaming data in the context of online compressive Robust Principle Component Analysis (RPCA). The proposed decomposition solves an $n$-$\\ell_1$ cluster-weighted minimization to decompose a sequence of frames (or vectors), into sparse and low-rank components, from compressive measurements. Our method processes a data vector of the stream per time instance from a small number of measurements in contrast to conventional batch RPCA, which needs to access full data. The $n$-$\\ell_1$ cluster-weighted minimization leverages the sparse components al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02885","kind":"arxiv","version":1},"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:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTl/driXfqcthHYlhiV1R4tA6b1lgai0Axau5XzsSHi7+kZm8L3PYV38Hrzgkq9L4s3D6iAwNglHiISsxLuoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:19:17.934630Z"},"content_sha256":"b63770e20443304db94d9967c4062c7ed4bb7758f98f7b8f8c58776f90a53195","schema_version":"1.0","event_id":"sha256:b63770e20443304db94d9967c4062c7ed4bb7758f98f7b8f8c58776f90a53195"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE/bundle.json","state_url":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AZNC23FROYF2KRFR5FSH2KJYE/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-19T23:19:17Z","links":{"resolver":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE","bundle":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE/bundle.json","state":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AZNC23FROYF2KRFR5FSH2KJYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5AZNC23FROYF2KRFR5FSH2KJYE","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":"f83633420a643213e753a829885aacd313cef80addf8901fdbbc7f53c31ac938","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-08T14:42:13Z","title_canon_sha256":"a22fe5504042440d96ba59a597fd98aea9114a87a8980473fb71bedd4fa852d7"},"schema_version":"1.0","source":{"id":"1802.02885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02885","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02885v1","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02885","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"5AZNC23FROYF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5AZNC23FROYF2KRF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5AZNC23F","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:b63770e20443304db94d9967c4062c7ed4bb7758f98f7b8f8c58776f90a53195","target":"graph","created_at":"2026-05-18T00:24:02Z","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 a decomposition method for compressive streaming data in the context of online compressive Robust Principle Component Analysis (RPCA). The proposed decomposition solves an $n$-$\\ell_1$ cluster-weighted minimization to decompose a sequence of frames (or vectors), into sparse and low-rank components, from compressive measurements. Our method processes a data vector of the stream per time instance from a small number of measurements in contrast to conventional batch RPCA, which needs to access full data. The $n$-$\\ell_1$ cluster-weighted minimization leverages the sparse components al","authors_text":"Andr\\'e Kaup, Huynh Van Luong, Nikos Deligiannis, S{\\o}ren Forchhammer","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-08T14:42:13Z","title":"Online Decomposition of Compressive Streaming Data Using $n$-$\\ell_1$ Cluster-Weighted Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02885","kind":"arxiv","version":1},"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:a13a298cf6a061e1f8a98ebb95acca6876328a88b5b49e368a8e439f44099194","target":"record","created_at":"2026-05-18T00:24:02Z","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":"f83633420a643213e753a829885aacd313cef80addf8901fdbbc7f53c31ac938","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-08T14:42:13Z","title_canon_sha256":"a22fe5504042440d96ba59a597fd98aea9114a87a8980473fb71bedd4fa852d7"},"schema_version":"1.0","source":{"id":"1802.02885","kind":"arxiv","version":1}},"canonical_sha256":"e832d16b658bb05d2a258f4b23e949c1298c9adce79755646d5b4d409c244d39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e832d16b658bb05d2a258f4b23e949c1298c9adce79755646d5b4d409c244d39","first_computed_at":"2026-05-18T00:24:02.888007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:02.888007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JYgVcccgvKvB/vPnz0PSlUxcAopL0FkEcsm972lUL8CFOzwGLZxH0vLduhgKGw8zdR8IXXrBenZ4rDLp/w8SDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:02.888664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a13a298cf6a061e1f8a98ebb95acca6876328a88b5b49e368a8e439f44099194","sha256:b63770e20443304db94d9967c4062c7ed4bb7758f98f7b8f8c58776f90a53195"],"state_sha256":"b27e5fd333f9430901a447d77a183cc5af6cbcb9c46fb549c63c89cc954fe44a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"//td6jXgZRAvgW1pR2x+ELt2OaT1N2ZPysVTOZQuSWqBN9KemXjwUIkRk0/SW3PfPOxQHZ4KRypH0o81FwuNBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T23:19:17.936563Z","bundle_sha256":"96867f0413c3118bc31f82157307576c9f26939105eb1c51283100e0b7dabcf7"}}