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: "diversity multiplexing tradeoff of the two user interference channel"
  Abstract: Diversity-Multiplexing tradeoff (DMT) is a coarse high SNR approximation of the fundamental tradeoff between data rate and reliability in a slow fading channel. In this paper, we characterize the fundamental DMT of the two user single antenna Gaussian interference channel. We show that the class of multilevel superposition coding schemes universally achieves (for all fading statistics) the DMT for the two-user interference channel. For the special case of symmetric DMT, when the two users have identical rate and diversity gain requirements, we characterize the DMT achieved by the Han-Kobayashi scheme, which corresponds to two level superposition coding.

Connected through hyperedge HE-1 (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"
    - "the diversity multiplexing tradeoff for interference networks"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-2 (induced by source paper "the degrees of freedom of mimo interference channels without state information at transmitters"):
  with members:
    - "degrees of freedom regions of two user mimo z and full interference channels the benefit of reconfigurable antennas"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "ergodic fading one sided interference channels without state information at transmitters"
    - "isotropic mimo interference channels without csit the loss of degrees of freedom"
    - "on degrees of freedom region of mimo networks without csit"
    - "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit"
    - "degrees of freedom of the k user m times n mimo interference channel"

Connected through hyperedge HE-3 (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"
    - "outage analysis of block fading gaussian interference channels"
    - "diversity multiplexing tradeoff in fading interference channels"
    - "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-4 (induced by source paper "isotropic mimo interference channels without csit the loss of degrees of freedom"):
  with members:
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "diversity multiplexing tradeoff in fading interference channels"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "on degrees of freedom region of mimo networks without csit"
    - "degrees of freedom of the k user m times n mimo interference channel"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "the two user gaussian compound interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-5 (induced by source paper "outage analysis of block fading gaussian interference channels"):
  with members:
    - "on the achievable diversity multiplexing tradeoff in interference channels"
    - "the diversity multiplexing tradeoff for interference networks"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "capacity region of layered erasure one sided interference channels without csit"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "ergodic fading one sided interference channels without state information at transmitters"
    - "ergodic layered erasure one sided interference channels"
    - "fading broadcast channels with state information at the receivers"
    - "gaussian interference channel capacity to within one bit"
    - "on the capacity of fading mimo broadcast channels with imperfect transmitter side information"

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)