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: "full duplex mimo ofdm communication with self energy recycling"
  Abstract: This paper focuses on energy recycling in full-duplex (FD) relaying multiple-input-multiple-output orthogonal frequency division multiplexing (OFDM) communication. The loop self-interference (SI) due to full-duplexing is seen as an opportunity for the energy-constrained relay node to replenish its energy requirement through wireless power transfer. In forwarding the source information to the destination, the FD relay can simultaneously harvest energy from the source wireless transmission and also through energy recycling from its own transmission. The objective is to maximize the overall spectral efficiency by designing the optimal power allocation over OFDM sub-carriers and transmit antennas. Due to a large number of sub-carriers, this design problem poses a large-scale nonconvex optimization problem involving a few thousand variables of power allocation, which is very computationally challenging. A new path-following algorithm is proposed, which converges to an optimal solution. This algorithm is very efficient since it is based on \textit{closed-form} calculations. Numerical results for a practical simulation setting show promising results by achieving high spectral efficiency.

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)