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 "reconfiguration on sparse graphs"):
  Abstract: A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two feasible solutions S and T of size k, whether it is possible to transform S into T by a sequence of vertex additions and deletions such that each intermediate set is also a feasible solution of size bounded by k. We study reconfiguration variants of two classical vertex-subset problems, namely Independent Set and Dominating Set. We denote the former by ISR and the latter by DSR. Both ISR and DSR are PSPACE-complete on graphs of bounded bandwidth and W[1]-hard parameterized by k on general graphs. We show that ISR is fixed-parameter tractable parameterized by k when the input graph is of bounded degeneracy or nowhere-dense. As a corollary, we answer positively an open question concerning the parameterized complexity of the problem on graphs of bounded treewidth. Moreover, our techniques generalize recent results showing that ISR is fixed-parameter tractable on planar graphs and graphs of bounded degree. For DSR, we show the problem fixed-parameter tractable parameterized by k when the input graph does not contain large bicliques, a class of graphs which includes graphs of bounded degeneracy and nowhere-dense graphs.

Includes members:
  Member "reconfiguration on nowhere dense graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the parameterized complexity of reconfiguration of connected dominating sets")
  Member "token jumping in minor closed classes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dominating sets reconfiguration under token sliding")
  Member "polynomial kernels and wideness properties of nowhere dense graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a general kernelization technique for domination and independence problems in sparse classes")
  Member "faster online matrix vector multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "vertex cover reconfiguration and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decremental optimization of dominating sets under reachability constraints")
  Member "reconfiguration over tree decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "shortest reconfiguration sequence for sliding tokens on spiders")
  Member "finding shortest paths between graph colourings":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "shortest reconfiguration of perfect matchings via alternating cycles")
  Member "reconfiguration in bounded bandwidth and treedepth":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "independent set reconfiguration thresholds of hereditary graph classes")

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)