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 "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region"):
  Abstract: Counting independent sets on bipartite graphs (#BIS) is considered a canonical counting problem of intermediate approximation complexity. It is conjectured that #BIS neither has an FPRAS nor is as hard as #Sat to approximate. We study #BIS in the general framework of two-state spin systems on bipartite graphs. We define two notions, nearly-independent phase-correlated spins and unary symmetry breaking. We prove that it is #BIS-hard to approximate the partition function of any 2-spin system on bipartite graphs supporting these two notions. Consequently, we classify the complexity of approximating the partition function of antiferromagnetic 2-spin systems on bounded-degree bipartite graphs. We examine the problem of approximating the partition function in 2-spin systems.We define: nearly-independent phase-correlated spins, unary symmetry breaking.If these hold, the problem is as hard as counting bipartite independent sets (#BIS).We thus classify antiferromagnetic 2-spin systems on bounded-degree bipartite graphs.The uniqueness threshold on the infinite regular tree captures the classification.

Includes members:
  Member "inapproximability of the partition function for the antiferromagnetic ising and hard core models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "the complexity of approximating conservative counting csps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "approximating the partition function of planar two state spin systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "detecting and counting small patterns in planar graphs in subexponential parameterized time")
  Member "the complexity of ferromagnetic two spin systems with external fields":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "boolean approximate counting csps with weak conservativity and implications for ferromagnetic two spin")
  Member "the expressibility of functions on the boolean domain with applications to counting csps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "inapproximability for antiferromagnetic spin systems in the tree non uniqueness region":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spectral approximate inference")
  Member "inapproximability after uniqueness phase transition in two spin systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of approximately counting in 2 spin systems on k uniform bounded degree hypergraphs")
  Member "approximating the partition function of the ferromagnetic potts model":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")

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)