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 "design and performance analysis of secure multicasting cooperative protocol for wireless sensor network applications"):
  Abstract: This paper proposes a new security cooperative protocol, for dual phase amplify-and-forward large wireless sensor networks. In such a network, a portion of the K relays can be potential eavesdroppers. The source agrees to share with the destination a given channel state information (CSI) of a source-trusted relay-destination link to encode the message. Then, in the first hop, the source will use this CSI to map the right message to a certain sector while transmitting fake messages to the other sectors using sectoral transmission thanks to analog beamforming. In the second hop, the relays retransmit their received signals to the destination, using the distributed beamforming technique. We derived the secrecy outage probability and demonstrated that the probability of receiving the right encoded information by an untrustworthy relay is inversely proportional to the number of sectors. We also showed that the aggressive behavior of the cooperating untrusted relays is not effective compared to the case where each untrusted relay is trying to intercept the transmitted message individually.

Includes members:
  Member "optimal power allocation by imperfect hardware analysis in untrusted relaying networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure transmission with covert requirement in untrusted relaying networks")
  Member "cooperation with an untrusted relay a secrecy perspective":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")

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)