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 "enhancing phy security of cooperative cognitive radio multicast communications"):
  Abstract: In this paper, we propose a cooperative approach to improve the security of both primary and secondary systems in cognitive radio multicast communications. During their access to the frequency spectrum licensed to the primary users, the secondary unlicensed users assist the primary system in fortifying security by sending a jamming noise to the eavesdroppers, while simultaneously protect themselves from eavesdropping. The main objective of this work is to maximize the secrecy rate of the secondary system, while adhering to all individual primary users' secrecy rate constraints. In the case of active eavesdroppers and perfect channel state information (CSI) at the transceivers, the utility function of interest is nonconcave and the involved constraints are nonconvex, and thus, the optimal solutions are troublesome. To solve this problem, we propose an iterative algorithm to arrive at least to a local optimum of the original nonconvex problem. This algorithm is guaranteed to achieve a Karush-Kuhn-Tucker solution. Then, we extend the optimization approach to the case of passive eavesdroppers and imperfect CSI knowledge at the transceivers, where the constraints are transformed into a linear matrix inequality and convex constraints, in order to facilitate the optimal solution.

Includes members:
  Member "robust beamforming for secrecy rate in cooperative cognitive radio multicast communications":
    also connected through other hyperedges:
      (none)
  Member "robust beamforming for secure communication in systems with wireless information and power transfer":
    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 "secrecy wireless information and power transfer with miso beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficient resource allocation for secure noma enabled mobile edge computing networks")
  Member "improving physical layer secrecy using full duplex jamming receivers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "spatially selective artificial noise aided transmit optimization for miso multi eves secrecy rate maximization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure millimeter wave cloud radio access networks relying on microwave multicast fronthaul")
  Member "on the design of artificial noise aided secure multi antenna transmission in slow fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "capacity theorems for the cognitive radio channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi phase smart relaying and cooperative jamming in secure cognitive radio networks")
  Member "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")

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)