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: "utility maximization for delay constrained qos in wireless"
  Abstract: This paper studies the problem of utility maximization for clients with delay based QoS requirements in wireless networks. We adopt a model used in a previous work that characterizes the QoS requirements of clients by their delay constraints, channel reliabilities, and delivery ratio requirements. In this work, we assume that the utility of a client is a function of the delivery ratio it obtains. We treat the delivery ratio for a client as a tunable parameter by the access point (AP), instead of a given value as in the previous work. We then study how the AP should assign delivery ratios to clients so that the total utility of all clients is maximized. #R##N#We apply the techniques introduced in two previous papers to decompose the utility maximization problem into two simpler problems, a CLIENT problem and an ACCESS-POINT problem. We show that this decomposition actually describes a bidding game, where clients bid for the service time from the AP. We prove that although all clients behave selfishly in this game, the resulting equilibrium point of the game maximizes the total utility. In addition, we also establish an efficient scheduling policy for the AP to reach the optimal point of the ACCESS-POINT problem. We prove that the policy not only approaches the optimal point but also achieves some forms of fairness among clients. Finally, simulation results show that our proposed policy does achieve higher utility than all other compared policies.

Connected through hyperedge HE-1 (induced by source paper "throughput optimal decentralized scheduling of multi hop networks with end to end deadline constraints unreliable links"):
  with members:
    - "optimizing quality of experience of dynamic video streaming over fading wireless networks"
    - "pathwise performance of debt based policies for wireless networks with hard delay constraints"
    - "scheduling periodic real time tasks with heterogeneous reward requirements"
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"
    - "rethinking information theory for mobile ad hoc networks"

Connected through hyperedge HE-2 (induced by source paper "utility optimal dynamic rate allocation under average end to end delay requirements"):
  with members:
    - "scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints"

Connected through hyperedge HE-3 (induced by source paper "a framework for quality of service with a multiple access strategy"):
  with members:
    - "a fast csma algorithm for deadline constrained scheduling over wireless fading channels"
    - "scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

Connected through hyperedge HE-4 (induced by source paper "control and optimization meet the smart power grid scheduling of power demands for optimal energy management"):
  with members:
    - "need based communication for smart grid when to inquire power price"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

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.NI(Networking and Internet Architecture)