human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "distributed approximation of maximum independent set and maximum matching"
  Abstract: We present a simple distributed $\Delta$-approximation algorithm for maximum weight independent set (MaxIS) in the $\mathsf{CONGEST}$ model which completes in $O(\texttt{MIS}(G)\cdot \log W)$ rounds, where $\Delta$ is the maximum degree, $\texttt{MIS}(G)$ is the number of rounds needed to compute a maximal independent set (MIS) on $G$, and $W$ is the maximum weight of a node. %Whether our algorithm is randomized or deterministic depends on the \texttt{MIS} algorithm used as a black-box. #R##N#Plugging in the best known algorithm for MIS gives a randomized solution in $O(\log n \log W)$ rounds, where $n$ is the number of nodes. #R##N#We also present a deterministic $O(\Delta +\log^* n)$-round algorithm based on coloring. #R##N#We then show how to use our MaxIS approximation algorithms to compute a $2$-approximation for maximum weight matching without incurring any additional round penalty in the $\mathsf{CONGEST}$ model. We use a known reduction for simulating algorithms on the line graph while incurring congestion, but we show our algorithm is part of a broad family of \emph{local aggregation algorithms} for which we describe a mechanism that allows the simulation to run in the $\mathsf{CONGEST}$ model without an additional overhead. #R##N#Next, we show that for maximum weight matching, relaxing the approximation factor to ($2+\varepsilon$) allows us to devise a distributed algorithm requiring $O(\frac{\log \Delta}{\log\log\Delta})$ rounds for any constant $\varepsilon>0$. For the unweighted case, we can even obtain a $(1+\varepsilon)$-approximation in this number of rounds. These algorithms are the first to achieve the provably optimal round complexity with respect to dependency on $\Delta$.

Connected through hyperedge HE-1 (induced by source paper "distributed maximum matching verification in congest"):
  with members:
    - "lower bounds for maximal matchings and maximal independent sets"
    - "sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation"
    - "improved deterministic distributed matching via rounding"
    - "coresets meet edcs algorithms for matching and vertex cover on massive graphs"
    - "round compression for parallel matching algorithms"
    - "deterministic distributed edge coloring via hypergraph maximal matching"
    - "quadratic and near quadratic lower bounds for the congest model"
    - "on derandomizing local distributed algorithms"

Connected through hyperedge HE-2 (induced by source paper "beyond alice and bob improved inapproximability for maximum independent set in congest"):
  with members:
    - "improved distributed approximation to maximum independent set"
    - "detecting cliques in congest networks"
    - "distributed spanner approximation"
    - "fooling views a new lower bound technique for distributed computations under congestion"
    - "quadratic and near quadratic lower bounds for the congest model"
    - "near linear lower bounds for distributed distance computations even in sparse networks"
    - "distributed construction of purely additive spanners"
    - "approximation of distances and shortest paths in the broadcast congest clique"

Connected through hyperedge HE-3 (induced by source paper "smaller cuts higher lower bounds"):
  with members:
    - "a faster deterministic distributed algorithm for weighted apsp through pipelining"
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "distributed exact weighted all pairs shortest paths in near linear time"
    - "optimal distributed coloring algorithms for planar graphs in the local model"
    - "distributed exact shortest paths in sublinear time"
    - "a time hierarchy theorem for the local model"
    - "a 2 ϵ approximation for maximum weight matching in the semi streaming model"
    - "quadratic and near quadratic lower bounds for the congest model"

Connected through hyperedge HE-4 (induced by source paper "hardness of distributed optimization"):
  with members:
    - "small cuts and connectivity certificates a fault tolerant approach"
    - "fast and efficient distributed computation of hamiltonian cycles in random graphs"
    - "a distributed algorithm for finding hamiltonian cycles in random graphs in o log n time"
    - "new distributed algorithms in almost mixing time via transformations from parallel algorithms"
    - "parameterized distributed algorithms"
    - "distributed exact weighted all pairs shortest paths in near linear time"
    - "detecting cliques in congest networks"
    - "simple and local independent set approximation"

Connected through hyperedge HE-5 (induced by source paper "improved distributed approximation to maximum independent set"):
  with members:
    - "polylogarithmic time deterministic network decomposition and distributed derandomization"
    - "lower bounds for maximal matchings and maximal independent sets"
    - "simple and local independent set approximation"
    - "deterministic distributed edge coloring via hypergraph maximal matching"
    - "quadratic and near quadratic lower bounds for the congest model"
    - "derandomizing local distributed algorithms under bandwidth restrictions"
    - "on the complexity of local distributed graph problems"
    - "an improved distributed algorithm for maximal independent set"

Connected through hyperedge HE-6 (induced by source paper "optimal distributed covering algorithms"):
  with members:
    - "distributed degree splitting edge coloring and orientations"
    - "an exponential separation between randomized and deterministic complexity in the local model"
    - "an improved distributed algorithm for maximal independent set"
    - "local computation lower and upper bounds"
    - "a simple local 3 approximation algorithm for vertex cover"
    - "a primal dual parallel approximation technique applied to weighted set and vertex covers"

Connected through hyperedge HE-7 (induced by source paper "distributed approximation algorithms for maximum matching in graphs and hypergraphs"):
  with members:
    - "distributed dense subgraph detection and low outdegree orientation"
    - "polylogarithmic time deterministic network decomposition and distributed derandomization"
    - "lower bounds for maximal matchings and maximal independent sets"
    - "parameterized distributed algorithms"
    - "improved deterministic distributed matching via rounding"
    - "deterministic distributed edge coloring with fewer colors"
    - "deterministic distributed edge coloring via hypergraph maximal matching"
    - "adapting sequential algorithms to the distributed setting"

Connected through hyperedge HE-8 (induced by source paper "simple and local independent set approximation"):
  with members:
    - "independent set size approximation in graph streams"
    - "quadratic and near quadratic lower bounds for the congest model"
    - "on the complexity of local distributed graph problems"
    - "on the lov asz theta function for independent sets in sparse graphs"
    - "local computation lower and upper bounds"

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