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: "on the optimality of the greedy policy for battery limited energy harvesting communications"
  Abstract: Consider a battery limited energy harvesting communication system with online power control. Assuming independent and identically distributed (i.i.d.) energy arrivals and the harvest-store-use architecture, it is shown that the greedy policy achieves the maximum throughput if and only if the battery capacity is below a certain positive threshold that admits a precise characterization. Simple lower and upper bounds on this threshold are established. The asymptotic relationship between the threshold and the mean of the energy arrival process is analyzed for several examples.

Connected through hyperedge HE-1 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications"):
  with members:
    - "the optimal power control policy for an energy harvesting system with look ahead bernoulli energy arrivals"
    - "energy harvesting wireless communications a review of recent advances"
    - "universally near optimal online power control for energy harvesting nodes"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "a learning theoretic approach to energy harvesting communication system optimization"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "optimal energy allocation for wireless communications with energy harvesting constraints"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"

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)