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: "inapproximability for antiferromagnetic spin systems in the tree non uniqueness region"
  Abstract: A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degree D undergoes a phase transition that coincides with the statistical physics uniqueness/non-uniqueness phase transition on the infinite D-regular tree. Despite this clear picture for 2-spin systems, there is little known for multi-spin systems. We present the first analog of the above inapproximability results for multi-spin systems. #R##N#The main difficulty in previous inapproximability results was analyzing the behavior of the model on random D-regular bipartite graphs, which served as the gadget in the reduction. To this end one needs to understand the moments of the partition function. Our key contribution is connecting: (i) induced matrix norms, (ii) maxima of the expectation of the partition function, and (iii) attractive fixed points of the associated tree recursions (belief propagation). The view through matrix norms allows a simple and generic analysis of the second moment for any spin system on random D-regular bipartite graphs. This yields concentration results for any spin system in which one can analyze the maxima of the first moment. The connection to fixed points of the tree recursions enables an analysis of the maxima of the first moment for specific models of interest. #R##N#For k-colorings we prove that for even k, in the tree non-uniqueness region (which corresponds to k<D) it is NP-hard, unless NP=RP, to approximate the number of colorings for triangle-free D-regular graphs. Our proof extends to the antiferromagnetic Potts model, and, in fact, to every antiferromagnetic model under a mild condition.

Connected through hyperedge HE-1 (induced by source paper "spectral approximate inference"):
  with members:
    - "the mean field approximation information inequalities algorithms and complexity"
    - "the ising partition function zeros and deterministic approximation"
    - "convergence of mcmc and loopy bp in the tree uniqueness region for the hard core model"
    - "variable elimination in the fourier domain"
    - "a new class of upper bounds on the log partition function"
    - "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs"
    - "correlation decay up to uniqueness in spin systems"

Connected through hyperedge HE-2 (induced by source paper "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region"):
  with members:
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "the complexity of approximating conservative counting csps"
    - "approximating the partition function of planar two state spin systems"
    - "the complexity of ferromagnetic two spin systems with external fields"
    - "the expressibility of functions on the boolean domain with applications to counting csps"
    - "inapproximability after uniqueness phase transition in two spin systems"
    - "approximating the partition function of the ferromagnetic potts model"
    - "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs"

Connected through hyperedge HE-3 (induced by source paper "computing the independence polynomial in shearer s region for the lll"):
  with members:
    - "inapproximability of the independent set polynomial below the shearer threshold"
    - "convergence of mcmc and loopy bp in the tree uniqueness region for the hard core model"
    - "fptas for bis with degree bounds on one side"
    - "an algorithmic proof of the lovasz local lemma via resampling oracles"
    - "spatial mixing and the connective constant optimal bounds"
    - "fptas for counting monotone cnf"
    - "spatial mixing and approximation algorithms for graphs with bounded connective constant"
    - "correlation decay up to uniqueness in spin systems"

Connected through hyperedge HE-4 (induced by source paper "inapproximability of the partition function for the antiferromagnetic ising and hard core models"):
  with members:
    - "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region"
    - "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs"
    - "correlation decay up to uniqueness in spin systems"
    - "improved inapproximability results for counting independent sets in the hard core model"
    - "computational transition at the uniqueness threshold"
    - "approximating partition functions of two state spin systems"

Connected through hyperedge HE-5 (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"
    - "the complexity of approximately counting in 2 spin systems on k uniform bounded degree 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"

Connected through hyperedge HE-6 (induced by source paper "spatial mixing and approximate counting for potts model on graphs with bounded average degree"):
  with members:
    - "inapproximability of the partition function for the antiferromagnetic ising and hard core models"
    - "spatial mixing of coloring random graphs"
    - "mcmc sampling colourings and independent sets of g n d n near the uniqueness threshold"
    - "chasing the k colorability threshold"
    - "spatial mixing and approximation algorithms for graphs with bounded connective constant"
    - "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs"
    - "correlation decay up to uniqueness in spin systems"
    - "a simple algorithm for random colouring g n d n using 2 epsilon d colours"

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)