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 "approximating the partition function of the ferromagnetic potts model"):
  Abstract: We provide evidence that it is computationally difficult to approximate the partition function of the ferromagnetic q-state Potts model when q > 2. Specifically, we show that the partition function is hard for the complexity class #RHPi under approximation-preserving reducibility. Thus, it is as hard to approximate the partition function as it is to find approximate solutions to a wide range of counting problems, including that of determining the number of independent sets in a bipartite graph. Our proof exploits the first-order phase transition of the “random cluster” model, which is a probability distribution on graphs that is closely related to the q-state Potts model.

Includes members:
  Member "inapproximability of the tutte polynomial of a planar graph":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fpras for the potts model and the number of k colorings")
  Member "the complexity of approximately counting stable matchings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "algorithms for bis hard problems on expander graphs")
  Member "computational transition at the uniqueness threshold":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")
  Member "a graph polynomial for independent sets of bipartite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region")
  Member "inapproximability of the tutte polynomial":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the fine grained complexity of computing the tutte polynomial of a linear matroid")
  Member "linear datalog and bounded path duality of relational structures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "characterizations and approximability of hard counting classes below p")

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)