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 "using read k inequalities to analyze a distributed mis algorithm"):
  Abstract: Until recently, the fastest distributed MIS algorithm, even for simple graphs, e.g., unoriented trees has been the simple randomized algorithm discovered the 80s. This algorithm (commonly called Luby's algorithm) computes an MIS in $O(\log n)$ rounds (with high probability). This situation changed when Lenzen and Wattenhofer (PODC 2011) presented a randomized $O(\sqrt{\log n}\cdot \log\log n)$-round MIS algorithm for unoriented trees. This algorithm was improved by Barenboim et al. (FOCS 2012), resulting in an $O(\sqrt{\log n \cdot \log\log n})$-round MIS algorithm. #R##N#The analyses of these tree MIS algorithms depends on "near independence" of probabilistic events, a feature of the tree structure of the network. In their paper, Lenzen and Wattenhofer hope that their algorithm and analysis could be extended to graphs with bounded arboricity. We show how to do this. By using a new tail inequality for read-k families of random variables due to Gavinsky et al. (Random Struct Algorithms, 2015), we show how to deal with dependencies induced by the recent tree MIS algorithms when they are executed on bounded arboricity graphs. Specifically, we analyze a version of the tree MIS algorithm of Barenboim et al. and show that it runs in $O(\mbox{poly}(\alpha) \cdot \sqrt{\log n \cdot \log\log n})$ rounds in the $\mathcal{CONGEST}$ model for graphs with arboricity $\alpha$. #R##N#While the main thrust of this paper is the new probabilistic analysis via read-$k$ inequalities, for small values of $\alpha$, this algorithm is faster than the bounded arboricity MIS algorithm of Barenboim et al. We also note that recently (SODA 2016), Gaffari presented a novel MIS algorithm for general graphs that runs in $O(\log \Delta) + 2^{O(\sqrt{\log\log n})}$ rounds; a corollary of this algorithm is an $O(\log \alpha + \sqrt{\log n})$-round MIS algorithm on arboricity-$\alpha$ graphs.

Includes members:
  Member "an improved distributed algorithm for maximal independent set":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "space efficient approximation to maximum matching size from uniform edge samples")
  Member "a tail bound for read k families of functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "average case lower bounds and satisfiability algorithms for small threshold circuits")
  Member "the locality of distributed symmetry breaking":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed maximum matching verification in congest")

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)