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: "energy harvesting communications using dual alternating batteries"
  Abstract: We consider an energy harvesting transmitter equipped with two batteries having finite storage capacities, communicating over an additive white Gaussian channel. The work is motivated by an observation that many practical batteries, when repeatedly charged after being partially discharged, suffer from degradation in the usable capacity. The capacity can be recovered by completely discharging the battery before charging it fully again. Hence, in this work, we impose the constraint that a battery must be charged (discharged) only after it is fully discharged (charged). Our goal is to maximize the longterm average throughput with non-causal and causal knowledge of the energy arrivals, which we assume to be Bernoulli. We propose two sub-optimal policies and obtain an upper bound on the performance gap (G) from the optimal long-term average throughput that is achieved with infinite capacity batteries. We find that G remains constant as the amount of energy harvested per arrival increases. Numerically, we also find that G decreases with the battery capacity faster than the inverse of the square root of the battery capacity for a specific energy arrival parameters.

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)