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: "flexible load balancing with multi dimensional state space collapse throughput and heavy traffic delay optimality"
  Abstract: Heavy traffic analysis for load balancing policies has relied heavily on the condition of state-space collapse onto a single-dimensional line in previous works. In this paper, via Lyapunov-drift analysis, we rigorously prove that even under a multi-dimensional state-space collapse, steady-state heavy-traffic delay optimality can still be achieved for a general load balancing system. This result directly implies that achieving steady-state heavy-traffic delay optimality simply requires that no server is idling while others are busy at heavy loads, thus complementing and extending the result obtained by diffusion approximations. Further, we explore the greater flexibility provided by allowing a multi-dimensional state-space collapse in designing new load balancing policies that are both throughput optimal and heavy-traffic delay optimal in steady state. This is achieved by overcoming various technical challenges, and the methods used in this paper could be of independent interest.

Connected through hyperedge HE-1 (induced by source paper "asymptotically optimal load balancing in large scale heterogeneous systems with multiple dispatchers"):
  with members:
    - "heavy traffic delay optimality in pull based load balancing systems necessary and sufficient conditions"
    - "designing low complexity heavy traffic delay optimal load balancing schemes theory to algorithms"
    - "heavy traffic optimal resource allocation algorithms for cloud computing clusters"

Connected through hyperedge HE-2 (induced by source paper "load balancing guardrails keeping your heavy traffic on the road to low response times"):
  with members:
    - "homa a receiver driven low latency transport protocol using network priorities"

Connected through hyperedge HE-3 (induced by source paper "heavy traffic delay optimality in pull based load balancing systems necessary and sufficient conditions"):
  with members:
    - "designing low complexity heavy traffic delay optimal load balancing schemes theory to algorithms"
    - "heavy traffic optimal resource allocation algorithms for cloud computing clusters"

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.DC(Distributed, Parallel, and Cluster Computing)