human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "online decomposition of compressive streaming data using n ell_1 cluster weighted minimization"):
  Abstract: 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 along with their correlations with multiple previously-recovered sparse vectors. Moreover, the proposed minimization can exploit the structures of sparse components via clustering and re-weighting iteratively. The method outperforms the existing methods for both numerical data and actual video data.

Includes members:
  Member "sparse signal reconstruction with multiple side information using adaptive weights for multiview sources":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "compressive online robust principal component analysis with optical flow for video foreground background separation")
  Member "approximation algorithms for model based compressive sensing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stochastic iterative hard thresholding for graph structured sparsity optimization")
  Member "an online algorithm for separating sparse and low dimensional signal sequences from their sum":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "provable dynamic robust pca or robust subspace tracking")
  Member "compressive principal component pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "modified cs modifying compressive sensing for problems with partially known support":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multilinear compressive learning with prior knowledge")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)