human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "on the secrecy capacity of a full duplex wirelessly powered communication system"):
  with members:
    - "exploiting interference for secrecy wireless information and power transfer"
    - "power allocation for secure swipt systems with wireless powered cooperative jamming"
    - "physical layer security in heterogeneous networks with jammer selection and full duplex users"
    - "mimo wiretap channel under receiver side power constraints with applications to wireless power transfer and cognitive radio"
    - "wireless powered communication networks an overview"
    - "accumulate and jam towards secure communication via a wireless powered full duplex jammer"
    - "artificial noise aided secrecy information and power transfer in ofdma systems"
    - "capacity of the gaussian two hop full duplex relay channel with residual self interference"

Question: Please tell me which class the center node 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)