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: "performance limits of solutions to network utility maximization problems"
  Abstract: We study performance limits of solutions to utility maximization problems (e.g., max-min problems) in wireless networks as a function of the power budget $\bar{p}$ available to transmitters. Special focus is devoted to the utility and the transmit energy efficiency (i.e., utility over transmit power) of the solution. Briefly, we show tight bounds for the general class of network utility optimization problems that can be solved by computing conditional eigenvalues of standard interference mappings. The proposed bounds, which are based on the concept of asymptotic functions, are simple to compute, provide us with good estimates of the performance of networks for any value of $\bar{p}$ in many real-world applications, and enable us to determine points in which networks move from a noise limited regime to an interference limited regime. Furthermore, they also show that the utility and the transmit energy efficiency scales as $\Theta(1)$ and $\Theta(1/\bar{p})$, respectively, as $\bar{p}\to\infty$.

Connected through hyperedge HE-1 (induced by source paper "the role of asymptotic functions in network optimization and feasibility studies"):
  with members:
    - "elementary properties of positive concave mappings with applications to network planning and optimization"
    - "power and load coupling in cellular networks for energy optimization"
    - "joint downlink base station association and power control for max min fairness computation and complexity"
    - "data offloading in load coupled networks a utility maximization framework"
    - "toward energy efficient 5g wireless communications technologies"
    - "analysis of cell load coupling for lte network planning and optimization"
    - "base station selection for energy efficient network operation with the majorization minimization algorithm"

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)