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 "effects of relay selection strategies on the spectral efficiency of wireless systems with half and full duplex nodes"):
  Abstract: This work proposes an analytical framework to study how relay selection strategies perform in half- and full-duplex deployments by combining renewal theory and stochastic geometry. Specifically, we assume that the network nodes -- operating in either half- or full-duplex mode -- are scattered according to a two-dimensional homogeneous Poisson point process to compute the relay selection cost by using a semi-Markov process. Our results show: ($i$) fixed relay outperforms the reactive option in either cases, ($ii$) the performance of both reactive and fixed relay strategies depends on the self-interference attenuation in full-duplex scenarios, evincing when they outperform the half-duplex option, and ($iii$) the reactive relay selection suffers from selecting relays at hop basis, while the fixed relay selection benefits most from the full-duplex communication.

Includes members:
  Member "m2m massive access in lte rach performance evaluation in a smart city scenario":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a thorough study of lorawan performance under different parameter settings")
  Member "on the secrecy of interference limited networks under composite fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "throughput maximization in multi hop wireless networks under secrecy constraint")
  Member "contention based geographic forwarding strategies for wireless sensors networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite blocklength communications in smart grids for dynamic spectrum access and locally licensed scenarios")
  Member "in band full duplex wireless challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")
  Member "experiment driven characterization of full duplex wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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)