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: "the complexity of approximately counting in 2 spin systems on k uniform bounded degree hypergraphs"
  Abstract: One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This classification is based on a beautiful connection to the so-called uniqueness phase transition from statistical physics on the infinite $\Delta$-regular tree. Our objective is to study the impact of this classification on unweighted 2-spin models on $k$-uniform hypergraphs. As has already been indicated by Yin and Zhao, the connection between the uniqueness phase transition and the complexity of approximate counting breaks down in the hypergraph setting. Nevertheless, we show that for every non-trivial symmetric $k$-ary Boolean function $f$ there exists a degree bound $\Delta_0$ so that for all $\Delta \geq \Delta_0$ the following problem is NP-hard: given a $k$-uniform hypergraph with maximum degree at most $\Delta$, approximate the partition function of the hypergraph 2-spin model associated with $f$. It is NP-hard to approximate this partition function even within an exponential factor. By contrast, if $f$ is a trivial symmetric Boolean function (e.g., any function $f$ that is excluded from our result), then the partition function of the corresponding hypergraph 2-spin model can be computed exactly in polynomial time.

Connected through hyperedge HE-1 (induced by source paper "the ising partition function zeros and deterministic approximation"):
  with members:
    - "a generalization of permanent inequalities and applications in counting and optimization"
    - "convergence of mcmc and loopy bp in the tree uniqueness region for the hard core model"
    - "real stable polynomials and matroids optimization and counting"
    - "random cluster dynamics for the ising model is rapidly mixing"
    - "uniqueness spatial mixing and approximation for ferromagnetic 2 spin systems"
    - "fptas for hardcore and ising models on hypergraphs"
    - "counting hypergraph matchings up to uniqueness threshold"
    - "the kadison singer problem for strongly rayleigh measures and applications to asymmetric tsp"

Connected through hyperedge HE-2 (induced by source paper "inapproximability of the independent set polynomial below the shearer threshold"):
  with members:
    - "computing the independence polynomial in shearer s region for the lll"
    - "approximate counting the lovasz local lemma and inference in graphical models"
    - "an algorithmic proof of the lovasz local lemma via resampling oracles"
    - "the complexity of computing the sign of the tutte polynomial"
    - "inapproximability of the tutte polynomial of a planar graph"
    - "correlation decay up to uniqueness in spin systems"
    - "computational transition at the uniqueness threshold"

Connected through hyperedge HE-3 (induced by source paper "approximating partition functions of bounded degree boolean counting constraint satisfaction problems"):
  with members:
    - "counting hypergraph matchings up to uniqueness threshold"
    - "fptas for counting monotone cnf"
    - "an approximation trichotomy for boolean csp"

Connected through hyperedge HE-4 (induced by source paper "counting hypergraph matchings up to uniqueness threshold"):
  with members:
    - "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region"
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "counting independent sets in hypergraphs when strong spatial mixing fails"
    - "fptas for hardcore and ising models on hypergraphs"
    - "approximation via correlation decay when strong spatial mixing fails"
    - "fptas for weighted fibonacci gates and its applications"
    - "a simple fptas for counting edge covers"
    - "spatial mixing and the connective constant optimal bounds"

Connected through hyperedge HE-5 (induced by source paper "approximation via correlation decay when strong spatial mixing fails"):
  with members:
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "fptas for hardcore and ising models on hypergraphs"
    - "spatial mixing and approximate counting for potts model on graphs with bounded average degree"
    - "approximately counting locally optimal structures"
    - "spatial mixing and the connective constant optimal bounds"
    - "fptas for counting monotone cnf"
    - "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs"
    - "correlation decay up to uniqueness in spin systems"

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)