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 "outage behavior of randomly precoded integer forcing over mimo channels"):
  Abstract: Integer forcing is an equalization scheme for the multiple-input multiple-output (MIMO) communication channel that has been demonstrated to allow operating close to capacity for "most" MIMO channels. In this work, the measure of "bad" channels is quantified by considering a compound channel setting where the transmitter communicates over a fixed channel but knows only its mutual information. The transmitter encodes the data into independent streams, all taken from the same linear code. The coded streams are then precoded using a unitary matrix. At the receiver side, integer-forcing equalization is applied, followed by standard single-stream decoding. Considering precoding matrices being drawn from a random ensemble, outage corresponds to the event that the target rate exceeds the achievable rate of integer forcing for a given precoding matrix realization. Assuming precoding matrices drawn from the circular unitary ensemble, an explicit universal bound on the outage probability for a given target rate is derived that holds for any channel in the compound class. The derived bound depends only on the gap-to-capacity and number of transmit antennas, and is tight enough to be of interest for moderate values of capacity. The results are also applied to obtain universal bounds on the gap-to-capacity of MIMO closed-loop multicast, achievable via precoded integer forcing.

Includes members:
  Member "joint unitary triangularization for gaussian multi user mimo networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "outage behavior of integer forcing with random unitary pre processing")
  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 "precoded integer forcing universally achieves the mimo capacity to within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "on complex lll algorithm for integer forcing linear receivers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "integer forcing message recovering in interference channels")
  Member "a simple proof for the existence of good pairs of nested lattices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private information retrieval over gaussian mac")
  Member "integer forcing linear receivers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)