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: "simultaneously satisfying linear equations over mathbb f _2 maxlin2 and max r lin2 parameterized above average"
  Abstract: In the parameterized problem \textsc{MaxLin2-AA}[$k$], we are given a system with variables $x_1,...,x_n$ consisting of equations of the form $\prod_{i \in I}x_i = b$, where $x_i,b \in \{-1, 1\}$ and $I\subseteq [n],$ each equation has a positive integral weight, and we are to decide whether it is possible to simultaneously satisfy equations of total weight at least $W/2+k$, where $W$ is the total weight of all equations and $k$ is the parameter (if $k=0$, the possibility is assured). We show that \textsc{MaxLin2-AA}[$k$] has a kernel with at most $O(k^2\log k)$ variables and can be solved in time $2^{O(k\log k)}(nm)^{O(1)}$. This solves an open problem of Mahajan et al. (2006). #R##N#The problem \textsc{Max-$r$-Lin2-AA}[$k,r$] is the same as \textsc{MaxLin2-AA}[$k$] with two differences: each equation has at most $r$ variables and $r$ is the second parameter. We prove a theorem on \textsc{Max-$r$-Lin2-AA}[$k,r$] which implies that \textsc{Max-$r$-Lin2-AA}[$k,r$] has a kernel with at most $(2k-1)r$ variables improving a number of results including one by Kim and Williams (2010). The theorem also implies a lower bound on the maximum of a function $f:\ \{-1,1\}^n \rightarrow \mathbb{R}$ of degree $r$. We show applicability of the lower bound by giving a new proof of the Edwards-Erd{\H o}s bound (each connected graph on $n$ vertices and $m$ edges has a bipartite subgraph with at least $m/2 + (n-1)/4$ edges) and obtaining a generalization.

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"
    - "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"
    - "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 "parameterized study of the test cover problem"):
  with members:
    - "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"
    - "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 "maximum balanced subgraph problem parameterized above lower bound"):
  with members:
    - "beyond max cut lambda extendible properties parameterized above the poljak turz i k bound"
    - "directed acyclic subgraph problem parameterized above the poljak turzik bound"
    - "max cut parameterized above the edwards erd h o s bound"
    - "note on maximal bisection above tight lower bound"

Connected through hyperedge HE-4 (induced by source paper "constraint satisfaction problems parameterized above or below tight bounds a survey"):
  with members:
    - "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"
    - "a probabilistic approach to problems parameterized above or below tight bounds"

Connected through hyperedge HE-5 (induced by source paper "parameterized complexity of maxsat above average"):
  with members:
    - "faster parameterized algorithms using linear programming"
    - "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"
    - "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"

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)