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 analysis of block fading gaussian interference channels"
  Abstract: This paper considers the asymptotic behavior of two-source block-fading single-antenna Gaussian interference channels in the high-SNR regime by means of the diversity-multiplexing tradeoff. We consider a general setting where the users and the average channel gains are not restricted to be symmetric. Our results are not just extensions of previous results for symmetric networks, as our setting covers scenarios that are not possible under the symmetric assumption, such as the case of "mixed" interference, i.e., when difference sources have different distances from their intended receivers. We derive upper and lower bounds on the diversity. We show that for a fairly large set of channel parameters the two bounds coincides.

Connected through hyperedge HE-1 (induced by source paper "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"):
  with members:
    - "capacity bounds for wireless ergodic fading broadcast channels with partial csit"
    - "fundamental limits of communications in interference networks part i basic structures"
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "ergodic fading interference channels sum capacity and separability"
    - "interference mitigation through limited transmitter cooperation"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "a general coding scheme for two user fading interference channels"
    - "interference mitigation through limited receiver cooperation"

Connected through hyperedge HE-2 (induced by source paper "the diversity multiplexing tradeoff of the symmetric mimo 2 user interference channel"):
  with members:
    - "the diversity multiplexing tradeoff of the mimo z interference channel"
    - "diversity multiplexing tradeoff in fading interference channels"
    - "diversity multiplexing tradeoff of the two user interference channel"
    - "isotropic mimo interference channels without csit the loss of degrees of freedom"
    - "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "diversity multiplexing tradeoff of the two user interference channel"):
  with members:
    - "on the achievable diversity multiplexing tradeoff in interference channels"
    - "the two user gaussian compound interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "approximately universal codes over slow fading channels"

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)