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 "distributed maximum matching verification in congest"):
  Abstract: We study the maximum cardinality matching problem in a standard distributed setting, where the nodes $V$ of a given $n$-node network graph $G=(V,E)$ communicate over the edges $E$ in synchronous rounds. More specifically, we consider the distributed CONGEST model, where in each round, each node of $G$ can send an $O(\log n)$-bit message to each of its neighbors. We show that for every graph $G$ and a matching $M$ of $G$, there is a randomized CONGEST algorithm to verify $M$ being a maximum matching of $G$ in time $O(|M|)$ and disprove it in time $O(D + \ell)$, where $D$ is the diameter of $G$ and $\ell$ is the length of a shortest augmenting path. We hope that our algorithm constitutes a significant step towards developing a CONGEST algorithm to compute a maximum matching in time $\tilde{O}(s^*)$, where $s^*$ is the size of a maximum matching.

Includes members:
  Member "lower bounds for maximal matchings and maximal independent sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "truly tight in delta bounds for bipartite maximal matching and variants")
  Member "sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "improved deterministic distributed matching via rounding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "truly tight in delta bounds for bipartite maximal matching and variants")
  Member "coresets meet edcs algorithms for matching and vertex cover on massive graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "round compression for parallel matching algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "deterministic distributed edge coloring via hypergraph maximal matching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed edge coloring in time quasi polylogarithmic in delta")
  Member "quadratic and near quadratic lower bounds for the congest model":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "beyond alice and bob improved inapproximability for maximum independent set in congest")
  Member "on derandomizing local distributed algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed edge coloring in time quasi polylogarithmic in delta")

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)