human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models"):
  with members:
    - "approximating pairwise correlations in the ising model"
    - "learning graphical models using multiplicative weights"
    - "sample optimal identity testing with high probability"
    - "structure learning of h colorings"
    - "a new approach for testing properties of discrete distributions"
    - "testing ising models"
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "random cluster dynamics for the ising model is rapidly mixing"

Connected through hyperedge HE-2 (induced by source paper "counting independent sets and colorings on random regular bipartite graphs"):
  with members:
    - "algorithms for bis hard problems on expander graphs"
    - "improved bounds for randomly sampling colorings via linear programming"
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "an fptas for counting proper four colorings on cubic graphs"
    - "fptas for bis with degree bounds on one side"
    - "the expressibility of functions on the boolean domain with applications to counting csps"
    - "ferromagnetic potts model refined bis hardness and related results"
    - "approximating the partition function of the ferromagnetic potts model"

Connected through hyperedge HE-3 (induced by source paper "markov chains for the hard core model via polymer models"):
  with members:
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "algorithms for bis hard problems on expander graphs"
    - "algorithmic pirogov sinai theory"
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "fptas for bis with degree bounds on one side"
    - "computational transition at the uniqueness threshold"

Connected through hyperedge HE-4 (induced by source paper "counting independent sets in unbalanced bipartite graphs"):
  with members:
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "algorithms for bis hard problems on expander graphs"
    - "algorithmic pirogov sinai theory"
    - "fptas for bis with degree bounds on one side"
    - "approximating the partition function of the ferromagnetic potts model"
    - "computational transition at the uniqueness threshold"

Connected through hyperedge HE-5 (induced by source paper "any finite distributive lattice is isomorphic to the minimizer set of an rm m natural concave set function"):
  with members:
    - "finding the submodularity hidden in symmetric difference"
    - "a faster cutting plane method and its implications for combinatorial and convex optimization"

Connected through hyperedge HE-6 (induced by source paper "algorithms for bis hard problems on expander graphs"):
  with members:
    - "markov chains for the hard core model via polymer models"
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "sampling in uniqueness from the potts and random cluster models on random regular graphs"
    - "algorithmic pirogov sinai theory"
    - "convergence of mcmc and loopy bp in the tree uniqueness region for the hard core model"
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "random cluster dynamics for the ising model is rapidly mixing"
    - "fptas for bis with degree bounds on one side"

Connected through hyperedge HE-7 (induced by source paper "algorithmic pirogov sinai theory"):
  with members:
    - "algorithms for bis hard problems on expander graphs"
    - "the ising partition function zeros and deterministic approximation"
    - "inapproximability of the independent set polynomial in the complex plane"
    - "computing the number of induced copies of a fixed graph in a bounded degree graph"
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "random cluster dynamics for the ising model is rapidly mixing"
    - "computing the independence polynomial from the tree threshold down to the roots"
    - "fptas for bis with degree bounds on one side"

Connected through hyperedge HE-8 (induced by source paper "a fixed parameter perspective on bis"):
  with members:
    - "homomorphisms are a good basis for counting small subgraphs"
    - "computing the number of induced copies of a fixed graph in a bounded degree graph"
    - "fptas for bis with degree bounds on one side"
    - "complexity of counting subgraphs only the boundedness of the vertex cover number counts"
    - "ferromagnetic potts model refined bis hardness and related results"

Question: Please tell me which class the center node 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)