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: "multiuser joint energy bandwidth allocation with energy harvesting part i optimum algorithm multiple point to point channels"
  Abstract: In this paper, we develop optimal energy-bandwidth allocation algorithms in fading channels for multiple energy harvesting transmitters, each may communicate with multiple receivers via orthogonal channels. We first assume that the side information of both the channel states and the energy harvesting states is known for $K$ time slots {\em a priori}, and the battery capacity and the maximum transmission power in each time slot are bounded. The objective is to maximize the weighted sum-rate of all transmitters over the $K$ time slots by assigning the transmission power and bandwidth for each transmitter in each slot. The problem is formulated as a convex optimization problem with ${\cal O}(MK)$ constraints, where $M$ is the number of the receivers, making it hard to solve with a generic convex solver. An iterative algorithm is proposed that alternatively solves two subproblems in each iteration. The convergence and the optimality of this algorithm are also shown. We then consider the special case that each transmitter only communicates with one receiver and the objective is to maximize the total throughput. We develop efficient algorithms for solving the two subproblems and the optimal energy-bandwidth allocation can be obtained with an overall complexity of ${\cal O}(MK^2)$. Moreover, a heuristic algorithm is also proposed for energy-bandwidth allocation based on causal information of channel and energy harvesting states.

Connected through hyperedge HE-1 (induced by source paper "grid energy consumption and qos tradeoff in hybrid energy supply wireless networks"):
  with members:
    - "transmit power minimization for wireless networks with energy harvesting relays"
    - "energy harvesting wireless communications a review of recent advances"
    - "comp meets smart grid a new communication and energy cooperation paradigm"
    - "energy harvesting small cell networks feasibility deployment and operation"
    - "a lyapunov optimization approach for green cellular networks with hybrid energy supplies"
    - "cost minimization for fading channels with energy harvesting and conventional energy"
    - "power allocation for conventional and buffer aided link adaptive relaying systems with energy harvesting nodes"
    - "base station sleeping and resource allocation in renewable energy powered cellular networks"

Connected through hyperedge HE-2 (induced by source paper "multiuser joint energy bandwidth allocation with energy harvesting part ii multiple broadcast channels proportional fairness"):
  with members:
    - "iterative dynamic water filling for fading multiple access channels with energy harvesting"
    - "broadcasting with an energy harvesting rechargeable transmitter"
    - "sum rate optimal power policies for energy harvesting transmitters in an interference channel"

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)