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 "on the kernelization of ranking r csp in tournaments"):
  Abstract: A Ranking r-Constraint Satisfaction Problem (ranking r-CSP) consists of a ground set of vertices V, an arity r > 2, a parameter k and a constraint system c, where c is a function which maps rankings of r-sized subsets of V to {0,1}. The objective is to decide if there exists a ranking of the vertices satisfying all but at most k constraints. Famous ranking r-CSP include the Feedback Arc Set in Tournaments and Betweenness in Tournaments problems. We consider these problems from the kernelization viewpoint. We prove that so-called l_r-simply characterized ranking r-CSP admit linear vertex-kernels whenever they admit constant-factor approximation algorithms. This implies that r-Betweenness in Tournaments and r-Transitive Feedback Arc Set In Tournaments admit linear vertex-kernels. Finally, we consider another generalization of Feedback Arc Set in Tournaments, which does not fit the aforementioned framework. We obtain a constant-factor approximation and a linear vertex-kernel for this problem.

Includes members:
  Member "polynomial kernels for proper interval completion and related problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "subexponential parameterized algorithms and kernelization on almost chordal graphs")
  Member "on the non existence of polynomial kernels for p l free edge modification problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "faster and enhanced inclusion minimal cograph completion")
  Member "faster algorithms for feedback arc set tournament kemeny rank aggregation and betweenness tournament":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterizing edge modification problems above lower bounds")
  Member "cross composition a new technique for kernelization lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parameterized coloring problems on threshold graphs")
  Member "approximation schemes for the betweenness problem in tournaments and related ranking problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "limits of csp problems and efficient parameter testing")

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