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: "transmission game in mimo interference channels with radio frequency energy harvesting"
  Abstract: For multi-user transmissions over MIMO interference channels, each user designs the transmit covariance matrix to maximize its information rate. When passive radio-frequency (RF) energy harvesters are present in the network, the transmissions are constrained by both the transmit power limits and the energy harvesting requirements. A passive RF energy harvester collects the radiated energy from nearby wireless information transmitters instead of using a dedicated wireless power source. It needs multiple transmitters to concentrate their RF radiation on it because typical electric field strengths are weak. In this paper, strategic games are proposed for the multi-user transmissions. First, in a non-cooperative game, each transmitter has a best-response strategy for the transmit covariance matrix that follows a multi-level water-filling solution. A pure-strategy Nash equilibrium exists. Secondly, in a cooperative game, there is no need to estimate the proportion of the harvested energy from each transmitter. Rather, the transmitters bargain over the unit-reward of the energy contribution. An approximation of the information rate is used in constructing the individual utility such that the problem of network utility maximization can be decomposed and the bargaining process can be implemented distributively. The bargaining solution gives a point of rates that is superior to the Nash equilibria and close to the Pareto front. Simulation results verify the algorithms that provide good communication performance while satisfying the RF energy-harvesting requirements.

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)