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 "a buffer aided successive opportunistic relay selection scheme with power adaptation and inter relay interference cancellation for cooperative diversity systems"):
  Abstract: In this paper, we present a relay selection scheme which combines the spectral efficiency of successive opportunistic relaying with the robustness of single-link relay selection. More specifically, we propose a scheme that minimizes the total energy expenditure per time slot under an inter-relay interference cancellation scheme. The new relay selection policy is analyzed in terms of outage probability and diversity by modeling the evolution of relay buffers as a Markov Chain. We construct the state transition matrix of the Markov Chain and obtain its stationary distribution, which in turn, yields the outage probability. The proposed scheme outperforms relevant state-of-the-art relay selection schemes in terms of throughput, diversity, energy efficiency and average delay, as demonstrated via representative numerical examples.

Includes members:
  Member "buffer aided relaying with adaptive link selection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "throughput maximization of mixed fso rf uav aided mobile relaying with a buffer")
  Member "opportunistic buffered decode wait and forward obdwf protocol for mobile wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "throughput maximization of mixed fso rf uav aided mobile relaying with a buffer")
  Member "relay selection for two way relaying with amplify and forward protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hybrid beamforming for reconfigurable intelligent surface based multi user communications achievable rates with limited discrete phase shifts")
  Member "splitting algorithms for fast relay selection generalizations analysis and a unified view":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal timer based selection schemes")
  Member "superposition coded concurrent decode and forward relaying":
    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 "recovering multiplexing loss through successive relaying using repetition coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "alternate distributed beamforming for decode and forward multi relay systems using buffers")
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)