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 "integer forcing linear receivers"):
  Abstract: Linear receivers are often used to reduce the implementation complexity of multiple-antenna systems. In a traditional linear receiver architecture, the receive antennas are used to separate out the codewords sent by each transmit antenna, which can then be decoded individually. Although easy to implement, this approach can be highly suboptimal when the channel matrix is near singular. This paper develops a new linear receiver architecture that uses the receive antennas to create an effective channel matrix with integer-valued entries. Rather than attempting to recover transmitted codewords directly, the decoder recovers integer combinations of the codewords according to the entries of the effective channel matrix. The codewords are all generated using the same linear code which guarantees that these integer combinations are themselves codewords. Provided that the effective channel is full rank, these integer combinations can then be digitally solved for the original codewords. This paper focuses on the special case where there is no coding across transmit antennas and no channel state information at the transmitter(s), which corresponds either to a multi-user uplink scenario or to single-user V-BLAST encoding. In this setting, the proposed integer-forcing linear receiver significantly outperforms conventional linear architectures such as the zero-forcing and linear MMSE receiver. In the high SNR regime, the proposed receiver attains the optimal diversity-multiplexing tradeoff for the standard MIMO channel with no coding across transmit antennas. It is further shown that in an extended MIMO model with interference, the integer-forcing linear receiver achieves the optimal generalized degrees-of-freedom.

Includes members:
  Member "lattices over eisenstein integers for compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "successive integer forcing and its sum rate optimality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "multilevel coding schemes for compute and forward with flexible decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compute compress and forward exploiting asymmetry of wireless relay networks")
  Member "an algebraic approach to physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "on complex lll algorithm for integer forcing linear receivers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "integer forcing message recovering in interference channels")
  Member "reverse compute and forward a low complexity architecture for downlink distributed antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimization of integer forcing precoding for multi user mimo downlink")
  Member "integer forcing mimo linear receivers based on lattice reduction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")
  Member "achieving a vanishing snr gap to exact lattice decoding at a subexponential complexity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)