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: "receiver antenna partitioning for simultaneous wireless information and power transfer"
  Abstract: Powering mobiles using microwave \emph{power transfer} (PT) avoids the inconvenience of battery recharging by cables and ensures uninterrupted mobile operation. The integration of PT and \emph{information transfer} (IT) allows wireless PT to be realized by building on the existing infrastructure for IT and also leads to compact mobile designs. As a result, \emph{simultaneous wireless information and power transfer} (SWIPT) has emerged to be an active research topic that is also the theme of this paper. In this paper, a practical SWIPT system is considered where two multi-antenna stations perform separate PT and IT to a multi-antenna mobile to accommodate their difference in ranges. The mobile dynamically assigns each antenna for either PT or IT. The antenna partitioning results in a tradeoff between the MIMO IT channel capacity and the PT efficiency. The optimal partitioning for maximizing the IT rate under a PT constraint is a NP-hard integer program, and the paper proposes solving it via efficient greedy algorithms with guaranteed performance. To this end, the antenna-partitioning problem is proved to be one that optimizes a sub-modular function over a matroid constraint. This structure allows the application of two well-known greedy algorithms that yield solutions no smaller than the optimal one scaled by factors $(1-1/e)$ and 1/2, respectively.

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)