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 "a fast distributed solver for symmetric diagonally dominant linear equations"):
  Abstract: In this paper, we propose a fast distributed solver for linear equations given by symmetric diagonally dominant M-Matrices. Our approach is based on a distributed implementation of the parallel solver of Spielman and Peng by considering a specific approximated inverse chain which can be computed efficiently in a distributed fashion. Representing the system of equations by a graph $\mathbb{G}$, the proposed distributed algorithm is capable of attaining $\epsilon$-close solutions (for arbitrary $\epsilon$) in time proportional to $n^{3}$ (number of nodes in $\mathbb{G}$), ${\alpha}$ (upper bound on the size of the R-Hop neighborhood), and $\frac{{W}_{max}}{{W}_{min}}$ (maximum and minimum weight of edges in $\mathbb{G}$).

Includes members:
  Member "solving systems of linear equations locally and asynchronously":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the role of clustering in personalized pagerank estimation")
  Member "near linear work parallel sdd solvers low diameter decomposition and low stretch subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynamic low stretch trees via dynamic low diameter decompositions")
  Member "approaching optimality for solving sdd systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "solving linear programs with sqrt rank linear system solves")
  Member "faster generation of random spanning trees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dynamic streaming spectral sparsification in nearly linear time and space")
  Member "nearly linear time algorithms for preconditioning and solving symmetric diagonally dominant linear systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "speeding up linear programming using randomized linear algebra")
  Member "solving elliptic finite element systems in near linear time with support preconditioners":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient structured matrix recovery and nearly linear time algorithms for solving inverse symmetric m matrices")

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)