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: "impact of node speed on throughput of energy constrained mobile networks with wireless power transfer"
  Abstract: A wireless charging station (WCS) transfers energy wirelessly to mobile nodes within its charging region. This paper investigates the impact of node speed on the throughput of WCS overlaid mobile networks when packet transmissions are constrained by the energy status of each node. The energy provision for each node depends on its moving speed. A slow-moving node outside the charging region is unable to receive energy from WCSs for a long time, while one inside the charging region consistently recharges the battery. Reflecting on these phenomena, we design a two-dimensional Markov chain, where the states respectively represent the remaining energy and the distance to the nearest WCS. Solving this enables the following theoretic insights. Firstly, the throughput is a non-decreasing function of node speed. With faster node speed, the throughput converges to that of the independent and identically distributed (i.i.d.) mobility model where nodes can move anywhere without being restricted by their previous positions. Secondly, if the battery capacity of each node is infinite, the throughput is equivalent to that of the i.i.d. mobility model regardless of node speed. Finally, the throughput scaling is calculated as Theta(min(1, m/n)c^{\min(1,m/n))), where n and m represent the number of nodes and WCSs, 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)