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 "potential maximal cliques parameterized by edge clique cover"):
  Abstract: We show that the number of minimal separators on graphs with edge clique cover of size $cc$ is $O(2^{cc})$ and the number of potential maximal cliques is $O(3^{cc})$. Furthermore, potential maximal cliques can be listed in $O^*(3^{cc'})$ time when an edge clique cover of size $cc'$ is given. This yields $O^*(3^{cc'})$ time algorithms for all problems in the framework of potential maximal cliques, for example Treewidth, Minimum Fill-In and Maximum Independent Set. The parameter $cc$ is motivated by practice: our results imply that Treewidth can be solved in $O^*(3^m)$ time for primal graphs of CSP instances with $m$ constraints. Furthermore, Generalized Hypertree Width and Fractional Hypertree Width can be solved in $O^*(4^m)$ and $O^*(3^m)$ time. There are many real CSP applications where the number of constraints is much smaller than the number of variables. Other applications of the parameterization include Perfect Phylogeny. The bounds on the number of minimal separators and the number of potential maximal cliques are tight, and $cc$ is orthogonal to the existing parameterizations for potential maximal cliques.

Includes members:
  Member "hyperbench a benchmark and tool for hypergraphs and empirical findings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "constraint solving via fractional edge covers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "on the tractability of optimization problems on h graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "node multiway cut and subset feedback vertex set on graphs of bounded mim width")
  Member "ranked enumeration of minimal triangulations":
    also connected through other hyperedges:
      (none)
  Member "positive instance driven dynamic programming for treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finding all global minimum cuts in practice")
  Member "on distance d independent set and other problems in graphs with few minimal separators":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a meta algorithm for solving connectivity and acyclicity constraints on locally checkable properties parameterized by graph width measures")
  Member "general and fractional hypertree decompositions hard and easy cases":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "on the number of minimal separators in graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on h topological intersection graphs")

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)