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 "parameterizations of test cover with bounded test sizes"):
  Abstract: In the {\sc Test Cover} problem we are given a hypergraph $H=(V, \mathcal{E})$ with $|V|=n, |\mathcal{E}|=m$, and we assume that $\mathcal{E}$ is a test cover, i.e. for every pair of vertices $x_i, x_j$, there exists an edge $e \in \mathcal{E}$ such that $|{x_i,x_j}\cap e|=1$. The objective is to find a minimum subset of $\mathcal{E}$ which is a test cover. The problem is used for identification across many areas, and is NP-complete. From a parameterized complexity standpoint, many natural parameterizations of {\sc Test Cover} are either $W[1]$-complete or have no polynomial kernel unless $coNP\subseteq NP/poly$, and thus are unlikely to be solveable efficiently. #R##N#However, in practice the size of the edges is often bounded. In this paper we study the parameterized complexity of {\sc Test-$r$-Cover}, the restriction of {\sc Test Cover} in which each edge contains at most $r \ge 2$ vertices. In contrast to the unbounded case, we show that the following below-bound parameterizations of {\sc Test-$r$-Cover} are fixed-parameter tractable with a polynomial kernel: (1) Decide whether there exists a test cover of size $n-k$, and (2) decide whether there exists a test cover of size $m-k$, where $k$ is the parameter. In addition, we prove a new lower bound $\lceil \frac{2(n-1)}{r+1} \rceil$ on the minimum size of a test cover when the size of each edge is bounded by $r$. {\sc Test-$r$-Cover} parameterized above this bound is unlikely to be fixed-parameter tractable; in fact, we show that it is para-NP-complete, as it is NP-hard to decide whether an instance of {\sc Test-$r$-Cover} has a test cover of size exactly $\frac{2(n-1)}{r+1}$.

Includes members:
  Member "non existence of polynomial kernels for the test cover problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fixed parameter tractable algorithms for tracking shortest paths")
  Member "parameterized study of the test cover problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fixed parameter tractable algorithms for tracking shortest paths")
  Member "max cut parameterized above the edwards erd h o s bound":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized tsp beating the average")
  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-4 (induced by source paper "fixed parameter tractability of satisfying beyond the number of variables")
  Member "betweenness parameterized above tight lower bound":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "satisfiability of ordering csps above average")
  Member "solving max r sat above a tight lower bound":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)