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 "capacity of a full duplex wirelessly powered communication system with self interference and processing cost"):
  Abstract: In this paper, we investigate the capacity of a point-to-point, full-duplex (FD), wirelessly powered communication system impaired by self-interference. This system is comprised of an energy transmitter (ET) and an energy harvesting user (EHU), both operating in a FD mode. The ET transmits energy towards the EHU. The EHU harvests this energy and uses it to transmit information back to the ET. As a result of the FD mode, both nodes are affected by self-interference. The self-interference has a different effect at the two nodes: it impairs the decoding of the received signal at the ET, however, it provides an additional source of energy for the EHU. This paper derives the capacity of this communication system assuming a processing cost at the EHU and additive white Gaussian noise channel with block fading. Thereby, we show that the capacity achieving scheme is relatively simple and therefore applicable to devices with limited resources. Moreover, our numerical results show significant improvements in terms of data rate when the capacity achieving strategy is employed compared to half-duplex transmission. Moreover, we show the positive and negative effects of the self-interference at the EHU and the ET, respectively. Furthermore, we show the crippling effect of the processing cost and demonstrate that failing to take it into consideration gives a false impression in terms of achievable rate.

Includes members:
  Member "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "capacity region of gaussian multiple access channels with energy harvesting and energy cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fog assisted multi user swipt networks local computing or offloading")
  Member "capacity analysis of discrete energy harvesting channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non asymptotic achievable rates for gaussian energy harvesting channels best effort and save and transmit")
  Member "capacity of the energy harvesting gaussian mac":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online power control for block i i d energy harvesting channels")
  Member "capacity of the two hop relay channel with wireless energy transfer from relay to source and energy transmission cost":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "charge then forward wireless powered communication for multiuser relay networks")
  Member "weighted sum transmit power minimization for full duplex system with swipt and self energy recycling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "transmit precoding and receive power splitting for harvested power maximization in mimo swipt systems")
  Member "capacity of the energy harvesting channel with a finite battery":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "non asymptotic achievable rates for gaussian energy harvesting channels best effort and save and transmit")
  Member "energy recycling full duplex radios for next generation networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "massive wireless energy transfer enabling sustainable iot towards 6g era")

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)