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 "property testing of planarity in the congest model"):
  Abstract: We give a distributed algorithm in the {\sf CONGEST} model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et al. (DISC 2016), who recently initiated the study of property testing in the distributed setting, our algorithm gives the following guarantee: For a graph $G = (V,E)$ and a distance parameter $\epsilon$, if $G$ is planar, then every node outputs {\sf accept\/}, and if $G$ is $\epsilon$-far from being planar (i.e., more than $\epsilon\cdot |E|$ edges need to be removed in order to make $G$ planar), then with probability $1-1/{\rm poly}(n)$ at least one node outputs {\sf reject}. The algorithm runs in $O(\log|V|\cdot\poly(1/\epsilon))$ rounds, and we show that this result is tight in terms of the dependence on $|V|$. #R##N#Our algorithm combines several techniques of graph partitioning and local verification of planar embeddings. Furthermore, we show how a main subroutine in our algorithm can be applied to derive additional results for property testing of cycle-freeness and bipartiteness, as well as the construction of spanners, in minor-free (unweighted) graphs.

Includes members:
  Member "minor excluded network families admit fast distributed algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "near optimal schedules for simultaneous multicasts")
  Member "fiding forbidden minors in sublinear time a o n 1 2 o 1 query one sided tester for minor closed properties on bounded degree graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nearly optimal edge estimation with independent set queries")
  Member "distributed subgraph detection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed testing of graph isomorphism in the congest model")
  Member "testing bounded arboricity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved dynamic graph coloring")
  Member "a sublinear tester for outerplanarity and other forbidden minors with one sided error":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "every testable infinite property of bounded degree graphs contains an infinite hyperfinite subproperty")
  Member "distributed detection of cycles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed testing of graph isomorphism in the congest model")
  Member "faster and simpler distributed algorithms for testing and correcting graph properties in the congest model":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed testing of graph isomorphism in the congest model")
  Member "distributed property testing for subgraph freeness revisited":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed detection of cliques in dynamic networks")

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)