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 "complexity classification of the eight vertex model"):
  Abstract: We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or \#P-hard. The dichotomy criterion is explicit. For tractability, we find some new classes of problems computable in polynomial time. For \#P-hardness, we employ M\"{o}bius transformations to prove the success of interpolations.

Includes members:
  Member "holographic algorithm with matchgates is universal for planar csp over boolean domain":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity of counting weighted eulerian orientations with ars")
  Member "the complexity of holant problems over boolean domain with non negative weights":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "zeros and approximations of holant polynomials on the complex plane")
  Member "approximating the partition function of the ferromagnetic potts model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "on tractable exponential sums":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stabilizer circuits quadratic forms and computing matrix rank")
  Member "graph homomorphisms with complex values a dichotomy theorem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a dichotomy for bounded degree graph homomorphisms with nonnegative weights")
  Member "a complexity dichotomy for partition functions with mixed signs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a dichotomy for bounded degree graph homomorphisms with nonnegative weights")

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)