{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5AZNC23FROYF2KRFR5FSH2KJYE","short_pith_number":"pith:5AZNC23F","schema_version":"1.0","canonical_sha256":"e832d16b658bb05d2a258f4b23e949c1298c9adce79755646d5b4d409c244d39","source":{"kind":"arxiv","id":"1802.02885","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.02885","created_at":"2026-05-18T00:24:02.888123+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02885v1","created_at":"2026-05-18T00:24:02.888123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02885","created_at":"2026-05-18T00:24:02.888123+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AZNC23FROYF","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AZNC23FROYF2KRF","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AZNC23F","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE","json":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE.json","graph_json":"https://pith.science/api/pith-number/5AZNC23FROYF2KRFR5FSH2KJYE/graph.json","events_json":"https://pith.science/api/pith-number/5AZNC23FROYF2KRFR5FSH2KJYE/events.json","paper":"https://pith.science/paper/5AZNC23F"},"agent_actions":{"view_html":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE","download_json":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE.json","view_paper":"https://pith.science/paper/5AZNC23F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02885&json=true","fetch_graph":"https://pith.science/api/pith-number/5AZNC23FROYF2KRFR5FSH2KJYE/graph.json","fetch_events":"https://pith.science/api/pith-number/5AZNC23FROYF2KRFR5FSH2KJYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE/action/storage_attestation","attest_author":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE/action/author_attestation","sign_citation":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE/action/citation_signature","submit_replication":"https://pith.science/pith/5AZNC23FROYF2KRFR5FSH2KJYE/action/replication_record"}},"created_at":"2026-05-18T00:24:02.888123+00:00","updated_at":"2026-05-18T00:24:02.888123+00:00"}