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: "solving max r sat above a tight lower bound"
  Abstract: We present an exact algorithm that decides, for every fixed $r \geq 2$ in time $O(m) + 2^{O(k^2)}$ whether a given multiset of $m$ clauses of size $r$ admits a truth assignment that satisfies at least $((2^r-1)m+k)/2^r$ clauses. Thus \textsc{Max-$r$-Sat} is fixed-parameter tractable when parameterized by the number of satisfied clauses above the tight lower bound $(1-2^{-r})m$. This solves an open problem of Mahajan et al. (J. Comput. System Sci., 75, 2009). #R##N#Our algorithm is based on a polynomial-time data reduction procedure that reduces a problem instance to an equivalent algebraically represented problem with $O(k^2)$ variables. This is done by representing the instance as an appropriate polynomial, and by applying a probabilistic argument combined with some simple tools from Harmonic analysis to show that if the polynomial cannot be reduced to one of size $O(k^2)$, then there is a truth assignment satisfying the required number of clauses. #R##N#We introduce a new notion of bikernelization from a parameterized problem to another one and apply it to prove that the above-mentioned parameterized \textsc{Max-$r$-Sat} admits a polynomial-size kernel. #R##N#Combining another probabilistic argument with tools from graph matching theory and signed graphs, we show that if an instance of \textsc{Max-2-Sat} with $m$ clauses has at least $3k$ variables after application of certain polynomial time reduction rules to it, then there is a truth assignment that satisfies at least $(3m+k)/4$ clauses. #R##N#We also outline how the fixed-parameter tractability and polynomial-size kernel results on \textsc{Max-$r$-Sat} can be extended to more general families of Boolean Constraint Satisfaction Problems.

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"
    - "all ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables"
    - "vertex cover problem parameterized above and below tight bounds"
    - "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 "going far from degeneracy"):
  with members:
    - "faster deterministic parameterized algorithm for k path"
    - "raising the bar for vertex cover fixed parameter tractability above a higher guarantee"
    - "a randomized algorithm for long directed cycle"
    - "polynomial kernels for lambda extendible properties parameterized above the poljak turz ik bound"
    - "faster parameterized algorithms using linear programming"
    - "narrow sieves for parameterized paths and packings"
    - "vertex cover problem parameterized above and below tight bounds"

Connected through hyperedge HE-3 (induced by source paper "parameterized pre coloring extension and list coloring problems"):
  with members:
    - "the set cover conjecture and subgraph isomorphism with a tree pattern"
    - "on problems as hard as cnf sat"
    - "sparsification upper and lower bounds for graph problems and not all equal sat"
    - "abusing the tutte matrix an algebraic instance compression for the k set cycle problem"
    - "kernel bounds for path and cycle problems"

Connected through hyperedge HE-4 (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"
    - "a probabilistic approach to problems parameterized above or below tight bounds"

Connected through hyperedge HE-5 (induced by source paper "alternative parameterizations of metric dimension"):
  with members:
    - "identification location domination and metric dimension on interval and permutation graphs ii algorithms and complexity"
    - "a polynomial turing kernel for weighted independent set in bull free graphs"
    - "metric dimension of bounded tree length graphs"
    - "metric dimension parameterized by max leaf number"
    - "characterizing the easy to find subgraphs from the viewpoint of polynomial time algorithms kernels and turing kernels"
    - "metric dimension for gabriel unit disk graphs is np complete"
    - "kernelization lower bounds by cross composition"
    - "non existence of polynomial kernels for the test cover problem"

Connected through hyperedge HE-6 (induced by source paper "parameterized aspects of strong subgraph closure"):
  with members:
    - "on the relation of strong triadic closure and cluster deletion"
    - "maximizing the strong triadic closure in split graphs and proper interval graphs"
    - "romantic partnerships and the dispersion of social ties a network analysis of relationship status on facebook"
    - "kernelization lower bounds by cross composition"
    - "designing fpt algorithms for cut problems using randomized contractions"

Connected through hyperedge HE-7 (induced by source paper "parameterized complexity and approximation issues for the colorful components problems"):
  with members:
    - "algorithmic and hardness results for the colorful components problems"
    - "mathematical foundations of computer science 2012"

Connected through hyperedge HE-8 (induced by source paper "feedback vertex set inspired kernel for chordal vertex deletion"):
  with members:
    - "polylogarithmic approximation algorithms for weighted mathcal f deletion problems"
    - "turing kernelization for finding long paths and cycles in restricted graph classes"
    - "approximation and kernelization for chordal vertex deletion"
    - "bidimensionality and kernels"
    - "unit interval vertex deletion fewer vertices are relevant"
    - "uniform kernelization complexity of hitting forbidden minors"
    - "linear recognition of almost interval graphs"
    - "chordal editing is fixed parameter tractable"

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)