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: "cooperative multiplexing in the multiple antenna half duplex relay channel"
  Abstract: Cooperation between terminals has been proposed to improve the reliability and throughput of wireless communication. While recent work has shown that relay cooperation provides increased diversity, increased multiplexing gain over that offered by direct link has largely been unexplored. In this work we show that cooperative multiplexing gain can be achieved by using a half duplex relay. We capture relative distances between terminals in the high SNR diversity multiplexing tradeoff (DMT) framework. The DMT performance is then characterized for a network having a single antenna half-duplex relay between a single-antenna source and two-antenna destination. Our results show that the achievable multiplexing gain using cooperation can be greater than that of the direct link and is a function of the relative distance between source and relay compared to the destination. Moreover, for multiplexing gains less than 1, a simple scheme of the relay listening 1/3 of the time and transmitting 2/3 of the time can achieve the 2 by 2 MIMO DMT.

Connected through hyperedge HE-1 (induced by source paper "when are dynamic relaying strategies necessary in half duplex wireless networks"):
  with members:
    - "the approximate optimality of simple schedules for half duplex multi relay networks"
    - "generalized diversity multiplexing tradeoff of half duplex relay networks"
    - "wireless network information flow a deterministic approach"
    - "the diversity multiplexing tradeoff of the mimo half duplex relay channel"
    - "diversity multiplexing tradeoff of the half duplex relay channel"

Connected through hyperedge HE-2 (induced by source paper "coding and system design for quantize map and forward relaying"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "bilayer protograph codes for half duplex relay channels"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "parallel bit interleaved coded modulation"
    - "interference mitigation through limited receiver cooperation"
    - "diversity multiplexing tradeoff of the half duplex relay channel"
    - "bilayer low density parity check codes for decode and forward in relay channels"
    - "coding for the non orthogonal amplify and forward cooperative channel"

Connected through hyperedge HE-3 (induced by source paper "generalized diversity multiplexing tradeoff of half duplex relay networks"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the diversity multiplexing tradeoff of the mimo half duplex relay channel"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "information theoretic operating regimes of large wireless networks"
    - "diversity multiplexing tradeoff of the half duplex relay channel"
    - "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)