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 "the complexity of ferromagnetic two spin systems with external fields"):
  Abstract: We study the approximability of computing the partition function for ferromagnetic two-state spin systems. The remarkable algorithm by Jerrum and Sinclair showed that there is a fully polynomial-time randomized approximation scheme (FPRAS) for the special ferromagnetic Ising model with any given uniform external field. Later, Goldberg and Jerrum proved that it is #BIS-hard for Ising model if we allow inconsistent external fields on different nodes. In contrast to these two results, we prove that for any ferromagnetic two-state spin systems except the Ising model, there exists a threshold for external fields beyond which the problem is #BIS-hard, even if the external field is uniform.

Includes members:
  Member "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "inapproximability of the partition function for the antiferromagnetic ising and hard core models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "fptas for weighted fibonacci gates and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "zeros and approximations of holant polynomials on the complex plane")
  Member "a simple fptas for counting edge covers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient distance approximation for structured high dimensional distributions via learning")
  Member "correlation decay up to uniqueness in spin systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")
  Member "approximate counting via correlation decay in spin systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")

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)