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: "the diversity multiplexing tradeoff for interference networks"
  Abstract: The diversity-multiplexing tradeoff (DMT) for interference networks, such as the interference channel, the X channel, the Z interference channel and the Z channel, is analyzed. In particular, we investigate the impact of rate-splitting and channel knowledge at the transmitters. We also use the DMT of the Z channel and the Z interference channel to distill insights into the "loud neighbor" problem for femto-cell networks.

Connected through hyperedge HE-1 (induced by source paper "a diversity multiplexing delay tradeoff of arq protocols in the z interference channel"):
  with members:
    - "diversity multiplexing tradeoff in fading interference channels"

Connected through hyperedge HE-2 (induced by source paper "on the diversity gain region of the z interference channels"):
  with members:
    - "diversity multiplexing tradeoff in fading interference channels"

Connected through hyperedge HE-3 (induced by source paper "the diversity multiplexing tradeoff of the mimo z interference channel"):
  with members:
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "the diversity multiplexing tradeoff of the mimo half duplex relay channel"
    - "the diversity multiplexing tradeoff of the dynamic decode and forward protocol on a mimo half duplex relay channel"
    - "the diversity multiplexing tradeoff of the symmetric mimo 2 user interference channel"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "diversity multiplexing tradeoff in fading interference channels"
    - "diversity multiplexing tradeoff of the two user interference channel"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-4 (induced by source paper "outage analysis of block fading gaussian interference channels"):
  with members:
    - "diversity multiplexing tradeoff of the two user interference channel"
    - "on the achievable diversity multiplexing tradeoff in interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "multiple access outerbounds and the inseparability of parallel interference channels"
    - "sum capacity of ergodic fading interference and compound multiaccess channels"
    - "gaussian interference channel capacity to within one bit"
    - "interference alignment and the degrees of freedom for the k user interference 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)