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 transmission with covert requirement in untrusted relaying networks"):
  Abstract: In this paper, we study the problem of secure transmission with covert requirement in untrusted relaying networks. Our considered system model consists of one source, one destination, one untrusted relay, and one Willie. The untrusted relay tries to extract the information signal, while the goal of Willie is to detect the presence of the information signal transmitted by the source, in the current time slot. To overcome these two attacks, we illustrate that the destination and the source should inject jamming signal to the network in phase I and phase II, respectively. Accordingly, the communication in our proposed system model is accomplished in two phases. In the first phase, when the source transmits its data to the untrusted relay the destination broadcasts its jamming signal. In the second phase, when the relay retransmits the received signal, the source transmits a jamming signal with one of its antennas. For this system model, we propose a power allocation strategy to maximize the instantaneous secrecy rate subject to satisfying the covert requirements in both of the phases. Since the proposed optimization problem is non-convex, we adopt the Successive Convex Approximation (SCA) approach to convert it to a convex optimization problem. Next, we extend our system model to a practical system model where there are multiple untrusted relays and multiple Willies under two scenarios of noncolluding Willies and colluding Willies. Our findings highlight that unlike the direct transmission scheme, the achievable secrecy rate of the proposed secure transmission scheme improve as the number of untrusted relays increases.

Includes members:
  Member "covert communications versus physical layer security":
    also connected through other hyperedges:
      (none)
  Member "joint relay selection and power allocation in large scale mimo systems with untrusted relays and passive eavesdroppers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "covert communication achieved by a greedy relay in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "covert transmission with a self sustained relay")
  Member "optimal power allocation by imperfect hardware analysis in untrusted relaying networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "design and performance analysis of secure multicasting cooperative protocol for wireless sensor network applications")
  Member "on covert communication with noise uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance")
  Member "covert communication in the presence of an uninformed jammer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi antenna jamming in covert communication")
  Member "joint relay and jammer selection improves the physical layer security in the face of csi feedback delays":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal power allocation by imperfect hardware analysis in untrusted relaying networks")
  Member "secrecy transmit beamforming for heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secrecy outage and diversity analysis of multiple cooperative source destination pairs")

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.CR(Cryptography and Security)