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: "heavy traffic optimal resource allocation algorithms for cloud computing clusters"
  Abstract: Cloud computing is emerging as an important platform for business, personal and mobile computing applications. In this paper, we study a stochastic model of cloud computing, where jobs arrive according to a stochastic process and request resources like CPU, memory and storage space. We consider a model where the resource allocation problem can be separated into a routing or load balancing problem and a scheduling problem. We study the join-the-shortest-queue routing and power-of-two-choices routing algorithms with MaxWeight scheduling algorithm. It was known that these algorithms are throughput optimal. In this paper, we show that these algorithms are queue length optimal in the heavy traffic limit.

Connected through hyperedge HE-1 (induced by source paper "lsq load balancing in large scale heterogeneous systems with multiple dispatchers"):
  with members:
    - "designing low complexity heavy traffic delay optimal load balancing schemes theory to algorithms"
    - "analyzing distributed join idle queue a fluid limit approach"
    - "randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay"
    - "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"
    - "designing low complexity heavy traffic delay optimal load balancing schemes theory to algorithms"

Connected through hyperedge HE-3 (induced by source paper "throughput optimal decentralized scheduling with single bit state feedback for a class of queueing systems"):
  with members:
    - "approaching throughput optimality in distributed csma scheduling algorithms with collisions"
    - "message passing for maximum weight independent set"

Connected through hyperedge HE-4 (induced by source paper "dynamic resource allocation in the cloud with near optimal efficiency"):
  with members:
    - "introduction to online convex optimization"
    - "competitive caching with machine learned advice"
    - "overcommitment in cloud services bin packing with chance constraints"

Connected through hyperedge HE-5 (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"
    - "designing low complexity heavy traffic delay optimal load balancing schemes theory to algorithms"

Connected through hyperedge HE-6 (induced by source paper "flexible load balancing with multi dimensional state space collapse throughput and heavy traffic delay optimality"):
  with members:
    - "designing low complexity heavy traffic delay optimal load balancing schemes theory to algorithms"
    - "cloud computing and grid computing 360 degree compared"

Connected through hyperedge HE-7 (induced by source paper "fluctuation bounds for the max weight policy with applications to state space collapse"):
  with members:
    - "sensitivity to cumulative perturbations for a class of piecewise constant hybrid systems"

Connected through hyperedge HE-8 (induced by source paper "designing low complexity heavy traffic delay optimal load balancing schemes theory to algorithms"):
  with members:
    - "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.PF(Performance)