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: "mimo with energy recycling"
  Abstract: Multiple input single output (MISO) point-to-point communication system is considered where the transmitter is designed such that, each antenna can transmit information or harvest energy at any given point in time. We evaluate the achievable rate by this system, subject to an average power constraint and show that, by careful switching of antennas between transmission and harvesting modes, it is possible to exceed the capacity of the non-harvesting counterpart. We find that, the optimal harvesting antenna scheduling algorithm has complexity that grows exponentially with the number, $M$, of antennas. Therefore, we provide a scheduling algorithm whose complexity $O(M \log M)$ with a minimal loss in the achievable rate. Moreover, we provide a hardware setup and experimental results for a 4-antenna transmitter with uniform linear array (ULA). We provide hardware measurements for the power recycled from the transmitting antennas and the power received at the target receiver for different array spacing and different selection of the active antennas subset. We measure the impact of antenna coupling due to recycling on the amount of received power and feed these findings to obtain a well-educated performance evaluation of the system.

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)