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 "exploiting database management systems and treewidth for counting"):
  Abstract: Bounded treewidth is one of the most cited combinatorial invariants, which was applied in the literature for solving several counting problems efficiently. A canonical counting problem is #SAT, which asks to count the satisfying assignments of a Boolean formula. Recent work shows that benchmarking instances for #SAT often have reasonably small treewidth. This paper deals with counting problems for instances of small treewidth. We introduce a general framework to solve counting questions based on state-of-the-art database management systems (DBMS). Our framework takes explicitly advantage of small treewidth by solving instances using dynamic programming (DP) on tree decompositions (TD). Therefore, we implement the concept of DP into a DBMS (PostgreSQL), since DP algorithms are already often given in terms of table manipulations in theory. This allows for elegant specifications of DP algorithms and the use of SQL to manipulate records and tables, which gives us a natural approach to bring DP algorithms into practice. To the best of our knowledge, we present the first approach to employ a DBMS for algorithms on TDs. A key advantage of our approach is that DBMS naturally allow to deal with huge tables with a limited amount of main memory (RAM), parallelization, as well as suspending computation.

Includes members:
  Member "exploiting treewidth for projected model counting and its limits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "answer set solving exploiting treewidth and its limits")
  Member "experimental evaluation of parameterized algorithms for feedback vertex set":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finding all global minimum cuts in practice")
  Member "practical access to dynamic programming on tree decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finding all global minimum cuts in practice")
  Member "implementing efficient all solutions sat solvers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fast counting with tensor networks")
  Member "distribution aware sampling and weighted model counting for sat":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the approximability of weighted model integration on dnf structures")
  Member "uniform solution sampling using a constraint solver as an oracle":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "faster creation of smaller test suites with snap")
  Member "probabilistic planning via heuristic forward search and weighted model counting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the approximability of weighted model integration on dnf structures")

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.AI(Artificial Intelligence)