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: "systems of linear equations over mathbb f _2 and problems parameterized above average"
  Abstract: In the problem Max Lin, we are given a system $Az=b$ of $m$ linear equations with $n$ variables over $\mathbb{F}_2$ in which each equation is assigned a positive weight and we wish to find an assignment of values to the variables that maximizes the excess, which is the total weight of satisfied equations minus the total weight of falsified equations. Using an algebraic approach, we obtain a lower bound for the maximum excess. #R##N#Max Lin Above Average (Max Lin AA) is a parameterized version of Max Lin introduced by Mahajan et al. (Proc. IWPEC'06 and J. Comput. Syst. Sci. 75, 2009). In Max Lin AA all weights are integral and we are to decide whether the maximum excess is at least $k$, where $k$ is the parameter. #R##N#It is not hard to see that we may assume that no two equations in $Az=b$ have the same left-hand side and $n={\rm rank A}$. Using our maximum excess results, we prove that, under these assumptions, Max Lin AA is fixed-parameter tractable for a wide special case: $m\le 2^{p(n)}$ for an arbitrary fixed function $p(n)=o(n)$. #R##N#Max $r$-Lin AA is a special case of Max Lin AA, where each equation has at most $r$ variables. In Max Exact $r$-SAT AA we are given a multiset of $m$ clauses on $n$ variables such that each clause has $r$ variables and asked whether there is a truth assignment to the $n$ variables that satisfies at least $(1-2^{-r})m + k2^{-r}$ clauses. Using our maximum excess results, we prove that for each fixed $r\ge 2$, Max $r$-Lin AA and Max Exact $r$-SAT AA can be solved in time $2^{O(k \log k)}+m^{O(1)}.$ This improves $2^{O(k^2)}+m^{O(1)}$-time algorithms for the two problems obtained by Gutin et al. (IWPEC 2009) and Alon et al. (SODA 2010), respectively.

Connected through hyperedge HE-1 (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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "a probabilistic approach to problems parameterized above or below tight bounds"):
  with members:
    - "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"
    - "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-3 (induced by source paper "solving max r sat above a tight lower bound"):
  with members:
    - "betweenness parameterized above tight lower bound"
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "a new upper bound for max 2 sat a graph theoretic approach"
    - "fixed parameter complexity of minimum profile problems"
    - "the linear arrangement problem parameterized above guaranteed value"

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.DM(Discrete Mathematics)