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 "an efficient adaptive distributed space time coding scheme for cooperative relaying"):
  Abstract: A non-regenerative dual-hop wireless system based on distributed Alamouti space-time coding is considered. It is assumed that each relay retransmits an appropriately scaled space-time coded version of its received signal. The main goal of this paper is to find a scaling function for each relay to minimize the outage probability. In the high signal-to-noise ratio (SNR) regime for the relay-destination link, it is shown that a threshold-based scaling function (i.e., the relay remains silent if its channel gain with the source is less than its predetermined threshold) is optimum from the outage probability point of view. Numerical results demonstrate a dramatic performance improvement as compared to the case that the relay stations forward their received signals with full power even for finite SNR scenarios.

Includes members:
  Member "opportunistic relay selection with limited feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the impact of channel feedback on opportunistic relay selection for hybrid arq in wireless networks")
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynwalks global topology and recent changes awareness dynamic network embedding")

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)