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 "precoding via approximate message passing with instantaneous signal constraints"):
  Abstract: This paper proposes a low complexity precoding algorithm based on the recently proposed Generalized Least Square Error (GLSE) scheme with generic penalty and support. The algorithm iteratively constructs the transmit vector via Approximate Message Passing (AMP). Using the asymptotic decoupling property of GLSE precoders, we derive closed form fixed point equations to tune the parameters in the proposed algorithm for a general set of instantaneous signal constraints. The tuning strategy is then utilized to construct transmit vectors with restricted peak-to-average power ratios and to efficiently select a subset of transmit antennas. The numerical investigations show that the proposed algorithm tracks the large-system performance of GLSE precoders even for a moderate number of antennas.

Includes members:
  Member "nonlinear precoders for massive mimo systems with general constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping")
  Member "asymptotics of transmit antenna selection impact of multiple receive antennas":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping")
  Member "fixed points of generalized approximate message passing with arbitrary matrices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "per antenna constant envelope precoding for large multi user mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep learning enabled optimization of downlink beamforming under per antenna power constraints algorithms and experimental demonstration")
  Member "generalized approximate message passing for estimation with random linear mixing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "message passing algorithms for compressed sensing":
    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)