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 diversity multiplexing tradeoff in multiple relay network"
  Abstract: This paper studies the setup of a multiple-relay network in which $K$ half-duplex multiple-antenna relays assist in the transmission between a/several multiple-antenna transmitter(s) and a multiple-antenna receiver. Each two nodes are assumed to be either connected through a quasi-static Rayleigh fading channel, or disconnected. We propose a new scheme, which we call \textit{random sequential} (RS), based on the amplify-and-forward relaying. We prove that for general multiple-antenna multiple-relay networks, the proposed scheme achieves the maximum diversity gain. Furthermore, we derive diversity-multiplexing tradeoff (DMT) of the proposed RS scheme for general single-antenna multiple-relay networks. It is shown that for single-antenna two-hop multiple-access multiple-relay ($K>1$) networks (without direct link between the transmitter(s) and the receiver), the proposed RS scheme achieves the optimum DMT. However, for the case of multiple access single relay setup, we show that the RS scheme reduces to the naive amplify-and-forward relaying and is not optimum in terms of DMT, while the dynamic decode-and-forward scheme is shown to be optimum for this scenario.

Connected through hyperedge HE-1 (induced by source paper "on the capacity of the half duplex diamond channel"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "a new achievable rate for the gaussian parallel relay channel"
    - "capacity of a class of diamond channels"
    - "cooperative strategies for the half duplex gaussian parallel relay channel simultaneous relaying versus successive relaying"
    - "dmt of multi hop cooperative networks part i basic results"
    - "dmt of multi hop cooperative networks part ii half duplex networks with full duplex performance"
    - "a deterministic approach to wireless relay networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (induced by source paper "multiplexing gain of amplify forward relaying in wireless multi antenna relay networks"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design"
    - "dmt of multi hop cooperative networks part i basic results"
    - "approximate capacity of gaussian relay networks"
    - "asymptotic analysis of amplify and forward relaying in a parallel mimo relay network"
    - "wireless network information flow"
    - "towards the optimal amplify and forward cooperative diversity scheme"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-3 (induced by source paper "diversity multiplexing tradeoffs in mimo relay channels"):
  with members:
    - "diversity of mimo multihop relay channels"
    - "d mg tradeoff and optimal codes for a class of af and df cooperative communication protocols"
    - "on the achievable diversity multiplexing tradeoffs in half duplex cooperative 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)