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: "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"
  Abstract: Let $G$ be an undirected, bounded degree graph with $n$ vertices. Fix a finite graph $H$, and suppose one must remove $\eps n$ edges from $G$ to make it $H$-minor free (for some small constant $\eps > 0$). We give an $n^{1/2+o(1)}$-time randomized procedure that, with high probability, finds an $H$-minor in such a graph. For an example application, suppose one must remove $\eps n$ edges from a bounded degree graph $G$ to make it planar. This result implies an algorithm, with the same running time, that produces a $K_{3,3}$ or $K_5$ minor in $G$. No sublinear time bound was known for this problem, prior to this result. #R##N#By the graph minor theorem, we get an analogous result for any minor-closed property. Up to $n^{o(1)}$ factors, this resolves a conjecture of Benjamini-Schramm-Shapira (STOC 2008) on the existence of one-sided property testers for minor-closed properties. Furthermore, our algorithm is nearly optimal, by an $\Omega(\sqrt{n})$ lower bound of Czumaj et al (RSA 2014). #R##N#Prior to this work, the only graphs $H$ for which non-trivial property testers were known for $H$-minor freeness are the following: $H$ being a forest or a cycle (Czumaj et al, RSA 2014), $K_{2,k}$, $(k\times 2)$-grid, and the $k$-circus (Fichtenberger et al, Arxiv 2017).

Connected through hyperedge HE-1 (induced by source paper "nearly optimal edge estimation with independent set queries"):
  with members:
    - "a simple sublinear time algorithm for counting arbitrary subgraphs via edge sampling"
    - "edge estimation with independent set oracles"
    - "on approximating the number of k cliques in sublinear time"
    - "on sampling edges almost uniformly"
    - "sublinear time algorithms for counting star subgraphs with applications to join selectivity estimation"
    - "approximately counting triangles in sublinear time"
    - "the power of an example hidden set size approximation using group queries and conditional sampling"
    - "a near optimal sublinear time algorithm for approximating the minimum vertex cover size"

Connected through hyperedge HE-2 (induced by source paper "a lower bound on cycle finding in sparse digraphs"):
  with members:
    - "a simple sublinear time algorithm for counting arbitrary subgraphs via edge sampling"
    - "edge estimation with independent set oracles"
    - "on approximating the number of k cliques in sublinear time"
    - "approximately counting triangles in sublinear time"
    - "property testing in sparse directed graphs 3 star freeness and connectivity"
    - "a near optimal sublinear time algorithm for approximating the minimum vertex cover size"

Connected through hyperedge HE-3 (induced by source paper "random walks and forbidden minors ii a text poly d varepsilon 1 query tester for minor closed properties of bounded degree graphs"):
  with members:
    - "a quasi polynomial time partition oracle for graphs with an excluded minor"
    - "an efficient partitioning oracle for bounded treewidth graphs"
    - "finding cycles and trees in sublinear time"
    - "a local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning"

Connected through hyperedge HE-4 (induced by source paper "property testing of planarity in the congest model"):
  with members:
    - "minor excluded network families admit fast distributed algorithms"
    - "distributed subgraph detection"
    - "testing bounded arboricity"
    - "a sublinear tester for outerplanarity and other forbidden minors with one sided error"
    - "distributed detection of cycles"
    - "faster and simpler distributed algorithms for testing and correcting graph properties in the congest model"
    - "distributed property testing for subgraph freeness revisited"
    - "on the multiparty communication complexity of testing triangle freeness"

Connected through hyperedge HE-5 (induced by source paper "a sublinear tester for outerplanarity and other forbidden minors with one sided error"):
  with members:
    - "a local algorithm for the sparse spanning graph problem"
    - "a quasi polynomial time partition oracle for graphs with an excluded minor"

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.DM(Discrete Mathematics)