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 "graph editing to a given degree sequence"):
  Abstract: We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence, where the aim is to obtain a graph with a given degree sequence \sigma by at most k vertex or edge deletions and edge additions. We show that the problem is W[1]-hard when parameterized by k for any combination of the allowed editing operations. From the positive side, we show that the problem can be solved in time 2^{O(k(\Delta+k)^2)}n^2 log n for n-vertex graphs, where \Delta=max \sigma, i.e., the problem is FPT when parameterized by k+\Delta. We also show that Editing to a Graph with a Given Degree Sequence has a polynomial kernel when parameterized by k+\Delta if only edge additions are allowed, and there is no polynomial kernel unless NP\subseteq coNP/poly for all other combinations of allowed editing operations.

Includes members:
  Member "editing to a planar graph of given degrees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "graph editing problems with extended regularity constraints")
  Member "win win kernelization for degree sequence completion problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a parameterized algorithmics framework for degree sequence completion problems in directed graphs")
  Member "editing to eulerian graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "editing to a planar graph of given degrees")
  Member "editing to a connected graph of given degrees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "building large k cores from sparse graphs")
  Member "editing to a graph of given degrees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "building large k cores from sparse graphs")
  Member "kernelization lower bounds by cross composition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "subexponential parameterized algorithms and kernelization on almost chordal graphs")

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)