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 problems with extended regularity constraints"):
  Abstract: Graph editing problems offer an interesting perspective on sub- and supergraph identification problems for a large variety of target properties. They have also attracted significant attention in recent years, particularly in the area of parameterized complexity as the problems have rich parameter ecologies. #R##N#In this paper we examine generalisations of the notion of editing a graph to obtain a regular subgraph. In particular we extend the notion of regularity to include two variants of edge-regularity along with the unifying constraint of strong regularity. We present a number of results, with the central observation that these problems retain the general complexity profile of their regularity-based inspiration: when the number of edits $k$ and the maximum degree $r$ are taken together as a combined parameter, the problems are tractable (i.e. in \FPT{}), but are otherwise intractable. #R##N#We also examine variants of the basic editing to obtain a regular subgraph problem from the perspective of parameterizing by the treewidth of the input graph. In this case the treewidth of the input graph essentially becomes a limiting parameter on the natural $k+r$ parameterization.

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 to a given degree sequence")
  Member "fixed parameter tractable distances to sparse graph classes":
    also connected through other hyperedges:
      (none)
  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 a connected graph of given degrees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "building large k cores from sparse graphs")
  Member "a generalization of nemhauser and trotter s local optimization theorem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "linear kernels for separating a graph into components of bounded size")
  Member "deciding first order properties of locally tree decomposable structures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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.CC(Computational Complexity)