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: "designing low complexity heavy traffic delay optimal load balancing schemes theory to algorithms"
  Abstract: We establish a unified analytical framework for load balancing systems, which allows us to construct a general class $\Pi$ of policies that are both throughput optimal and heavy-traffic delay optimal. This general class $\Pi$ includes as special cases popular policies such as join-shortest-queue and power-of-$d$, but not the join-idle-queue (JIQ) policy. In fact, we show that JIQ, which is not in $\Pi$, is actually not heavy-traffic delay optimal. Owing to the significant flexibility offered by class $\Pi$, we are able to design a new policy called join-below-threshold (JBT-d), which maintains the simplicity of pull-based policies such as JIQ, but updates its threshold dynamically. We prove that JBT-$d$ belongs to the class $\Pi$ when the threshold is picked appropriately and thus it is heavy-traffic delay optimal. Extensive simulations show that the new policy not only has a low complexity in message rates, but also achieves excellent delay performance, comparable to the optimal join-shortest-queue in various system settings.

Connected through hyperedge HE-1 (induced by source paper "lsq load balancing in large scale heterogeneous systems with multiple dispatchers"):
  with members:
    - "analyzing distributed join idle queue a fluid limit approach"
    - "randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay"
    - "heavy traffic optimal resource allocation algorithms for cloud computing clusters"
    - "cloud computing and grid computing 360 degree compared"

Connected through hyperedge HE-2 (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"
    - "flexible load balancing with multi dimensional state space collapse throughput and heavy traffic delay optimality"
    - "heavy traffic optimal resource allocation algorithms for cloud computing clusters"

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:
    - "flexible load balancing with multi dimensional state space collapse throughput and heavy traffic delay optimality"
    - "heavy traffic optimal resource allocation algorithms for cloud computing clusters"

Connected through hyperedge HE-4 (induced by source paper "flexible load balancing with multi dimensional state space collapse throughput and heavy traffic delay optimality"):
  with members:
    - "heavy traffic optimal resource allocation algorithms for cloud computing clusters"
    - "cloud computing and grid computing 360 degree compared"

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)