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 of ising polynomials"):
  Abstract: This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and external field. One may consider such an Ising system as a simple graph together with vertex and edge weights. When these weights are considered indeterminates, the partition function for the constant case is a trivariate polynomial Z(G;x,y,z). This polynomial was studied with respect to its approximability by Goldberg, Jerrum and Paterson. Z(G;x,y,z) generalizes a bivariate polynomial Z(G;t,y), which was studied in by Andren and Markstrom.#R##N##R##N#We consider the complexity of Z(Gt,y) and Z(G;x,y,z) in comparison to that of the Tutte polynomial, which is well known to be closely related to the Potts model in the absence of an external field. We show that Z(G;x,y,z) is #P-hard to evaluate at all points in    3, except those in an exceptional set of low dimension, even when restricted to simple graphs which are bipartite and planar. A counting version of the Exponential Time Hypothesis, #ETH, was introduced by Dell, Husfeldt and Wahlen in order to study the complexity of the Tutte polynomial. In analogy to their results, we give under #ETH a dichotomy theorem stating that evaluations of Z(G;t,y) either take exponential time in the number of vertices of G to compute, or can be done in polynomial time. Finally, we give an algorithm for computing Z(G;x,y,z) in polynomial time on graphs of bounded clique-width, which is not known in the case of the Tutte polynomial.

Includes members:
  Member "exponential time complexity of the permanent and the tutte polynomial":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the fine grained complexity of computing the tutte polynomial of a linear matroid")
  Member "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient distance approximation for structured high dimensional distributions via learning")
  Member "graph homomorphisms with complex values a dichotomy theorem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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)