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: "a probabilistic approach to problems parameterized above or below tight bounds"
  Abstract: We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds. To illustrate the approach we consider three problems of this type of unknown complexity that were introduced by Mahajan, Raman and Sikdar (J. Comput. Syst. Sci. 75, 2009). We show that a generalization of one of the problems and non-trivial special cases of the other two are fixed-parameter tractable.

Connected through hyperedge HE-1 (induced by source paper "hamiltonicity below dirac s condition"):
  with members:
    - "finding detours is fixed parameter tractable"
    - "determinant sums for undirected hamiltonicity"
    - "vertex cover problem parameterized above and below tight bounds"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-2 (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"
    - "betweenness parameterized above tight lower bound"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-3 (induced by source paper "parameterized algorithms for constraint satisfaction problems above average with global cardinality constraints"):
  with members:
    - "analysis of boolean functions"
    - "hypercontractivity sum of squares proofs and their applications"
    - "better balance by being biased a 0 8776 approximation for max bisection"
    - "approximating csps with global cardinality constraints using sdp hierarchies"
    - "note on maximal bisection above tight lower bound"
    - "reductions between expansion problems"
    - "solving max r sat above a tight lower bound"
    - "approximation resistant predicates from pairwise independence"

Connected through hyperedge HE-4 (induced by source paper "parameterized study of the test cover problem"):
  with members:
    - "simultaneously satisfying linear equations over mathbb f _2 maxlin2 and max r lin2 parameterized above average"
    - "kernels for below upper bound parameterizations of the hitting set and directed dominating set problems"
    - "all ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables"
    - "known algorithms on graphs of bounded treewidth are probably optimal"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-5 (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"
    - "betweenness parameterized above tight lower bound"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-6 (induced by source paper "confronting intractability via parameters"):
  with members:
    - "slightly superexponential parameterized problems"
    - "bidimensionality and kernels"
    - "how good is the chord algorithm"
    - "minimizing movement fixed parameter tractability"
    - "dynamic programming for graphs on surfaces"
    - "courcelle s theorem a game theoretic approach"
    - "preprocessing for treewidth a combinatorial analysis through kernelization"
    - "solving connectivity problems parameterized by treewidth in single exponential time"

Connected through hyperedge HE-7 (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"
    - "betweenness parameterized above tight lower bound"

Connected through hyperedge HE-8 (induced by source paper "parameterized complexity of maxsat above average"):
  with members:
    - "faster parameterized algorithms using linear programming"
    - "simultaneously satisfying linear equations over mathbb f _2 maxlin2 and max r lin2 parameterized above average"
    - "a new bound for 3 satisfiable maxsat and its algorithmic application"
    - "on multiway cut parameterized above lower bounds"
    - "systems of linear equations over mathbb f _2 and problems parameterized above average"
    - "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"
    - "note on max lin 2 above average"

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)