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 "on the secrecy capacity of a full duplex wirelessly powered communication system"):
  Abstract: In this paper, we investigate the secrecy capacity of a point-to-point, full-duplex (FD) wirelesly powered communication system in the presence of a passive eavesdropper (EVE). The considered system is comprised of an energy transmitter (ET), an energy harvesting user (EHU), and a passive EVE. The ET transmits radio-frequency energy, which is used for powering the EHU as well as for generating interference at the EVE. The EHU uses the energy harvested from the ET to transmit confidential messages back to the ET. As a consequence of the FD mode of operation, both the EHU and the ET are subjected to self-interference, which has different effects at the two nodes. In particular, the self-interference impairs the decoding of the received message at the ET, whilst it serves as an additional energy source at the EHU. For this system model, we derive an upper and a lower bound on the secrecy capacity. For the lower bound, we propose a simple achievability scheme. Our numerical results show significant improvements in terms of achievable secrecy rate when the proposed communication scheme is employed against its half-duplex counterpart, even for practical self-interference values at the ET.

Includes members:
  Member "exploiting interference for secrecy wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secrecy throughput maximization for full duplex wireless powered iot networks under fairness constraints")
  Member "capacity of a full duplex wirelessly powered communication system with self interference and processing cost":
    also connected through other hyperedges:
      (none)
  Member "power allocation for secure swipt systems with wireless powered cooperative jamming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficiency of distributed antenna systems with wireless power transfer")
  Member "physical layer security in heterogeneous networks with jammer selection and full duplex users":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secrecy outage and diversity analysis of multiple cooperative source destination pairs")
  Member "mimo wiretap channel under receiver side power constraints with applications to wireless power transfer and cognitive radio":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal and low complexity dynamic spectrum access for rf powered ambient backscatter system with online reinforcement learning")
  Member "wireless powered communication networks an overview":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "accumulate and jam towards secure communication via a wireless powered full duplex jammer":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "artificial noise aided secrecy information and power transfer in ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "energy efficiency of distributed antenna systems with wireless power transfer")

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)