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: "low latency job scheduling with preemption for the development of deep learning"
  Abstract: One significant challenge in the job scheduling of computing clusters for the development of deep learning algorithms is the efficient scheduling of trial-and-error (TE) job, the type of job in which the users seek to conduct small-scale experiments while monitoring their processes. Unfortunately, the existing job schedulers to date do not feature well-balanced scheduling for the mixture of TE jobs and best-effort (BE) jobs, or they can handle the mixture in limited situations at most. To fill in this niche, we propose an algorithm that can significantly reduce the latency of TE jobs in versatile situations without greatly elongating the slowdown of the BE jobs. Our algorithm efficiently schedules both TE and BE jobs by selectively preempting the BE jobs that can be, when the time comes, resumed without much delay. In our simulation study with synthetic and real workloads, we were able to reduce the 95th percentile of the slowdown rates for the TE jobs in the standard FIFO strategy by 96.6%, while compromising the median of the BE slowdown rates by only 18.0% and the 95th percentile by only 23.9%.

Connected through hyperedge HE-1 (induced by source paper "understanding and optimizing packed neural network training for hyper parameter tuning"):
  with members:
    - "hypersched dynamic resource reallocation for model development on a deadline"
    - "crossbow scaling deep learning with small batch sizes on multi gpu servers"
    - "3lc lightweight and effective traffic compression for distributed machine learning"
    - "efficient memory management for gpu based deep learning systems"
    - "themis fair and efficient gpu cluster scheduling for machine learning workloads"
    - "exploiting reuse in pipeline aware hyperparameter tuning"
    - "analysis of large scale multi tenant gpu clusters for dnn training workloads"
    - "energy and policy considerations for deep learning in nlp"

Connected through hyperedge HE-2 (induced by source paper "communication contention aware scheduling of multiple deep learning training jobs"):
  with members:
    - "a distributed synchronous sgd algorithm with global top k sparsification for low bandwidth networks"
    - "analysis of large scale multi tenant gpu clusters for dnn training workloads"
    - "tony an orchestrator for distributed machine learning jobs"
    - "online job scheduling in distributed machine learning clusters"
    - "highly scalable deep learning training system with mixed precision training imagenet in four minutes"
    - "horovod fast and easy distributed deep learning in tensorflow"
    - "deep gradient compression reducing the communication bandwidth for distributed training"
    - "scaling deep learning on gpu and knights landing 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)