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: "novel architectures and algorithms for delay reduction in back pressure scheduling and routing"
  Abstract: The back-pressure algorithm is a well-known throughput-optimal algorithm. However, its delay performance may be quite poor even when the traffic load is not close to network capacity due to the following two reasons. First, each node has to maintain a separate queue for each commodity in the network, and only one queue is served at a time. Second, the back-pressure routing algorithm may route some packets along very long routes. In this paper, we present solutions to address both of the above issues, and hence, improve the delay performance of the back-pressure algorithm. One of the suggested solutions also decreases the complexity of the queueing data structures to be maintained at each node.

Connected through hyperedge HE-1 (induced by source paper "timely throughput optimal scheduling with prediction"):
  with members:
    - "a new backpressure algorithm for joint rate control and routing with vanishing utility optimality gaps and finite queue lengths"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "optimal routing for delay sensitive traffic in overlay networks"):
  with members:
    - "finite sample analyses for td 0 with function approximation"
    - "batch normalization accelerating deep network training by reducing internal covariate shift"
    - "tight regret bounds for stochastic combinatorial semi bandits"
    - "throughput optimal routing in overlay networks"

Connected through hyperedge HE-3 (induced by source paper "towards fast convergence low delay and low complexity network optimization"):
  with members:
    - "a new backpressure algorithm for joint rate control and routing with vanishing utility optimality gaps and finite queue lengths"
    - "distributed cross layer optimization in wireless networks a second order approach"

Connected through hyperedge HE-4 (induced by source paper "throughput optimal load balancing for intra datacenter networks"):
  with members:
    - "tcp aware backpressure routing and scheduling"

Connected through hyperedge HE-5 (induced by source paper "throughput optimal scheduling design with regular service guarantees in wireless networks"):
  with members:
    - "avoiding interruptions qoe trade offs in block coded streaming media applications"
    - "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

Connected through hyperedge HE-6 (induced by source paper "index policies for optimal mean variance trade off of inter delivery times in real time sensor networks"):
  with members:
    - "pathwise performance of debt based policies for wireless networks with hard delay constraints"

Connected through hyperedge HE-7 (induced by source paper "cross layer control for worse case delay guarantees in heterogeneous powered wireless sensor network via lyapunov optimization"):
  with members:
    - "optimal power allocation for energy harvesting and power grid coexisting wireless communication systems"
    - "a survey on delay aware resource control for wireless systems large deviation theory stochastic lyapunov drift and distributed stochastic learning"

Connected through hyperedge HE-8 (induced by source paper "throughput optimizing localized link scheduling for multihop wireless networks under physical interference model"):
  with members:
    - "distributed link scheduling with constant overhead"

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)