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 "multiplexing gain of amplify forward relaying in wireless multi antenna relay networks"):
  Abstract: This paper studies the general multi-antenna multiple-relay network. Every two nodes of the network are either connected together through a Rayleigh fading channel or disconnected. We study the ergodic capacity of the network in the high SNR regime. We prove that the traditional amplify-forward relaying achieves the maximum multiplexing gain of the network. Furthermore, we show that the maximum multiplexing gain of the network is equal to the minimum vertex cut-set of the underlying graph of the network, which can be computed in polynomial time in terms of the number of network nodes. Finally, the argument is extended to the multicast and multi-access scenarios.

Includes members:
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multilevel coding over two hop single user networks")
  Member "dmt of multi hop cooperative networks part i basic results":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity of the half duplex diamond channel")
  Member "on the diversity multiplexing tradeoff in multiple relay network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the capacity of the half duplex diamond channel")
  Member "approximate capacity of gaussian relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multihop backhaul compression for the uplink of cloud radio access networks")
  Member "asymptotic analysis of amplify and forward relaying in a parallel mimo relay network":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a scalable architecture for distributed receive beamforming analysis and experimental demonstration")
  Member "wireless network information flow":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "relay pair selection in buffer aided successive opportunistic relaying using a multi antenna source")

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)