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: "optimum diversity multiplexing tradeoff in the multiple relays network"
  Abstract: In this paper, a multiple-relay network in considered, in which $K$ single-antenna relays assist a single-antenna transmitter to communicate with a single-antenna receiver in a half-duplex mode. A new Amplify and Forward (AF) scheme is proposed for this network and is shown to achieve the optimum diversity-multiplexing trade-off curve.

Connected through hyperedge HE-1 (induced by source paper "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design"):
  with members:
    - "diversity and degrees of freedom of cooperative wireless networks"
    - "a deterministic approach to wireless relay networks"
    - "diversity of mimo multihop relay channels"
    - "diversity multiplexing tradeoff of asynchronous cooperative diversity in wireless networks"
    - "towards the optimal amplify and forward cooperative diversity scheme"
    - "d mg tradeoff and optimal codes for a class of af and df cooperative communication protocols"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-2 (induced by source paper "on the diversity multiplexing tradeoff in multiple relay network"):
  with members:
    - "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design"
    - "a deterministic approach to wireless relay networks"
    - "asymptotic analysis of amplify and forward relaying in a parallel mimo relay network"
    - "crystallization in large wireless networks"
    - "a simple cooperative diversity method based on network path selection"
    - "towards the optimal amplify and forward cooperative diversity scheme"

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)