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 "a universal algebraic proof of the complexity dichotomy for monotone monadic snp"):
  Abstract: The logic MMSNP is a restricted fragment of existential second-order logic which allows to express many interesting queries in graph theory and finite model theory. The logic was introduced by Feder and Vardi who showed that every MMSNP sentence is computationally equivalent to a finite-domain constraint satisfaction problem (CSP); the involved probabilistic reductions were derandomized by Kun using explicit constructions of expander structures. We present a new proof of the reduction to finite-domain CSPs which does not rely on the results of Kun. This new proof allows us to obtain a stronger statement and to verify the more general Bodirsky-Pinsker dichotomy conjecture for CSPs in MMSNP. Our approach uses the fact that every MMSNP sentence describes a finite union of CSPs for countably infinite $\omega$-categorical structures; moreover, by a recent result of Hubi\v{c}ka and Ne\v{s}et\v{r}il, these structures can be expanded to homogeneous structures with finite relational signature and the Ramsey property. This allows us to use the universal-algebraic approach to study the computational complexity of MMSNP.

Includes members:
  Member "a dichotomy theorem for nonuniform csps":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "when symmetries are not enough a hierarchy of hard constraint satisfaction problems")
  Member "the proof of csp dichotomy conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal polynomial time compression for boolean max csp")
  Member "rewritability in monadic disjunctive datalog mmsnp and expressive description logics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a journey into ontology approximation from non horn to hon")
  Member "the algebraic dichotomy conjecture for infinite domain constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "when symmetries are not enough a hierarchy of hard constraint satisfaction problems")
  Member "equations in oligomorphic clones and the constraint satisfaction problem for omega categorical structures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "topology is relevant in a dichotomy conjecture for infinite domain constraint satisfaction problems")
  Member "complexity classification in infinite domain constraint satisfaction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "asnp a tame fragment of existential second order logic")
  Member "absorbing subalgebras cyclic terms and the constraint satisfaction problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "topology is relevant in a dichotomy conjecture for infinite domain constraint satisfaction problems")
  Member "universal structures and the logic of forbidden patterns":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "asnp a tame fragment of existential second order logic")

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)