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 "sum secrecy rate maximization for full duplex two way relay networks using alamouti based rank two beamforming"):
  Abstract: Consider a two-way communication scenario where two single-antenna nodes, operating under full-duplex mode, exchange information to one another through the aid of a (full-duplex) multiantenna relay, and there is another single-antenna node who intends to eavesdrop. The relay employs artificial noise (AN) to interfere the eavesdropper's channel, and amplify-forward Alamouti-based rank-two beamforming to establish the two-way communication links of the legitimate nodes. Our problem is to optimize the rank-two beamformer and AN covariance for sum secrecy rate maximization (SSRM). This SSRM problem is nonconvex, and we develop an efficient solution approach using semidefinite relaxation (SDR) and minorization-maximization (MM). We prove that SDR is tight for the SSRM problem and, thus, introduces no loss. Also, we consider an inexact MM method where an approximate but computationally cheap MM solution update is used in place of the exact update in conventional MM. We show that this inexact MM method guarantees convergence to a stationary solution to the SSRM problem. The effectiveness of our proposed approach is further demonstrated by an energy-harvesting scenario extension, and by extensive simulation results.

Includes members:
  Member "multi objective optimization for robust power efficient and secure full duplex wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "joint beamforming optimization and power control for full duplex mimo two way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "full duplex transmission optimization for bi directional mimo links with qos guarantees")
  Member "optimal resource allocation in full duplex wireless powered communication network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "simultaneous wireless information and power transfer in modern communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "full duplex wireless powered relay with self energy recycling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "charge then forward wireless powered communication for multiuser relay networks")
  Member "full duplex wireless powered communication network with energy causality":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "wireless information and power transfer with full duplex relaying":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "physical layer multicasting by stochastic transmit beamforming and alamouti space time coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robust transmissions in wireless powered multi relay networks with chance interference constraints")

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)