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: "a new backpressure algorithm for joint rate control and routing with vanishing utility optimality gaps and finite queue lengths"
  Abstract: The backpressure algorithm has been widely used as a distributed solution to the problem of joint rate control and routing in multi-hop data networks. By controlling a parameter $V$ in the algorithm, the backpressure algorithm can achieve an arbitrarily small utility optimality gap. However, this in turn brings in a large queue length at each node and hence causes large network delay. This phenomenon is known as the fundamental utility-delay tradeoff. The best known utility-delay tradeoff for general networks is $[O(1/V), O(V)]$ and is attained by a backpressure algorithm based on a drift-plus-penalty technique. This may suggest that to achieve an arbitrarily small utility optimality gap, the existing backpressure algorithms necessarily yield an arbitrarily large queue length. However, this paper proposes a new backpressure algorithm that has a vanishing utility optimality gap, so utility converges to exact optimality as the algorithm keeps running, while queue lengths are bounded throughout by a finite constant. The technique uses backpressure and drift concepts with a new method for convex programming.

Connected through hyperedge HE-1 (induced by source paper "queue aware beam scheduling for half duplex mmwave relay networks"):
  with members:
    - "fully partially connected hybrid beamforming architectures for mmwave mu mimo"
    - "efficient beam alignment for mmwave single carrier systems with hybrid mimo transceivers"
    - "gaussian 1 2 1 networks capacity results for mmwave communications"
    - "towards fast convergence low delay and low complexity network optimization"
    - "efficiently finding simple schedules in gaussian half duplex relay line networks"

Connected through hyperedge HE-2 (induced by source paper "timely throughput optimal scheduling with prediction"):
  with members:
    - "online convex optimization using predictions"
    - "power delay tradeoff with predictive scheduling in integrated cellular and wi fi networks"
    - "decentralized throughput maximizing policies for deadline constrained wireless networks"
    - "scheduling periodic real time tasks with heterogeneous reward requirements"
    - "novel architectures and algorithms for delay reduction in back pressure scheduling and routing"

Connected through hyperedge HE-3 (induced by source paper "towards fast convergence low delay and low complexity network optimization"):
  with members:
    - "distributed cross layer optimization in wireless networks a second order approach"
    - "novel architectures and algorithms for delay reduction in back pressure scheduling and routing"

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)