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: "all ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables"
  Abstract: A ternary Permutation-CSP is specified by a subset $\Pi$ of the symmetric group $\mathcal S_3$. An instance of such a problem consists of a set of variables $V$ and a multiset of constraints, which are ordered triples of distinct variables of $V.$ The objective is to find a linear ordering $\alpha$ of $V$ that maximizes the number of triples whose ordering (under $\alpha$) follows a permutation in $\Pi$. We prove that all ternary Permutation-CSPs parameterized above average have kernels with quadratic numbers of variables.

Connected through hyperedge HE-1 (induced by source paper "domination above r independence does sparseness help"):
  with members:
    - "neighborhood complexity and kernelization for nowhere dense classes of graphs"
    - "kernelization and sparseness the case of dominating set"
    - "faster parameterized algorithms using linear programming"
    - "testing first order properties for subclasses of sparse graphs"
    - "vertex cover problem parameterized above and below tight bounds"
    - "solving max r sat above a tight lower bound"
    - "linear time algorithms for finding a dominating set of fixed size in degenerated graphs"
    - "polynomial time data reduction for dominating set"

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"
    - "betweenness parameterized above tight lower bound"
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-3 (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"
    - "known algorithms on graphs of bounded treewidth are probably optimal"
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "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"
    - "betweenness parameterized above tight lower bound"
    - "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 "on multiway cut parameterized above lower bounds"):
  with members:
    - "large isolating cuts shrink the multiway cut"
    - "multicut is fpt"
    - "fixed parameter tractability of multicut parameterized by the size of the cutset"
    - "computing multiway cut within the given excess over the largest minimum isolating cut"
    - "vertex cover problem parameterized above and below tight bounds"
    - "almost 2 sat is fixed parameter tractable"

Connected through hyperedge HE-6 (induced by source paper "simultaneously satisfying linear equations over mathbb f _2 maxlin2 and max r lin2 parameterized above average"):
  with members:
    - "hitting forbidden minors approximation and kernelization"
    - "improved parameterized algorithms for constraint satisfaction"
    - "cross composition a new technique for kernelization lower bounds"
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "note on max lin 2 above average"

Connected through hyperedge HE-7 (induced by source paper "hypercontractive inequality for pseudo boolean functions of bounded fourier width"):
  with members:
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-8 (induced by source paper "improved parameterized algorithms for constraint satisfaction"):
  with members:
    - "spectral algorithms for unique games"
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "solving max r sat above a tight lower bound"

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)