human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "mg wfbp merging gradients wisely for efficient communication in distributed deep learning"):
  Abstract: Distributed synchronous stochastic gradient descent has been widely used to train deep neural networks (DNNs) on computer clusters. With the increase of computational power, network communications generally limit the system scalability. Wait-free backpropagation (WFBP) is a popular solution to overlap communications with computations during the training process. In this paper, we observe that many DNNs have a large number of layers with only a small amount of data to be communicated at each layer in distributed training, which could make WFBP inefficient. Based on the fact that merging some short communication tasks into a single one can reduce the overall communication time, we formulate an optimization problem to minimize the training time in pipelining communications and computations. We derive an optimal solution that can be solved efficiently without affecting the training performance. We then apply the solution to propose a distributed training algorithm named merged-gradient WFBP (MG-WFBP) and implement it in two platforms Caffe and PyTorch. Extensive experiments in three GPU clusters are conducted to verify the effectiveness of MG-WFBP. We further exploit the trace-based simulation of 64 GPUs to explore the potential scaling efficiency of MG-WFBP. Experimental results show that MG-WFBP achieves much better scaling performance than existing methods.

Includes members:
  Member "a distributed synchronous sgd algorithm with global top k sparsification for low bandwidth networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive gradient sparsification for efficient federated learning an online learning approach")
  Member "pytorch an imperative style high performance deep learning library":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "mg wfbp efficient data communication for distributed synchronous sgd algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "highly scalable deep learning training system with mixed precision training imagenet in four minutes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "deep gradient compression reducing the communication bandwidth for distributed training":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sparse weight activation training")
  Member "poseidon an efficient communication architecture for distributed deep learning on gpu clusters":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "scaling deep learning on gpu and knights landing clusters":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adaptive gradient sparsification for efficient federated learning an online learning approach")
  Member "mixed precision training":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "post training piecewise linear quantization for deep neural networks")

Question: Please tell me which class the source paper 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)