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: "optimal packet scheduling in energy harvesting multiple access channels with common data"
  Abstract: Energy harvesting with the optimum power consumption and packet scheduling increase the lifetime and sustainability of the wireless sensor networks (WSNs) leading to green communications. Optimal packet scheduling solutions available for 2-user multiple-access channel (MAC) systems with energy harvesting transmitters do not consider the common data observed when collected sensor data is spatially or temporally correlated. Furthermore, the total received energy depends on the amount spent on the common data. In this paper, optimal packet scheduling for energy harvesting Gaussian MAC with common data is achieved by assuming the deterministic knowledge of the data and energy packets, i.e., offline solution, while also modelling the effect of the total received energy constraint. Optimum solution is achieved practically with a complex 3-level water filling algorithm. The algorithm is compared with the gradient descent search algorithm giving the global optimum solution. Furthermore, the capacity boundary region is numerically simulated by using water filling algorithm and the optimization results are compared for various points on the capacity boundary surface.

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)