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: "a new bound for 3 satisfiable maxsat and its algorithmic application"
  Abstract: Let F be a CNF formula with n variables and m clauses. F is 3-satisfiable if for any 3 clauses in F, there is a truth assignment which satisfies all of them. Lieberherr and Specker (1982) and, later, Yannakakis (1994) proved that in each 3-satisfiable CNF formula at least 2/3 of its clauses can be satisfied by a truth assignment. We improve this result by showing that every 3-satisfiable CNF formula F contains a subset of variables U, such that some truth assignment $\tau$ will satisfy at least $2m/3+ m_U/3+\rho n'$ clauses, where m is the number of clauses of F, m_U is the number of clauses of F containing a variable from U, n' is the total number of variables in clauses not containing a variable in U, and \rho is a positive absolute constant. Both U and $\tau$ can be found in polynomial time. We use our result to show that the following parameterized problem is fixed-parameter tractable and, moreover, has a kernel with a linear number of variables. In 3-S-MAXSAT-AE, we are given a 3-satisfiable CNF formula F with m clauses and asked to determine whether there is an assignment which satisfies at least 2m/3 + k clauses, where k is the parameter.

Connected through hyperedge HE-1 (induced by source paper "fixed parameter tractability of satisfying beyond the number of variables"):
  with members:
    - "kernels for below upper bound parameterizations of the hitting set and directed dominating set problems"
    - "a new lower bound on the maximum number of satisfied clauses in max sat and its algorithmic application"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-2 (induced by source paper "constraint satisfaction problems parameterized above or below tight bounds a survey"):
  with members:
    - "simultaneously satisfying linear equations over mathbb f _2 maxlin2 and max r lin2 parameterized above average"
    - "hypercontractive inequality for pseudo boolean functions of bounded fourier width"
    - "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-3 (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"
    - "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.DM(Discrete Mathematics)