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 "on integer forcing precoding for the gaussian mimo broadcast channel"):
  Abstract: Integer-forcing (IF) precoding, a generalization of so-called reverse compute-and-forward, is a promising new approach for communication over multiple-input multiple-output (MIMO) broadcast channels (BC), also known as multiuser MIMO downlink. Inspired by the integer-forcing framework for multiple-access channels, it generalizes linear precoding by inducing an effective channel matrix that is approximately integer, rather than approximately identity. Combined with lattice encoding and a pre-inversion of the channel matrix at the transmitter, the scheme has the potential to outperform any linear precoding scheme, despite enjoying similar low complexity. #R##N#In this paper, a specific IF precoding scheme, called diagonally-scaled exact IF (DIF), is proposed and shown to achieve maximum spatial multiplexing gain. For the special case of two receivers, in the high SNR regime, an optimal choice of parameters is derived analytically, leading to an almost closed-form expression for the achievable sum rate. In particular, it is shown that the gap to the sum capacity is upper bounded by 0.27 bits for any channel realization. For general SNR, a regularized version of DIF (RDIF) is proposed. Numerical results for two receivers under Rayleigh fading show that RDIF can achieve performance superior to optimal linear precoding and very close to zero-forcing dirty-paper coding.

Includes members:
  Member "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "full diversity unitary precoded integer forcing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")
  Member "optimal multiuser transmit beamforming a difficult problem with a simple solution structure":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "massive mimo has unlimited capacity")
  Member "uplink downlink duality for integer forcing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations")
  Member "precoded integer forcing universally achieves the mimo capacity to within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "an algebraic approach to physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "reverse compute and forward a low complexity architecture for downlink distributed antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimization of integer forcing precoding for multi user mimo downlink")
  Member "compute and forward strategies for cooperative distributed antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "private information retrieval over gaussian mac")

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)