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 "asynchronous decentralized optimization in directed networks"):
  Abstract: A popular asynchronous protocol for decentralized optimization is randomized gossip where a pair of neighbors concurrently update via pairwise averaging. In practice, this creates deadlocks and is vulnerable to information delays. It can also be problematic if a node is unable to response or has only access to its private-preserved local dataset. To address these issues simultaneously, this paper proposes an asynchronous decentralized algorithm, i.e. APPG, with {\em directed} communication where each node updates {\em asynchronously} and independently of any other node. If local functions are strongly-convex with Lipschitz-continuous gradients, each node of APPG converges to the same optimal solution at a rate of $O(\lambda^k)$, where $\lambda\in(0,1)$ and the virtual counter $k$ increases by 1 no matter on which node updates. The superior performance of APPG is validated on a logistic regression problem against state-of-the-art methods in terms of linear speedup and system implementations.

Includes members:
  Member "asynchronous subgradient push":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asynchronous policy evaluation in distributed reinforcement learning over networks")
  Member "pipe sgd a decentralized pipelined sgd framework for distributed deep net training":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "turbo aggregate breaking the quadratic aggregation barrier in secure federated learning")
  Member "asyspa an exact asynchronous algorithm for convex optimization over digraphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "asynchronous policy evaluation in distributed reinforcement learning over networks")
  Member "cola decentralized linear learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "turbo aggregate breaking the quadratic aggregation barrier in secure federated learning")
  Member "accurate large minibatch sgd training imagenet in 1 hour":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning representations by predicting bags of visual words")
  Member "asynchronous stochastic gradient descent with delay compensation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "shadowsync performing synchronization in the background for highly scalable distributed training")
  Member "optimal distributed online prediction using mini batches":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "communication optimization strategies for distributed deep learning a survey")

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)