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: "online energy efficient packet scheduling for a common deadline with and without energy harvesting"
  Abstract: The problem of online packet scheduling to minimize the required conventional grid energy for transmitting a fixed number of packets given a common deadline is considered. The total number of packets arriving within the deadline is known, but the packet arrival times are unknown, and can be arbitrary. The proposed algorithm tries to finish the transmission of each packet assuming all future packets are going to arrive at equal time intervals within the left-over time. The proposed online algorithm is shown to have competitive ratio that is logarithmic in the number of packet arrivals. The hybrid energy paradigm is also considered, where in addition to grid energy, energy is also available via extraction from renewable sources. The objective here is to minimize the grid energy use. A suitably modified version of the previous algorithm is also shown to have competitive ratio that is logarithmic in the number of packet arrivals.

Connected through hyperedge HE-1 (induced by source paper "resource allocation in green dense cellular networks complexity and algorithms"):
  with members:
    - "large scale spectrum allocation for cellular networks via sparse optimization"
    - "optimal user scheduling in energy harvesting wireless networks"
    - "scalable spectrum allocation and user association in networks with many small cells"
    - "boost base station on off switching strategy for energy efficient massive mimo hetnets"
    - "online ski rental for on off scheduling of energy harvesting base stations"
    - "gate greening at the edges"
    - "energy efficient cell activation user association and spectrum allocation in heterogeneous networks"
    - "optimizing user association and spectrum allocation in hetnets a utility perspective"

Connected through hyperedge HE-2 (induced by source paper "online energy harvesting problem over an arbitrary directed acyclic graph network"):
  with members:
    - "optimal offline and competitive online strategies for transmitter receiver energy harvesting"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "multicommodity flows and cuts in polymatroidal networks"
    - "competitive ratio analysis of online algorithms to minimize data transmission time in energy harvesting communication system"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "optimal packet scheduling in an energy harvesting communication system"

Connected through hyperedge HE-3 (induced by source paper "power control for wireless vbr video streaming from optimization to reinforcement learning"):
  with members:
    - "power control and mode selection for vbr video streaming in d2d networks"
    - "quality driven resource allocation for full duplex delay constrained wireless video transmissions"
    - "universally near optimal online power control for energy harvesting nodes"
    - "energy efficient adaptive video transmission exploiting rate predictions in wireless networks"
    - "optimal packet scheduling in an energy harvesting communication system"

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)