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: "dmt of multi hop cooperative networks part ii half duplex networks with full duplex performance"
  Abstract: We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. In a companion paper, we established some basic results which laid the foundation for the results presented here. In the present paper, we consider two families of networks of half-duplex networks. KPP networks may be viewed as the union of K node-disjoint parallel relaying paths. Generalizations of these networks include KPP(I) networks, which permit interference between paths and KPP(D) networks, which possess a direct link between source and sink. We characterize the DMT of these families of networks completely and show that they can achieve the cut-set bound, thus proving that full-duplex performance can be obtained even in the presence of the half-duplex constraint. We then consider layered networks, and prove that a linear DMT between maximum diversity and maximum multiplexing gain is achievable. All protocols in this paper are explicit and use only amplify-and-forward relaying. We also construct codes that achieve the optimal DMT for all the proposed schemes. Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that AF protocols are often optimal.

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"
    - "on the diversity multiplexing tradeoff in multiple relay network"
    - "a deterministic approach to wireless relay networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (induced by source paper "multistage relaying using interference networks"):
  with members:
    - "on the capacity of the half duplex diamond channel"
    - "protocols and performance limits for half duplex relay networks"
    - "cooperative transmission in a wireless relay network based on flow management"
    - "dmt of multi hop cooperative networks part i basic results"
    - "approximate capacity of gaussian relay networks"

Connected through hyperedge HE-3 (induced by source paper "end to end joint antenna selection strategy and distributed compress and forward strategy for relay channels"):
  with members:
    - "to code or not to code in multi hop relay channels"
    - "nonregenerative mimo relaying with optimal transmit antenna selection"
    - "relay subset selection in wireless networks using partial decode and forward transmission"
    - "diversity of mimo multihop relay channels"
    - "a simple cooperative diversity method based on network path selection"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-4 (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"
    - "diversity and degrees of freedom of cooperative wireless networks"
    - "to code or not to code in multi hop relay channels"
    - "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-5 (induced by source paper "cascaded orthogonal space time block codes for wireless multi hop relay networks"):
  with members:
    - "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design"
    - "algebraic distributed space time codes with low ml decoding complexity"
    - "diversity of mimo multihop relay channels"
    - "a non orthogonal distributed space time coded protocol part i signal model and design criteria"
    - "a non orthogonal distributed space time coded protocol part ii code construction and dm g tradeoff"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"
    - "approximately universal optimality over several dynamic and non dynamic cooperative diversity schemes for wireless networks"

Connected through hyperedge HE-6 (induced by source paper "diversity multiplexing tradeoff of the half duplex relay channel"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "approximate capacity of gaussian relay networks"
    - "a deterministic approach to wireless relay networks"
    - "wireless network information flow"
    - "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)