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: "a quasi polynomial time partition oracle for graphs with an excluded minor"
  Abstract: Motivated by the problem of testing planarity and related properties, we study the problem of designing efficient {\em partition oracles}. A {\em partition oracle} is a procedure that, given access to the incidence lists representation of a bounded-degree graph $G= (V,E)$ and a parameter $\eps$, when queried on a vertex $v\in V$, returns the part (subset of vertices) which $v$ belongs to in a partition of all graph vertices. The partition should be such that all parts are small, each part is connected, and if the graph has certain properties, the total number of edges between parts is at most $\eps |V|$. In this work we give a partition oracle for graphs with excluded minors whose query complexity is quasi-polynomial in $1/\eps$, thus improving on the result of Hassidim et al. ({\em Proceedings of FOCS 2009}) who gave a partition oracle with query complexity exponential in $1/\eps$. This improvement implies corresponding improvements in the complexity of testing planarity and other properties that are characterized by excluded minors as well as sublinear-time approximation algorithms that work under the promise that the graph has an excluded minor.

Connected through hyperedge HE-1 (induced by source paper "local computation algorithms for spanners"):
  with members:
    - "a deamortization approach for dynamic spanner and dynamic maximal matching"
    - "derandomizing local distributed algorithms under bandwidth restrictions"
    - "fully dynamic spanners with worst case update time"
    - "a local algorithm for constructing spanners in minor free graphs"
    - "a local computation approximation scheme to maximum matching"

Connected through hyperedge HE-2 (induced by source paper "evacuating two robots from a disk a second cut"):
  with members:
    - "god save the queen"
    - "priority evacuation from a disk using mobile robots"
    - "the ants problem"
    - "fast two robot disk evacuation with wireless communication"

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:
    - "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"
    - "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 "on the characterization of 1 sided error strongly testable graph properties for bounded degree graphs including an appendix"):
  with members:
    - "testing cluster structure of graphs"
    - "finding cycles and trees in sublinear time"

Connected through hyperedge HE-5 (induced by source paper "property testing of planarity in the congest model"):
  with members:
    - "minor excluded network families admit fast distributed algorithms"
    - "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"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "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"):
  with members:
    - "testing cluster structure of 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-7 (induced by source paper "tree projections and constraint optimization problems fixed parameter tractability and parallel algorithms"):
  with members:
    - "constraint solving via fractional edge covers"
    - "greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems"
    - "general and fractional hypertree decompositions hard and easy cases"
    - "aggregations over generalized hypertree decompositions"
    - "faq questions asked frequently"
    - "structural tractability of enumerating csp solutions"
    - "possibilistic constraint satisfaction problems or how to handle soft constraints"
    - "tree projections and structural decomposition methods minimality and game theoretic characterization"

Connected through hyperedge HE-8 (induced by source paper "a local algorithm for the sparse spanning graph problem"):
  with members:
    - "local computation algorithms for graphs of non constant degrees"
    - "local algorithms for sparse spanning graphs"
    - "a local computation approximation scheme to maximum matching"
    - "converting online algorithms to local computation algorithms"
    - "fast local computation algorithms"
    - "finding cycles and trees in sublinear time"

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.DS(Data Structures and Algorithms)