human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "note on max lin 2 above average"):
  Abstract: In the Max Lin-2 problem we are given a system $S$ of $m$ linear equations in $n$ variables over $\mathbb{F}_2$ in which Equation $j$ is assigned a positive integral weight $w_j$ for each $j$. We wish to find an assignment of values to the variables which maximizes the total weight of satisfied equations. This problem generalizes Max Cut. The expected weight of satisfied equations is $W/2$, where $W=w_1+... +w_m$; $W/2$ is a tight lower bound on the optimal solution of Max Lin-2. #R##N#Mahajan et al. (J. Comput. Syst. Sci. 75, 2009) stated the following parameterized version of Max Lin-2: decide whether there is an assignment of values to the variables that satisfies equations of total weight at least $W/2+k$, where $k$ is the parameter. They asked whether this parameterized problem is fixed-parameter tractable, i.e., can be solved in time $f(k)(nm)^{O(1)}$, where $f(k)$ is an arbitrary computable function in $k$ only. Their question remains open, but using some probabilistic inequalities and, in one case, a Fourier analysis inequality, Gutin et al. (IWPEC 2009) proved that the problem is fixed-parameter tractable in three special cases. #R##N#In this paper we significantly extend two of the three special cases using only tools from combinatorics. We show that one of our results can be used to obtain a combinatorial proof that another problem from Mahajan et al. (J. Comput. Syst. Sci. 75, 2009), Max $r$-SAT above the Average, is fixed-parameter tractable for each $r\ge 2.$ Note that Max $r$-SAT above the Average has been already shown to be fixed-parameter tractable by Alon et al. (SODA 2010), but the paper used the approach of Gutin et al. (IWPEC 2009).

Includes members:
  Member "a probabilistic approach to problems parameterized above or below tight bounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hamiltonicity below dirac s condition")
  Member "solving max r sat above a tight lower bound":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "domination above r independence does sparseness help")
  Member "fixed parameter complexity of minimum profile problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized and approximation algorithms for the load coloring problem")
  Member "the linear arrangement problem parameterized above guaranteed value":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multidimensional binary vector assignment problem standard structural and above guarantee parameterizations")

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