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: "energy efficiency optimization with simultaneous wireless information and power transfer in mimo broadcast channels"
  Abstract: Simultaneous wireless information and power transfer (SWIPT) is anticipated to have great applications in fifth-generation (5G) and beyond communication systems. In this paper, we address the energy efficiency (EE) optimization problem for SWIPT multiple-input multiple-output broadcast channel (MIMO-BC) with time-switching (TS) receiver design. Our aim is to maximize the EE of the system whilst satisfying certain constraints in terms of maximum transmit power and minimum harvested energy per user. The coupling of the optimization variables, namely, transmit covariance matrices and TS ratios, leads to a EE problem which is non-convex, and hence very difficult to solve directly. Hence, we transform the original maximization problem with multiple constraints into a min-max problem with a single constraint and multiple auxiliary variables. We propose a dual inner/outer layer resource allocation framework to tackle the problem. For the inner-layer, we invoke an extended SWIPT-based BC-multiple access channel (MAC) duality approach and provide two iterative resource allocation schemes under fixed auxiliary variables for solving the dual MAC problem. A sub-gradient searching scheme is then proposed for the outer-layer in order to obtain the optimal auxiliary variables. Numerical results confirm the effectiveness of the proposed algorithms and illustrate that significant performance gain in terms of EE can be achieved by adopting the proposed extended BC-MAC duality-based algorithm.

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)