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: "competitive ratio analysis of online algorithms to minimize data transmission time in energy harvesting communication system"
  Abstract: We consider the optimal online packet scheduling problem in a single-user energy harvesting wireless communication system, where energy is harvested from natural renewable sources, making future energy arrivals instants and amounts random in nature. The most general case of arbitrary energy arrivals is considered where neither the future energy arrival instants or amount, nor their distribution is known. The problem considered is to adaptively change the transmission rate according to the causal energy arrival information, such that the time by which all packets are delivered is minimized. We assume that all bits have arrived and are ready at the source before the transmission begins. For a minimization problem, the utility of an online algorithm is tested by finding its competitive ratio or competitiveness that is defined to be the maximum of the ratio of the gain of the online algorithm with the optimal offline algorithm over all input sequences. We derive a lower and upper bound on the competitive ratio of any online algorithm to minimize the total transmission time in an energy harvesting system. The upper bound is obtained using a `lazy' transmission policy that chooses its transmission power to minimize the transmission time assuming that no further energy arrivals are going to occur in future. The lazy transmission policy is shown to be strictly two-competitive. We also derive an adversarial lower bound that shows that competitive ratio of any online algorithm is at least 1.325.

Connected through hyperedge HE-1 (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"
    - "online energy efficient packet scheduling for a common deadline with and without energy harvesting"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "multicommodity flows and cuts in polymatroidal networks"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "optimal packet scheduling in an energy harvesting communication system"

Connected through hyperedge HE-2 (induced by source paper "on optimal online algorithms for energy harvesting systems with continuous energy and data arrivals"):
  with members:
    - "optimal transmission policies for multi hop energy harvesting systems"
    - "optimum transmission policies for battery limited energy harvesting nodes"
    - "optimal packet scheduling in an energy harvesting communication system"

Connected through hyperedge HE-3 (induced by source paper "optimal offline and competitive online strategies for transmitter receiver energy harvesting"):
  with members:
    - "finite horizon optimal transmission policies for energy harvesting sensors"
    - "long term throughput and approximate capacity of transmitter receiver energy harvesting channel with fading"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "optimal offline broadcast scheduling with an energy harvesting transmitter"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "optimum transmission policies for battery limited energy harvesting nodes"
    - "optimal packet scheduling in an energy harvesting communication system"
    - "optimal energy management policies for energy harvesting sensor nodes"

Connected through hyperedge HE-4 (induced by source paper "online energy efficient packet scheduling for a common deadline with and without energy harvesting"):
  with members:
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "optimal power allocation for energy harvesting and power grid coexisting wireless communication systems"
    - "delay aware bs discontinuous transmission control and user scheduling for energy harvesting downlink coordinated mimo systems"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "optimal packet scheduling on an energy harvesting broadcast link"
    - "energy optimal transmission scheduling in wireless sensor networks"
    - "optimal packet scheduling in an energy harvesting communication system"
    - "asymptotically optimal policies for hard deadline scheduling over fading channels"

Connected through hyperedge HE-5 (induced by source paper "energy harvesting wireless communications a review of recent advances"):
  with members:
    - "renewable powered cellular networks energy field modeling and network coverage"
    - "dynamic compression transmission for energy harvesting multihop networks with correlated sources"
    - "constrained codes for joint energy and information transfer"
    - "energy harvesting broadband communication systems with processing energy cost"
    - "spatial throughput of mobile ad hoc networks powered by energy harvesting"
    - "energy cooperation in energy harvesting communications"
    - "interactive joint transfer of energy and information"
    - "opportunistic wireless energy harvesting in cognitive radio networks"

Connected through hyperedge HE-6 (induced by source paper "energy harvesting systems with continuous energy and data arrivals the optimal offline and a heuristic online algorithms"):
  with members:
    - "optimal offline and competitive online strategies for transmitter receiver energy harvesting"
    - "power allocation for energy harvesting transmitter with causal information"
    - "optimal power and rate allocation in the degraded gaussian relay channel with energy harvesting nodes"
    - "energy cooperation in energy harvesting communications"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "optimal scheduling and power allocation for two hop energy harvesting communication systems"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "optimal transmission policies for energy harvesting two hop networks"

Connected through hyperedge HE-7 (induced by source paper "event trigger based robust optimal control for energy harvesting transmitter"):
  with members:
    - "closed form delay optimal power control for energy harvesting wireless system with finite energy storage"
    - "a learning theoretic approach to energy harvesting communication system optimization"
    - "on the delay throughput tradeoff in distributed wireless networks"
    - "energy efficient relaying over multiple slots with causal csi"
    - "broadcasting with an energy harvesting rechargeable transmitter"
    - "sum rate optimal power policies for energy harvesting transmitters in an interference channel"
    - "optimal energy allocation for wireless communications with energy harvesting constraints"
    - "a general framework for the optimization of energy harvesting communication systems with battery imperfections"

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)