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 "algorithmic pirogov sinai theory"):
  Abstract: We develop an efficient algorithmic approach for approximate counting and sampling in the low-temperature regime of a broad class of statistical physics models on finite subsets of the lattice $\mathbb Z^d$ and on the torus $(\mathbb Z/n \mathbb Z)^d$. Our approach is based on combining contour representations from Pirogov-Sinai theory with Barvinok's approach to approximate counting using truncated Taylor series. Some consequences of our main results include an FPTAS for approximating the partition function of the hard-core model at sufficiently high fugacity on subsets of $\mathbb Z^d$ with appropriate boundary conditions and an efficient sampling algorithm for the ferromagnetic Potts model on the discrete torus $(\mathbb Z/n \mathbb Z)^d$ at sufficiently low temperature.

Includes members:
  Member "algorithms for bis hard problems on expander graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient algorithms for the potts model on small set expanders")
  Member "the ising partition function zeros and deterministic approximation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "zeros and approximations of holant polynomials on the complex plane")
  Member "inapproximability of the independent set polynomial in the complex plane":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "counting homomorphisms modulo a prime number")
  Member "computing the number of induced copies of a fixed graph in a bounded degree graph":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "detecting and counting small patterns in planar graphs in subexponential parameterized time")
  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-5 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "inapproximability of the partition function for the antiferromagnetic ising and hard core models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "random cluster dynamics for the ising model is rapidly mixing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "computing the independence polynomial from the tree threshold down to the roots":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")

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.DS(Data Structures and Algorithms)