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: "load balancing via random local search in closed and open systems"
  Abstract: In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may switch server independently at random instants of time in an attempt to improve their service rate. This approach to load balancing contrasts with traditional approaches where clients make smart server selections upon arrival (e.g., Join-the-Shortest-Queue policy and variants thereof). Load resampling is particularly relevant in scenarios where clients cannot predict the load of a server before being actually attached to it. An important example is in wireless spectrum sharing where clients try to share a set of frequency bands in a distributed manner.

Connected through hyperedge HE-1 (induced by source paper "global attraction of ode based mean field models with hyperexponential job sizes"):
  with members:
    - "randomized work stealing versus sharing in large scale systems with non exponential job sizes"
    - "randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay"

Connected through hyperedge HE-2 (induced by source paper "randomized work stealing versus sharing in large scale systems with non exponential job sizes"):
  with members:
    - "global attraction of ode based mean field models with hyperexponential job sizes"

Connected through hyperedge HE-3 (induced by source paper "tight load balancing via randomized local search"):
  with members:
    - "self stabilizing repeated balls into bins"
    - "threshold load balancing in networks"
    - "distributed selfish load balancing"

Connected through hyperedge HE-4 (induced by source paper "online algorithms for basestation allocation"):
  with members:
    - "approximation algorithms for submodular multiway partition"
    - "algorithms for secretary problems on graphs and hypergraphs"

Connected through hyperedge HE-5 (induced by source paper "the supermarket game"):
  with members:
    - "occupancy distributions of homogeneous queueing systems under opportunistic scheduling"

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)