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 "uniform sampling through the lov asz local lemma"):
  Abstract: We propose a new algorithmic framework, called "partial rejection sampling", to draw samples exactly from a product distribution, conditioned on none of a number of bad events occurring. Our framework builds (perhaps surprising) new connections between the variable framework of the Lov\'asz Local Lemma and some classical sampling algorithms such as the "cycle-popping" algorithm for rooted spanning trees. Among other applications, we discover new algorithms to sample satisfying assignments of k-CNF formulas with bounded variable occurrences.

Includes members:
  Member "what can be sampled locally":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed metropolis sampler with optimal parallelism")
  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 "approximate counting the lovasz local lemma and inference in graphical models":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast sampling and counting k sat solutions in the local lemma regime")
  Member "an algorithmic proof of the lovasz local lemma via resampling oracles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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-6 (induced by source paper "computing the independence polynomial in shearer s region for the lll")
  Member "new constructive aspects of the lovasz local lemma":
    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 "a constructive proof of the general lovasz local lemma":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "scattering and sparse partitions and their applications")

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)