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 "ultra low complexity soft output detector for non binary ldpc coded large mimo systems"):
  Abstract: The theoretic results of MIMO capacity tell us that the higher the number of antennas are employed, the higher the transmission rate is. This makes MIMO systems with hundreds of antennas very attractive but one of the major problems that obstructs such large dimensional MIMO systems from the practical realization is a high complexity of the MIMO detector. We present in this paper the new soft output MIMO detector based on matched filtering that can be applied to the large MIMO systems which are coded by the powerful non-binary LDPC codes. The per-bit complexity of the proposed detector is just 0.28% to that of low complexity soft output MMSE detector and scales only linearly with a number of antennas. Furthermore, the coded performances with small information length 800 bits are within 4.2 dB from the associated MIMO capacity.

Includes members:
  Member "near capacity approaching for large mimo systems by non binary ldpc codes with mmse detection":
    also connected through other hyperedges:
      (none)
  Member "massive mimo how many antennas do we need":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decentralized equalization with feedforward architectures for massive mu mimo")
  Member "mimo detection for high order qam based on a gaussian tree approximation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi user detection based on expectation propagation for the non coherent simo multiple access channel")
  Member "high rate space time coded large mimo systems low complexity detection and channel estimation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fifty years of mimo detection the road to large scale mimos")

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)