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 "optimal relay selection for the parallel hybrid rf fso relay channel non buffer aided and buffer aided designs"):
  Abstract: Hybrid radio frequency (RF)/free space optical (FSO) systems are among the candidate enabling technologies for the next generation of wireless networks since they benefit from both the high data rates of the FSO subsystem and the high reliability of the RF subsystem. In this paper, we focus on the problem of throughput maximization in the parallel hybrid RF/FSO relay channel. In the parallel hybrid RF/FSO relay channel, a source node sends its data to a destination node with the help of multiple relay nodes. Thereby, for a given relay, the source-relay and the relay-destination FSO links are orthogonal with respect to each other due to the narrow beam employed for FSO transmission, whereas, due to the broadcast nature of the RF channel, half-duplex operation is required for the RF links if self-interference is to be avoided. Moreover, we consider the two cases where the relays are and are not equipped with buffers. For both cases, we derive the optimal relay selection policies for the RF and FSO links and the optimal time allocation policy for transmission and reception for the RF links. The proposed optimal protocols provide important insights for optimal system design. Since the optimal buffer-aided (BA) policy introduces an unbounded end-to-end delay, we also propose a suboptimal BA policy which ensures certain target average delays. Moreover, we present distributed implementations for both proposed optimal protocols. Simulation results demonstrate that a considerable gain can be achieved by the proposed adaptive protocols in comparison with benchmark schemes from the literature.

Includes members:
  Member "optical communication in space challenges and mitigation techniques":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "unmanned aerial vehicles uavs a survey on civil applications and key research challenges")
  Member "hybrid radio free space optical design for next generation backhaul systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "6g wireless communication systems applications requirements technologies challenges and research directions")
  Member "achievable rates for the fading half duplex single relay selection network using buffer aided relaying":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient resource allocation for relay assisted computation offloading in mobile edge computing")
  Member "achievable rate region of the bidirectional buffer aided relay channel with block fading":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "achievable rates for the fading half duplex single relay selection network using buffer aided relaying")
  Member "statistical delay tradeoffs in buffer aided two hop wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective capacity in wireless networks a comprehensive survey")
  Member "experiment driven characterization of full duplex wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simultaneous downlink data transmission and uplink channel estimation with reduced complexity full duplex mimo radios")
  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)