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 "editing to a planar graph of given degrees"):
  Abstract: We consider the following graph modification problem. Let the input consist of a graph $G=(V,E)$, a weight function $w\colon V\cup E\rightarrow \mathbb{N}$, a cost function $c\colon V\cup E\rightarrow \mathbb{N}$ and a degree function $\delta\colon V\rightarrow \mathbb{N}_0$, together with three integers $k_v, k_e$ and $C$. The question is whether we can delete a set of vertices of total weight at most $k_v$ and a set of edges of total weight at most $k_e$ so that the total cost of the deleted elements is at most $C$ and every non-deleted vertex $v$ has degree $\delta(v)$ in the resulting graph $G'$. We also consider the variant in which $G'$ must be connected. Both problems are known to be NP-complete and W[1]-hard when parameterized by $k_v+k_e$. We prove that, when restricted to planar graphs, they stay NP-complete but have polynomial kernels when parameterized by $k_v+k_e$.

Includes members:
  Member "graph editing problems with extended regularity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fixed parameter tractable distances to sparse graph classes")
  Member "win win kernelization for degree sequence completion problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "graph editing to a given degree sequence")
  Member "editing to eulerian graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph editing to a given degree sequence")
  Member "a linear kernel for planar red blue dominating set":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "balanced independent and dominating sets on colored interval graphs")
  Member "editing to a connected graph of given degrees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "building large k cores from sparse graphs")
  Member "explicit linear kernels via dynamic programming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a complexity dichotomy for hitting connected minors on bounded treewidth graphs the chair and the banner draw the boundary")
  Member "editing to a graph of given degrees":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "building large k cores from sparse graphs")
  Member "linear kernels and single exponential algorithms via protrusion decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hitting topological minors is fpt")

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)