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 "on fast and robust information spreading in the vertex congest model"):
  Abstract: This paper initiates the study of the impact of failures on the fundamental problem of \emph{information spreading} in the Vertex-Congest model, in which in every round, each of the $n$ nodes sends the same $O(\log{n})$-bit message to all of its neighbors. #R##N#Our contribution to coping with failures is twofold. First, we prove that the randomized algorithm which chooses uniformly at random the next message to forward is slow, requiring $\Omega(n/\sqrt{k})$ rounds on some graphs, which we denote by $G_{n,k}$, where $k$ is the vertex-connectivity. #R##N#Second, we design a randomized algorithm that makes dynamic message choices, with probabilities that change over the execution. We prove that for $G_{n,k}$ it requires only a near-optimal number of $O(n\log^3{n}/k)$ rounds, despite a rate of $q=O(k/n\log^3{n})$ failures per round. Our technique of choosing probabilities that change according to the execution is of independent interest.

Includes members:
  Member "distributed connectivity decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed edge connectivity in sublinear time")
  Member "a new perspective on vertex connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "connectivity in interdependent networks")
  Member "simple fast and deterministic gossip and rumor spreading":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "network coding gaps for completion times of multiple unicasts")
  Member "analyzing network coding gossip made easy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "synchronous transmissions in low power wireless a survey of communication protocols and network services")
  Member "cover time and broadcast time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the influence of graph density on randomized gossiping")

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)