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 in fading interference channels"
  Abstract: We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. We compute the diversity-multiplexing tradeoff (DMT) region of a fixed-power-split Han and Kobayashi (HK)-type superposition coding scheme and provide design criteria for the corresponding superposition codes. We demonstrate that this scheme is DMT-optimal under moderate, strong, and very strong interference by showing that it achieves a DMT outer bound that we derive. Further, under very strong interference, we show that a joint decoder is DMT-optimal and "decouples" the fading interference channel, i.e., from a DMT perspective, it is possible to transmit as if the interfering user were not present. In addition, we show that, under very strong interference, decoding interference while treating the intended signal as noise, subtracting the result out, and then decoding the desired signal, a process known as "stripping", achieves the optimal DMT region. Our proofs are constructive in the sense that code design criteria for achieving DMT-optimality (in the cases where we can demonstrate it) are provided.

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

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

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 of the two user interference channel"
    - "the diversity multiplexing tradeoff for interference networks"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-4 (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 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-5 (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 of the two user interference channel"
    - "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-6 (induced by source paper "on the achievable diversity multiplexing tradeoff in interference channels"):
  with members:
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "the two user gaussian compound interference channel"
    - "diversity multiplexing tradeoff in selective fading multiple access mimo channels"
    - "gaussian interference channel capacity to within one bit"

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)