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 "inapproximability of the partition function for the antiferromagnetic ising and hard core models"):
  Abstract: Recent inapproximability results of Sly ( 2010 ), together with an approximation algorithm presented by Weitz ( 2006 ), establish a beautiful picture of the computational complexity of approximating the partition function of the hard-core model. Let λ #N#                       c #N#                    ( #N#                       #N#                          #N#                         #N#            #N#             #N#                 #N#                    $\mathbb{T}_{\Delta}$#N#                 #N#             #N#        #N#                       #N#                    ) denote the critical activity for the hard-model on the infinite Δ-regular tree. Weitz presented an  FPTAS  for the partition function when λ  #N#                       c #N#                    ( #N#                       #N#                          #N#                         #N#            #N#             #N#                 #N#                    $\mathbb{T}_{\Delta}$#N#                 #N#             #N#        #N#                       #N#                    ) for graphs with constant maximum degree Δ. In contrast, Sly showed that for all Δ ⩾ 3, there exists e Δ  > 0 such that (unless RP = NP) there is no  FPRAS  for approximating the partition function on graphs of maximum degree Δ for activities λ satisfying λ #N#                       c #N#                    ( #N#                       #N#                          #N#                         #N#            #N#             #N#                 #N#                    $\mathbb{T}_{\Delta}$#N#                 #N#             #N#        #N#                       #N#                    )  #N#                       c #N#                    ( #N#                       #N#                          #N#                         #N#            #N#             #N#                 #N#                    $\mathbb{T}_{\Delta}$#N#                 #N#             #N#        #N#                       #N#                    ) + e Δ . #N#                 We prove that a similar phenomenon holds for the antiferromagnetic Ising model. Sinclair, Srivastava and Thurley ( 2014 ) extended Weitz's approach to the antiferromagnetic Ising model, yielding an  FPTAS  for the partition function for all graphs of constant maximum degree Δ when the parameters of the model lie in the uniqueness region of the infinite Δ-regular tree. We prove the complementary result for the antiferromagnetic Ising model without external field, namely, that unless RP = NP, for all Δ ⩾ 3, there is no  FPRAS  for approximating the partition function on graphs of maximum degree Δ when the inverse temperature lies in the non-uniqueness region of the infinite tree  #N#                       #N#                          #N#                         #N#            #N#             #N#                 #N#                    $\mathbb{T}_{\Delta}$#N#                 #N#             #N#        #N#                       #N#                    . Our proof works by relating certain second moment calculations for random Δ-regular bipartite graphs to the tree recursions used to establish the critical points on the infinite tree.

Includes members:
  Member "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "spectral approximate inference")
  Member "approximation algorithms for two state anti ferromagnetic spin systems on bounded degree graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient distance approximation for structured high dimensional distributions via learning")
  Member "correlation decay up to uniqueness in spin systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")
  Member "improved inapproximability results for counting independent sets in the hard core model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")
  Member "computational transition at the uniqueness threshold":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")
  Member "approximating partition functions of two state spin systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sampling in uniqueness from the potts and random cluster models on random regular graphs")

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.DM(Discrete Mathematics)