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 "algorithms for bis hard problems on expander graphs"):
  Abstract: We give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs and the low-temperature ferromagnetic Potts model on bounded-degree expander graphs. The results apply, for example, to random (bipartite) $\Delta$-regular graphs, for which no efficient algorithms were known for these problems (with the exception of the Ising model) in the non-uniqueness regime of the infinite $\Delta$-regular tree. We also find efficient counting and sampling algorithms for proper $q$-colorings of random $\Delta$-regular bipartite graphs when $q$ is sufficiently small as a function of $\Delta$.

Includes members:
  Member "markov chains for the hard core model via polymer models":
    also connected through other hyperedges:
      (none)
  Member "counting independent sets and colorings on random regular bipartite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "zeros and approximations of holant polynomials on the complex plane")
  Member "sampling in uniqueness from the potts and random cluster models on random regular graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "uniqueness for the 3 state antiferromagnetic potts model on the tree")
  Member "algorithmic pirogov sinai theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient algorithms for the potts model on small set expanders")
  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-4 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "convergence of mcmc and loopy bp in the tree uniqueness region for 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 "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")

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)