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 "fixed parameter tractability of satisfying beyond the number of variables"):
  Abstract: We consider a CNF formula F as a multiset of clauses: F={c#N#                1,…,c#N#                #N#                  m#N#                }. The set of variables of F will be denoted by V(F). Let B#N#                #N#                  F#N#                 denote the bipartite graph with partite sets V(F) and F and with an edge between v∈V(F) and c∈F if v∈c or #N#                  #N#                    #N#                  #N#                  $\bar{v} \in c$#N#                . The matching number ν(F) of F is the size of a maximum matching in B#N#                #N#                  F#N#                . In our main result, we prove that the following parameterization of MaxSat (denoted by (ν(F)+k)-SAT) is fixed-parameter tractable: Given a formula F, decide whether we can satisfy at least ν(F)+k clauses in F, where k is the parameter. A formula F is called variable-matched if ν(F)=|V(F)|. Let δ(F)=|F|−|V(F)| and δ#N#                ∗(F)=max#N#                  F′⊆F#N#                #N#                δ(F′). Our main result implies fixed-parameter tractability of MaxSat parameterized by δ(F) for variable-matched formulas F; this complements related results of Kullmann (IEEE Conference on Computational Complexity, pp. 116–124, 2000) and Szeider (J. Comput. Syst. Sci. 69(4):656–674, 2004) for MaxSat parameterized by δ#N#                ∗(F). To obtain our main result, we reduce (ν(F)+k)-SAT into the following parameterization of the Hitting Set problem (denoted by (m−k)-Hitting Set): given a collection #N#                  #N#                    #N#                  #N#                  $\mathcal{C}$#N#                 of m subsets of a ground set U of n elements, decide whether there is X⊆U such that C∩X≠∅ for each #N#                  #N#                    #N#                  #N#                  $C\in \mathcal{C}$#N#                 and |X|≤m−k, where k is the parameter. Gutin, Jones and Yeo (Theor. Comput. Sci. 412(41):5744–5751, 2011) proved that (m−k)-Hitting Set is fixed-parameter tractable by obtaining an exponential kernel for the problem. We obtain two algorithms for (m−k)-Hitting Set: a deterministic algorithm of runtime #N#                  #N#                    #N#                  #N#                  $O((2e)^{2k+O(\log^{2} k)} (m+n)^{O(1)})$#N#                 and a randomized algorithm of expected runtime #N#                  #N#                    #N#                  #N#                  $O(8^{k+O(\sqrt{k})} (m+n)^{O(1)})$#N#                . Our deterministic algorithm improves an algorithm that follows from the kernelization result of Gutin, Jones and Yeo (Theor. Comput. Sci. 412(41):5744–5751, 2011).

Includes members:
  Member "a new bound for 3 satisfiable maxsat and its algorithmic application":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constraint satisfaction problems parameterized above or below tight bounds a survey")
  Member "kernels for below upper bound parameterizations of the hitting set and directed dominating set problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "alternative parameterizations of metric dimension")
  Member "a new lower bound on the maximum number of satisfied clauses in max sat and its algorithmic application":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterizations of test cover with bounded test sizes")
  Member "solving max r sat above a tight lower bound":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "domination above r independence does sparseness help")

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)