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 "betweenness parameterized above tight lower bound"):
  Abstract: We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the {\sc Betweenness} problem parameterized above its tight lower bound, which is stated as follows. For a set $V$ of variables and set $\mathcal C$ of constraints "$v_i$ \mbox{is between} $v_j$ \mbox{and} $v_k$", decide whether there is a bijection from $V$ to the set $\{1,\ldots,|V|\}$ satisfying at least $|\mathcal C|/3 + \kappa$ of the constraints in $\mathcal C$. Our result solves an open problem attributed to Benny Chor in Niedermeier's monograph "Invitation to Fixed-Parameter Algorithms." The betweenness problem is of interest in molecular biology. An approach developed in this paper can be used to determine parameterized complexity of a number of other optimization problems on permutations parameterized above or below tight bounds.

Includes members:
  Member "all ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "domination above r independence does sparseness help")
  Member "a probabilistic approach to problems parameterized above or below tight bounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hamiltonicity below dirac s condition")
  Member "approximation schemes for the betweenness problem in tournaments and related ranking problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "limits of csp problems and efficient parameter testing")
  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")
  Member "note on max lin 2 above average":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "constraint satisfaction problems parameterized above or below tight bounds a survey")
  Member "fixed parameter complexity of minimum profile problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parameterized and approximation algorithms for the load coloring problem")
  Member "the linear arrangement problem parameterized above guaranteed value":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multidimensional binary vector assignment problem standard structural and above guarantee parameterizations")

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)