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: "randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay"
  Abstract: We consider the job assignment problem in a multi-server system consisting of $N$ parallel processor sharing servers, categorized into $M$ ($\ll N$) different types according to their processing capacity or speed. Jobs of random sizes arrive at the system according to a Poisson process with rate $N \lambda$. Upon each arrival, a small number of servers from each type is sampled uniformly at random. The job is then assigned to one of the sampled servers based on a selection rule. We propose two schemes, each corresponding to a specific selection rule that aims at reducing the mean sojourn time of jobs in the system. #R##N#We first show that both methods achieve the maximal stability region. We then analyze the system operating under the proposed schemes as $N \to \infty$ which corresponds to the mean field. Our results show that asymptotic independence among servers holds even when $M$ is finite and exchangeability holds only within servers of the same type. We further establish the existence and uniqueness of stationary solution of the mean field and show that the tail distribution of server occupancy decays doubly exponentially for each server type. When the estimates of arrival rates are not available, the proposed schemes offer simpler alternatives to achieving lower mean sojourn time of jobs, as shown by our numerical studies.

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"
    - "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 "optimal content replication and request matching in large caching systems"):
  with members:
    - "insensitivity of the mean field limit of loss systems under power of d routing"
    - "serving content with unknown demand the high dimensional regime"
    - "on the complexity of optimal routing and content caching in heterogeneous networks"
    - "femtocaching wireless video content delivery through distributed caching helpers"

Connected through hyperedge HE-3 (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"
    - "load balancing via random local search in closed and open systems"

Connected through hyperedge HE-4 (induced by source paper "delay versus stickiness violation trade offs for load balancing in large scale data centers"):
  with members:
    - "coflow scheduling in input queued switches optimal delay scaling and algorithms"
    - "analyzing distributed join idle queue a fluid limit approach"

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)