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 "approximate counting the lovasz local lemma and inference in graphical models"):
  Abstract: In this paper we introduce a new approach for approximately counting in bounded degree systems with higher-order constraints. Our main result is an algorithm to approximately count the number of solutions to a CNF formula $\Phi$ when the width is logarithmic in the maximum degree. This closes an exponential gap between the known upper and lower bounds. #R##N#Moreover our algorithm extends straightforwardly to approximate sampling, which shows that under Lovasz Local Lemma-like conditions it is not only possible to find a satisfying assignment, it is also possible to generate one approximately uniformly at random from the set of all satisfying assignments. Our approach is a significant departure from earlier techniques in approximate counting, and is based on a framework to bootstrap an oracle for computing marginal probabilities on individual variables. Finally, we give an application of our results to show that it is algorithmically possible to sample from the posterior distribution in an interesting class of graphical models.

Includes members:
  Member "uniform sampling through the lov asz local lemma":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dynamic mcmc sampling")
  Member "inapproximability of the partition function for the antiferromagnetic ising and hard core models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")
  Member "computing the independence polynomial in shearer s region for the lll":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "commutative algorithms approximate the lll distribution")
  Member "computing the independence polynomial from the tree threshold down to the roots":
    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 "commutativity in the algorithmic lovasz local lemma":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "extensions of the algorithmic lovasz local lemma")
  Member "an algorithmic proof of the lovasz local lemma via resampling oracles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "extensions of the algorithmic lovasz local lemma")
  Member "approximation via correlation decay when strong spatial mixing fails":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fast sampling and counting k sat solutions in the local lemma regime")
  Member "fptas for counting monotone cnf":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "computing the independence polynomial in shearer s region for the lll")

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)