human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "outage behavior of integer forcing with random unitary pre processing"
  Abstract: Integer forcing is an equalization scheme for the multiple-input multiple-output communication channel that has been demonstrated to allow operating close to capacity for "most" 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 transmitted after applying a unitary transformation. At the receiver side, integer-forcing equalization is applied, followed by standard single-stream decoding. Considering pre-processing matrices drawn from a random ensemble, outage corresponds to the event that the target rate exceeds the achievable rate of integer forcing for a given channel matrix. For the case of 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 the number of transmit antennas. The results are also applied to obtain universal bounds on the gap-to-capacity of multiple-antenna closed-loop multicast, achievable via linear pre-processed integer forcing.

Connected through hyperedge HE-1 (induced by source paper "integer forcing architectures for uplink cloud radio access networks"):
  with members:
    - "achievability performance bounds for integer forcing source coding"
    - "green heterogeneous cloud radio access networks potential techniques performance trade offs and challenges"
    - "on the optimal fronthaul compression and decoding strategies for uplink cloud radio access networks"
    - "fronthaul compression and transmit beamforming optimization for multi antenna uplink c ran"
    - "system architecture and key technologies for 5g heterogeneous cloud radio access networks"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "optimized backhaul compression for uplink cloud radio access network"
    - "successive integer forcing and its sum rate optimality"

Connected through hyperedge HE-2 (induced by source paper "achievability performance bounds for integer forcing source coding"):
  with members:
    - "blind unwrapping of modulo reduced gaussian vectors recovering msbs from lsbs"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "integer forcing source coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "a simple proof for the existence of good pairs of nested lattices"

Connected through hyperedge HE-3 (induced by source paper "explicit lower bounds on the outage probability of integer forcing over nrx2 channels"):
  with members:
    - "outage behavior of randomly precoded integer forcing over mimo channels"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "the jacobi mimo channel"

Question: Please tell me which class the center node 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)