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 "fast sampling and counting k sat solutions in the local lemma regime"):
  Abstract: We give new algorithms based on Markov chains to sample and approximately count satisfying assignments to $k$-uniform CNF formulas where each variable appears at most $d$ times. For any $k$ and $d$ satisfying $kd<n^{o(1)}$ and $k\ge 20\log k + 20\log d + 60$, the new sampling algorithm runs in close to linear time, and the counting algorithm runs in close to quadratic time.  Our approach is inspired by Moitra (JACM, 2019) which remarkably utilizes the Lov\'{a}sz local lemma in approximate counting. Our main technical contribution is to use the local lemma to bypass the connectivity barrier in traditional Markov chain approaches, which makes the well developed MCMC method applicable on disconnected state spaces such as SAT solutions. The benefit of our approach is to avoid the enumeration of local structures and obtain fixed polynomial running times, even if $k=\omega(1)$ or $d=\omega(1)$.

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 "algorithmic pirogov sinai theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient algorithms for the potts model on small set expanders")
  Member "counting hypergraph colorings in the local lemma regime":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "counting solutions to random cnf formulas")
  Member "convergence of mcmc and loopy bp in the tree uniqueness region for the hard core model":
    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 "a faster approximation algorithm for the gibbs partition function":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gauges loops and polynomials for partition functions of graphical models")
  Member "approximate counting the lovasz local lemma and inference in graphical models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "counting solutions to random cnf formulas")
  Member "parallel algorithms and concentration bounds for the lovasz local lemma via witness dags":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deterministic algorithms for the lovasz local lemma simpler more general and more parallel")
  Member "approximation via correlation decay when strong spatial mixing fails":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "counting solutions to random cnf formulas")

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)