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: "on the achievable diversity multiplexing tradeoff in interference channels"
  Abstract: We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. For the case of very strong interference, we prove that 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 diversity-multiplexing tradeoff (DMT) outer bound derived in Akuiyibo and Leveque, Int. Zurich Seminar on Commun., 2008. The proof is constructive in the sense that it provides corresponding code design criteria for DMT optimality. For general interference levels, we compute the DMT of a fixed-power-split Han and Kobayashi type superposition coding scheme, provide design criteria for the corresponding superposition codes, and find that this scheme is DMT-optimal for certain multiplexing rates.

Connected through hyperedge HE-1 (induced by source paper "outage analysis of block fading gaussian interference channels"):
  with members:
    - "diversity multiplexing tradeoff of the two user interference channel"
    - "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-2 (induced by source paper "diversity multiplexing tradeoff of the two user interference channel"):
  with members:
    - "outage analysis of block fading gaussian 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)