human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "satisfiability of ordering csps above average"):
  with members:
    - "analysis of boolean functions"
    - "local search is better than random assignment for bounded occurrence ordering k csps"
    - "simultaneously satisfying linear equations over mathbb f _2 maxlin2 and max r lin2 parameterized above average"
    - "constraint satisfaction problems parameterized above or below tight bounds a survey"
    - "parameterized complexity of maxsat above average"
    - "all ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables"
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-2 (induced by source paper "large independent sets in triangle free planar graphs"):
  with members:
    - "max cut parameterized above the edwards erd h o s bound"
    - "on multiway cut parameterized above lower bounds"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-3 (induced by source paper "parameterizations of test cover with bounded test sizes"):
  with members:
    - "non existence of polynomial kernels for the test cover problem"
    - "parameterized study of the test cover problem"
    - "max cut parameterized above the edwards erd h o s bound"
    - "a new lower bound on the maximum number of satisfied clauses in max sat and its algorithmic application"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-4 (induced by source paper "directed acyclic subgraph problem parameterized above the poljak turzik bound"):
  with members:
    - "slightly superexponential parameterized problems"
    - "on multiway cut parameterized above lower bounds"
    - "all ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables"
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-5 (induced by source paper "constraint satisfaction problems parameterized above or below tight bounds a survey"):
  with members:
    - "simultaneously satisfying linear equations over mathbb f _2 maxlin2 and max r lin2 parameterized above average"
    - "hypercontractive inequality for pseudo boolean functions of bounded fourier width"
    - "a new bound for 3 satisfiable maxsat and its algorithmic application"
    - "parameterized complexity of maxsat above average"
    - "on multiway cut parameterized above lower bounds"
    - "improved parameterized algorithms for constraint satisfaction"
    - "a new lower bound on the maximum number of satisfied clauses in max sat and its algorithmic application"
    - "a probabilistic approach to problems parameterized above or below tight bounds"

Connected through hyperedge HE-6 (induced by source paper "note on maximal bisection above tight lower bound"):
  with members:
    - "vertex cover problem parameterized above and below tight bounds"
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "solving max r sat above a tight lower bound"
    - "note on max lin 2 above average"
    - "kernel s for problems with no kernel on out trees with many leaves"
    - "fixed parameter complexity of minimum profile problems"
    - "the linear arrangement problem parameterized above guaranteed value"

Connected through hyperedge HE-7 (induced by source paper "all ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables"):
  with members:
    - "vertex cover problem parameterized above and below tight bounds"
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "solving max r sat above a tight lower bound"
    - "note on max lin 2 above average"
    - "fixed parameter complexity of minimum profile problems"
    - "the linear arrangement problem parameterized above guaranteed value"

Connected through hyperedge HE-8 (induced by source paper "kernels for below upper bound parameterizations of the hitting set and directed dominating set problems"):
  with members:
    - "vertex cover problem parameterized above and below tight bounds"
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "almost 2 sat is fixed parameter tractable"

Question: Please tell me which class the center node 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)