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 "destination aided wireless power transfer in energy limited cognitive relay systems"):
  Abstract: This paper considers an energy-limited cognitive relay network where a secondary transmitter (ST) assists to forward the traffic from a primary transmitter (PT) to a primary receiver (PR), in exchange for serving its own secondary receiver (SR) in the same frequency. The multiple-antenna ST is assumed to be energy-constrained and powered by both information flow from source (PT) and dedicated energy streams from destinations (PR and SR), which is called destination-aided wireless power transfer (DWPT) scheme. Then, the relay processing matrix, cognitive beamforming vector and power splitter are jointly de- signed to maximize the rate of secondary users under the energy causality constraint and the constraint that the demanded rate of primary users is satisfied. For the perfect channel information state (CSI) case, by adopting semi-definite relax (SDR) technique and Charnes-Cooper transformation, the global optimal solution is given. To reduce the complexity, matrix decomposition, zero forcing (ZF) scheme, and dual method are jointly employed to derive a suboptimal solution. For the imperfect CSI case, S- procedure is used to transform the worst-case robust problem into a tractable semi-definite program (SDP). Simulation results reveal that our proposed DWPT scheme is greatly preferred for both perfect and imperfect CSI cases when ST is close to PR/SR.

Includes members:
  Member "transceiver design to maximize the weighted sum secrecy rate in full duplex swipt systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fog assisted multi user swipt networks local computing or offloading")
  Member "joint wireless information and power transfer for an autonomous multiple antenna relay system":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wireless powered dual hop multi antenna relaying systems impact of csi and antenna correlation")
  Member "multi objective optimization for robust power efficient and secure full duplex wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "joint power splitting and secure beamforming design in the wireless powered untrusted relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on secure communication using rf energy harvesting two way untrusted relay")
  Member "joint beamforming optimization and power control for full duplex mimo two way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "full duplex transmission optimization for bi directional mimo links with qos guarantees")
  Member "information and energy cooperation in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy sustainable paradigms and methods for future mobile networks a survey")
  Member "secrecy wireless information and power transfer with miso beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "energy efficient resource allocation for secure noma enabled mobile edge computing networks")
  Member "throughput maximization in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")

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)