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 "wireless information and power transfer in full duplex communication systems"):
  Abstract: This paper considers the problem of maximizing the sum-rate for simultaneous wireless information and power transfer (SWIPT) in a full-duplex bi-directional communication system subject to energy harvesting and transmit power constraints at both nodes. We investigate the optimum design of the receive power splitters and transmit powers for SWIPT in full-duplex mode. Exploiting rate-split method, an iterative algorithm is derived to solve the non-convex problem. The effectiveness of the proposed algorithm is justified through numerical simulations.

Includes members:
  Member "all digital self interference cancellation technique for full duplex systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "optimal resource allocation in full duplex wireless powered communication network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "full duplex wireless powered relay with self energy recycling":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "charge then forward wireless powered communication for multiuser relay networks")
  Member "wireless information transfer with opportunistic energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "design of an miso swipt aided code index modulated multi carrier m dcsk system for e health iot")
  Member "wireless information and power transfer architecture design and rate energy tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")
  Member "experiment driven characterization of full duplex wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simultaneous downlink data transmission and uplink channel estimation with reduced complexity full duplex mimo radios")
  Member "on the transfer of information and energy in multi user systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "energy sustainable paradigms and methods for future mobile networks a survey")

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)