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 "energy efficient resource allocation for swipt in multiple access channels"):
  Abstract: In this paper, we study optimal resource allocation strategies for simultaneous information and power transfer (SWIPT) focusing on the system energy efficiency. We consider two-user multiple access channels in which energy harvesting (EH) and information decoding (ID) nodes are spatially separated. We formulate optimization problems that maximize system energy efficiency while taking harvested energy constraints into account. These are concave-linear fractional problems, and hence Karush-Kuhn-Tucker (KKT) conditions are necessary and sufficient to obtain globally optimal solution. Solving these optimization problems, we provide analytical expressions for optimal transmit power allocation among the source nodes, and identify the corresponding energy efficiency. We confirm the theoretical analysis via numerical results. Furthermore, we also characterize the effect of circuit power consumption on the system's efficiency as the harvested energy demand varies.

Includes members:
  Member "multi objective beamforming for energy efficient swipt systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint moo of transmit precoding and receiver design in a downlink time switching miso swipt system")
  Member "wireless information and power transfer energy efficiency optimization in ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the performance gain of noma over oma in uplink communication systems")

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)