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: "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$.

Connected through hyperedge HE-1 (induced by source paper "efficient algorithms for the potts model on small set expanders"):
  with members:
    - "counting independent sets in unbalanced bipartite graphs"
    - "fast algorithms at low temperatures via markov chains"
    - "statistical physics approaches to unique games"
    - "algorithmic pirogov sinai theory"
    - "partitioning into expanders"
    - "improved cheeger s inequality analysis of spectral partitioning algorithms through higher order spectral gap"
    - "ferromagnetic potts model refined bis hardness and related results"
    - "approximating the expansion profile and almost optimal local graph clustering"

Connected through hyperedge HE-2 (induced by source paper "zeros and approximations of holant polynomials on the complex plane"):
  with members:
    - "fast algorithms at low temperatures via markov chains"
    - "counting perfect matchings and the eight vertex model"
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "zeros of holant problems locations and algorithms"
    - "the complexity of approximating the matching polynomial in the complex plane"
    - "algorithmic pirogov sinai theory"
    - "approximability of the six vertex model"
    - "the ising partition function zeros and deterministic approximation"

Connected through hyperedge HE-3 (induced by source paper "fast sampling and counting k sat solutions in the local lemma regime"):
  with members:
    - "algorithmic pirogov sinai theory"
    - "counting hypergraph colorings in the local lemma regime"
    - "convergence of mcmc and loopy bp in the tree uniqueness region for the hard core model"
    - "a faster approximation algorithm for the gibbs partition function"
    - "approximate counting the lovasz local lemma and inference in graphical models"
    - "parallel algorithms and concentration bounds for the lovasz local lemma via witness dags"
    - "approximation via correlation decay when strong spatial mixing fails"
    - "new constructive aspects of the lovasz local lemma"

Connected through hyperedge HE-4 (induced by source paper "counting independent sets and colorings on random regular bipartite graphs"):
  with members:
    - "improved bounds for randomly sampling colorings via linear programming"
    - "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"
    - "an fptas for counting proper four colorings on cubic graphs"
    - "fptas for bis with degree bounds on one side"
    - "the expressibility of functions on the boolean domain with applications to counting csps"
    - "ferromagnetic potts model refined bis hardness and related results"
    - "approximating the partition function of the ferromagnetic potts model"

Connected through hyperedge HE-5 (induced by source paper "markov chains for the hard core model via polymer models"):
  with members:
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "algorithmic pirogov sinai theory"
    - "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"
    - "fptas for bis with degree bounds on one side"
    - "computational transition at the uniqueness threshold"

Connected through hyperedge HE-6 (induced by source paper "counting independent sets in unbalanced bipartite graphs"):
  with members:
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "algorithmic pirogov sinai theory"
    - "bis hardness for 2 spin systems on bipartite bounded degree graphs in the tree non uniqueness region"
    - "fptas for bis with degree bounds on one side"
    - "approximating the partition function of the ferromagnetic potts model"
    - "computational transition at the uniqueness threshold"

Connected through hyperedge HE-7 (induced by source paper "a deterministic algorithm for counting colorings with 2 delta colors"):
  with members:
    - "zeros of holant problems locations and algorithms"
    - "algorithmic pirogov sinai theory"
    - "improved bounds for randomly sampling colorings via linear programming"
    - "the ising partition function zeros and deterministic approximation"
    - "approximating the permanent of a random matrix with vanishing mean"
    - "an fptas for counting proper four colorings on cubic graphs"

Connected through hyperedge HE-8 (induced by source paper "fast algorithms at low temperatures via markov chains"):
  with members:
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "algorithmic pirogov sinai theory"
    - "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"

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