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 "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity"):
  Abstract: This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity. A classical theorem of Courcelle states that any graph property definable in MSO is decidable in linear time on graphs of bounded treewidth. Algorithmic metatheorems like Courcelle's serve to generalize known positive results on various graph classes. We explore and extend three previously studied MSO extensions: global and local cardinality constraints (CardMSO and MSO-LCC) and optimizing a fair objective function (fairMSO). First, we show how these fragments relate to each other in expressive power and highlight their (non)linearity. On the side of neighborhood diversity, we show that combining the linear variants of local and global cardinality constraints is possible while keeping the linear runtime but removing linearity of either makes this impossible, and we provide a polynomial time algorithm for the hard case. Furthemore, we show that even the combination of the two most powerful fragments is solvable in polynomial time on graphs of bounded treewidth.

Includes members:
  Member "parameterized complexity of fair deletion problems":
    also connected through other hyperedges:
      (none)
  Member "the graph motif problem parameterized by the structure of the input graph":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tight bounds for planar strongly connected steiner subgraph with fixed number of terminals and extensions")
  Member "on the parameterized complexity of recognizing well covered r l graphs":
    also connected through other hyperedges:
      (none)
  Member "algorithms and hardness results for happy coloring problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximizing happiness in graphs of bounded clique width")
  Member "anti path cover on sparse graph classes":
    also connected through other hyperedges:
      (none)
  Member "target set selection in dense graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "iterated type partitions")
  Member "extension complexity mso logic and treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parameterized shifted combinatorial optimization")
  Member "on the parameterized complexity of computing balanced partitions in graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards balanced clustering part 1 preliminaries")

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)