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 "achievable rates of mimo systems with linear precoding and iterative lmmse detection"):
  Abstract: We establish area theorems for iterative detection over coded linear systems (including multiple-input multipleoutput (MIMO) channels, inter-symbol-interference (ISI) channels, and orthogonal frequency-division multiplexing (OFDM) systems). We propose a linear precoding technique that asymptotically ensures the Gaussianness of the messages passed in iterative detection, as the transmission block length tends to infinity. We show that the proposed linear precoding scheme with iterative linear minimum mean-square error (LMMSE) detection is potentially information lossless, under various assumptions on the availability of channel state information at the transmitter (CSIT). Numerical results are provided to verify our analysis.

Includes members:
  Member "estimation in gaussian noise properties of the minimum mean square error":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "compressed coding amp based decoding and analog spatial coupling")
  Member "on optimal precoding in linear vector gaussian channels with arbitrary input distribution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "measurement matrix design for phase retrieval based on mutual information")
  Member "design of block transceivers with decision feedback detection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "the generalized area theorem and some of its consequences":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reed muller codes theory and algorithms")
  Member "randomly spread cdma asymptotics via statistical physics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")
  Member "mutual information and minimum mean square error in gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")

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)