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 "secrecy capacity of two hop relay assisted wiretap channels"):
  Abstract: Incorporating the physical layer characteristics to secure communications has received considerable attention in recent years. Moreover, cooperation with some nodes of network can give benefits of multiple-antenna systems, increasing the secrecy capacity of such channels. In this paper, we consider cooperative wiretap channel with the help of an Amplify and Forward (AF) relay to transmit confidential messages from source to legitimate receiver in the presence of an eavesdropper. In this regard, the secrecy capacity of AF relying is derived, assuming the relay is subject to a peak power constraint. To this end, an achievable secrecy rate for Gaussian input is evaluated through solving a non-convex optimization problem. Then, it is proved that any rates greater than this secrecy rate is not achievable. To do this, the capacity of a genie-aided channel as an upper bound for the secrecy capacity of the underlying channel is derived, showing this upper bound is equal to the computed achievable secrecy rate with Gaussian input. Accordingly, the corresponding secrecy capacity is compared to the Decode and Forward (DF) strategy which is served as the benchmark in the current work.

Includes members:
  Member "principles of physical layer security in multiuser wireless networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "on cooperative relaying schemes for wireless physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "joint relay and jammer selection for secure two way relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure transmission and self energy recycling with partial eavesdropper csi")
  Member "optimal and robust transmit designs for miso channel secrecy by semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "noma an information theoretic perspective")
  Member "relay beamforming strategies for physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint relay and jammer selection improves the physical layer security in the face of csi feedback delays")
  Member "cooperation with an untrusted relay a secrecy perspective":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "secure transmission with multiple antennas ii the mimome wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi antenna jamming in covert communication")
  Member "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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.IT(Information Theory)