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 "joint user selection and precoding in multiuser mimo systems via group lasso"):
  Abstract: Joint user selection and precoding in multiuser MIMO settings can be interpreted as group sparse recovery in linear models. In this problem, a signal with group sparsity is to be reconstructed from an underdetermined system of equations. This paper utilizes this equivalent interpretation and develops a computationally tractable algorithm based on the method of group LASSO. Compared to the state of the art, the proposed scheme shows performance enhancements in two different respects: higher achievable sum-rate and lower interference at the non-selected user terminals.

Includes members:
  Member "secure regularized zero forcing for multiuser mimome channels":
    also connected through other hyperedges:
      (none)
  Member "precoding via approximate message passing with instantaneous signal constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "papr limited precoding in massive mimo systems with reflect and transmit array antennas")
  Member "on robustness of massive mimo systems against passive eavesdropping under antenna selection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping")
  Member "glse precoders for massive mimo systems analysis and applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping")
  Member "theoretical bounds on map estimation in distributed sensing networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an adaptive bayesian framework for recovery of sources with structured sparsity")
  Member "nonlinear precoders for massive mimo systems with general constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure regularized zero forcing for multiuser mimome channels")
  Member "asymptotics of nonlinear lse precoders with applications to transmit antenna selection":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping")
  Member "generalized approximate message passing for estimation with random linear mixing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")

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)