human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multiplexing gain of amplify forward relaying in wireless multi antenna relay networks")
  Member "dmt of multi hop cooperative networks part i basic results":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity of the half duplex diamond channel")
  Member "approximately universal space time codes for the parallel multi block and cooperative dynamic decode and forward channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "almost universal codes achieving ergodic mimo capacity within a constant gap")
  Member "wireless network information flow":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "perfect output feedback in the two user decentralized interference channel")
  Member "towards the optimal amplify and forward cooperative diversity scheme":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "relay pair selection in buffer aided successive opportunistic relaying using a multi antenna source")
  Member "optimal space time codes for the mimo amplify and forward cooperative channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "unmanned aerial vehicle assisted cellular communication")

Question: Please tell me which class the source paper 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)