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 "secure transmit antenna selection protocol for mimo noma networks over nakagami m channels"):
  Abstract: In this paper, we studied a multi-input multi-output (MIMO) non-orthogonal multiple access (NOMA) network consisting of one source and two legitimate users (LUs), so-called near and far users according to their distances to the source, and one passive eavesdropper, over Nakagami-\textit{m} fading channel. Specifically, we investigated the scenario that the signals of the far user might or might not be decoded successfully at the eavesdropper and the near user. Thus, we aimed at designing a transmit antenna selection (TAS) secure communication protocol for the network. Then, two TAS solutions, namely Solutions I and II, were proposed. Specifically, solutions I and II focus on maximizing the received signal power between the source and the near user, and between the source and the far user, respectively. Accordingly, the exact and asymptotic closed-form expressions of the secrecy outage probability for the LUs and the overall system were derived. Our analytical results corroborated by Monte Carlo simulation indicate that the secrecy performance could be significantly improved by properly selecting power allocation coefficients and increasing the number of antennas at the source and the LUs. Interestingly, solution II could provide a better overall secrecy performance over solution I.

Includes members:
  Member "secrecy outage analysis for downlink transmissions in the presence of randomly located eavesdroppers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive full duplex jamming receiver for secure d2d links in random networks")
  Member "nonorthogonal multiple access in large scale underlay cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")
  Member "on secrecy performance of antenna selection aided mimo systems against eavesdropping":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping")
  Member "secrecy sum rate maximization in non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "physical layer security for noma transmission in mmwave drone networks")
  Member "enhancing the physical layer security of non orthogonal multiple access in large scale networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "harvest then cooperate wireless powered cooperative communications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")
  Member "robust beamforming for security in mimo wiretap channels with imperfect csi":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "non orthogonal multiple access for 5g and beyond")

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)