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: "kernels for feedback arc set in tournaments"
  Abstract: A tournament T=(V,A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Feedback Arc Set problem asks whether the given digraph has a set of k arcs whose removal results in an acyclic digraph. The Feedback Arc Set problem restricted to tournaments is known as the k-Feedback Arc Set in Tournaments (k-FAST) problem. In this paper we obtain a linear vertex kernel for k-FAST. That is, we give a polynomial time algorithm which given an input instance T to k-FAST obtains an equivalent instance T' on O(k) vertices. In fact, given any fixed e>0, the kernelized instance has at most (2+e)k vertices. Our result improves the previous known bound of O(k^2) on the kernel size for k-FAST. Our kernelization algorithm solves the problem on a subclass of tournaments in polynomial time and uses a known polynomial time approximation scheme for k-FAST.

Connected through hyperedge HE-1 (induced by source paper "parameterizing edge modification problems above lower bounds"):
  with members:
    - "parameterized lower bounds and dichotomy results for the np completeness of h free edge modification problems"
    - "raising the bar for vertex cover fixed parameter tractability above a higher guarantee"
    - "towards optimal and expressive kernelization for d hitting set"
    - "subexponential parameterized algorithm for computing the cutwidth of a semi complete digraph"
    - "faster parameterized algorithms using linear programming"
    - "subexponential fixed parameter tractability of cluster editing"
    - "on multiway cut parameterized above lower bounds"
    - "on the non existence of polynomial kernels for p l free edge modification problems"

Connected through hyperedge HE-2 (induced by source paper "the parameterized complexity of packing arc disjoint cycles in tournaments"):
  with members:
    - "triangle packing in sparse tournaments approximation and kernelization"
    - "strong immersion is a well quasi ordering for semi complete digraphs"
    - "faster algorithms for feedback arc set tournament kemeny rank aggregation and betweenness tournament"

Connected through hyperedge HE-3 (induced by source paper "efficient algorithms for measuring the funnel likeness of dags"):
  with members:
    - "directed subset feedback vertex set is fixed parameter tractable"
    - "feedback vertex set in mixed graphs"

Connected through hyperedge HE-4 (induced by source paper "sparsification upper and lower bounds for graph problems and not all equal sat"):
  with members:
    - "optimal sparsification for some binary csps using low degree polynomials"
    - "tight kernel bounds for problems on graphs with small degeneracy"
    - "data reduction for graph coloring problems"
    - "on sparsification for computing treewidth"
    - "kernelization lower bounds by cross composition"
    - "kernelization of packing problems"
    - "kernel bounds for path and cycle problems"
    - "co nondeterminism in compositions a kernelization lower bound for a ramsey type problem"

Connected through hyperedge HE-5 (induced by source paper "compression via matroids a randomized polynomial kernel for odd cycle transversal"):
  with members:
    - "bidimensionality and kernels"
    - "faster parameterized algorithms using linear programming"
    - "representative sets and irrelevant vertices new tools for kernelization"
    - "minimum k way cut of bounded size is fixed parameter tractable"
    - "clique cover and graph separation new incompressibility results"
    - "fixed parameter tractability of directed multiway cut parameterized by the size of the cutset"
    - "multicut is fpt"
    - "fixed parameter tractability of multicut parameterized by the size of the cutset"

Connected through hyperedge HE-6 (induced by source paper "jungles bundles and fixed parameter tractability"):
  with members:
    - "bidimensionality and kernels"
    - "the rank width of edge coloured graphs"
    - "designing fpt algorithms for cut problems using randomized contractions"
    - "bidimensionality and eptas"
    - "finding topological subgraphs is fixed parameter tractable"
    - "are there any good digraph width measures"
    - "computing crossing numbers in quadratic time"

Connected through hyperedge HE-7 (induced by source paper "conflict packing an unifying technique to obtain polynomial kernels for editing problems on dense instances"):
  with members:
    - "polynomial kernels for proper interval completion and related problems"
    - "cross composition a new technique for kernelization lower bounds"

Connected through hyperedge HE-8 (induced by source paper "faster algorithms for feedback arc set tournament kemeny rank aggregation and betweenness tournament"):
  with members:
    - "fixed parameter algorithms for computing kemeny scores theory and practice"
    - "approximation schemes for the betweenness problem in tournaments and related ranking problems"
    - "faster fast feedback arc set in tournaments"
    - "noisy sorting without resampling"
    - "learning to order things"

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)