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 and degrees of freedom of cooperative wireless networks"
  Abstract: Wireless fading networks with multiple antennas are typically studied information-theoretically from two different perspectives - the outage characterization and the ergodic capacity characterization. A key parameter in the outage characterization of a network is the diversity, whereas a first-order indicator for the ergodic capacity is the degrees of freedom (DOF), which is the pre-log coefficient in the capacity expression. In this paper, we present max-flow min-cut type theorems for computing both the diversity and the degrees of freedom of arbitrary single-source single-sink multi-antenna networks. We also show that an amplify-and-forward protocol is sufficient to achieve this. The degrees of freedom characterization is obtained using a conversion to a deterministic wireless network for which the capacity was recently found. We show that the diversity result easily extends to multi-source multi-sink networks and evaluate the DOF for multi-casting in single-source multi-sink networks.

Connected through hyperedge HE-1 (induced by source paper "dmt of multi hop cooperative networks part i basic results"):
  with members:
    - "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design"
    - "to code or not to code in multi hop relay channels"
    - "dmt of multi hop cooperative networks part ii half duplex networks with full duplex performance"
    - "the case for structured random codes in network capacity theorems"
    - "approximate capacity of gaussian relay networks"
    - "a deterministic approach to wireless relay networks"
    - "interference alignment on the deterministic channel and application to fully connected awgn interference networks"
    - "approximately universal space time codes for the parallel multi block and cooperative dynamic decode and forward channels"

Connected through hyperedge HE-2 (induced by source paper "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design"):
  with members:
    - "a deterministic approach to wireless relay networks"
    - "diversity of mimo multihop relay channels"
    - "optimum diversity multiplexing tradeoff in the multiple relays network"
    - "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"

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)