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 relaying in non orthogonal multiple access trusted and untrusted scenarios"):
  Abstract: A downlink single-input single-output non-orthogonal multiple access setting is considered, in which a base station (BS) is communicating with two legitimate users in two possible scenarios of unsecure environments: existence of an external eavesdropper and communicating through an  untrusted  relay. For the first scenario, a number of  trusted  cooperative half-duplex relays is employed to assist with the BS’s transmission and secure its signals from the external eavesdropper. Various relaying schemes are proposed and analyzed for that matter:  cooperative jamming ,  decode-and-forward , and  amplify-and-forward . For each scheme,  secure beamforming  signals are devised at the relays to maximize the achievable secrecy rate regions. For the second scenario, with the untrusted relay, achievable secrecy rate regions are derived for two different relaying schemes,  compress-and-forward  and  amplify-and-forward , under two different modes of operation. In the first mode, coined  passive user  mode, the users receive signals from both the BS and the untrusted relay and combine them to decode their messages. In the second mode, termed the  active user  mode, the users transmit a cooperative jamming signal  simultaneously  with the BS’s transmission to further confuse the relay. Focusing on half-duplex nodes, the users cannot receive the BS’s signal while jamming the relay, i.e., while being active, and rely only on the signals forwarded to them by the relay. It is shown that the best relaying scheme highly depends on the system parameters, in particular the distances between the nodes, and also on the part of the secrecy rate region at which the system is to operate.

Includes members:
  Member "secrecy sum rate maximization in non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "physical layer security for noma transmission in mmwave drone networks")
  Member "on the spectral efficiency and security enhancements of noma assisted multicast unicast streaming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficient hybrid precoding design for integrated multicast unicast millimeter wave communications with swipt")
  Member "enhancing the physical layer security of non orthogonal multiple access in large scale networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "cooperation with an untrusted relay a secrecy perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "design and performance analysis of secure multicasting cooperative protocol for wireless sensor network applications")
  Member "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping")

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)