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 "precoded integer forcing universally achieves the mimo capacity to within a constant gap"):
  Abstract: An open-loop single-user multiple-input multiple-output communication scheme is considered where a transmitter, equipped with multiple antennas, encodes the data into independent streams all taken from the same linear code. The coded streams are then linearly precoded using the encoding matrix of a perfect linear dispersion space-time code. At the receiver side, integer-forcing equalization is applied, followed by standard single-stream decoding. It is shown that this communication architecture achieves the capacity of any Gaussian multiple-input multiple-output channel up to a gap that depends only on the number of transmit antennas.

Includes members:
  Member "successive integer forcing and its sum rate optimality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "structured lattice codes for 2 times 2 times 2 mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations")
  Member "an algebraic approach to physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "optimization of integer forcing precoding for multi user mimo downlink")
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private information retrieval over gaussian mac")
  Member "integer forcing mimo linear receivers based on lattice reduction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")
  Member "a simple proof for the existence of good pairs of nested lattices":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "private information retrieval over gaussian mac")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "best relay selection in gaussian half duplex diamond networks")

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)