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 "algorithmic meta theorems for graphs of bounded vertex cover"):
  Abstract: Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for graphs of bounded treewidth. Unfortunately, the running time's dependence on the MSO formula describing the problem is in general a tower of exponentials of unbounded height, and there exist lower bounds proving that this cannot be improved even if we restrict ourselves to deciding FO logic on trees. #R##N#In this paper we attempt to circumvent these lower bounds by focusing on a subclass of bounded treewidth graphs, the graphs of bounded vertex cover. By using a technique different from the standard decomposition and dynamic programming technique of treewidth we prove that in this case the running time implied by Courcelle's theorem can be improved dramatically, from non-elementary to doubly and singly exponential for MSO and FO logic respectively. Our technique relies on a new graph width measure we introduce, for which we show some additional results that may indicate that it is of independent interest. We also prove lower bound results which show that our upper bounds cannot be improved significantly, under widely believed complexity assumptions. Our work answers an open problem posed by Michael Fellows.

Includes members:
  Member "on brambles grid like minors and parameterized intractability of monadic second order logic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "model checking for successor invariant first order formulas on graph classes of bounded expansion")
  Member "deciding first order properties of locally tree decomposable structures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hitting topological minors is fpt")

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