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 "extension complexity mso logic and treewidth"):
  Abstract: We consider the convex hull $P_{\varphi}(G)$ of all satisfying assignments of a given MSO formula $\varphi$ on a given graph $G$. We show that there exists an extended formulation of the polytope $P_{\varphi}(G)$ that can be described by $f(|\varphi|,\tau)\cdot n$ inequalities, where $n$ is the number of vertices in $G$, $\tau$ is the treewidth of $G$ and $f$ is a computable function depending only on $\varphi$ and $\tau.$ #R##N#In other words, we prove that the extension complexity of $P_{\varphi}(G)$ is linear in the size of the graph $G$, with a constant depending on the treewidth of $G$ and the formula $\varphi$. This provides a first meta-theorem about the extension complexity of polytopes related to a wide class of problems and graphs. #R##N#Furthermore, we study our main geometric tool which we term the glued product of polytopes. Using the results we obtain, we are able to show that our extension of $P_\varphi(G)$ is decomposable and has bounded treewidth.

Includes members:
  Member "extended formulation for csp that is compact for instances of bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "extension complexity of the correlation polytope")
  Member "lower bounds on the size of semidefinite programming relaxations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lifting with simple gadgets and applications to circuit and proof complexity")
  Member "approximation limits of linear programs beyond hierarchies":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressing permutation groups into grammars and polytopes a graph embedding approach")
  Member "courcelle s theorem a game theoretic approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "positive instance driven dynamic programming for graph searching")
  Member "algorithmic meta theorems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nowhere dense graph classes and algorithmic applications a tutorial at highlights of logic games and automata 2019")
  Member "monadic datalog over finite structures with bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity")

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)