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 "sampling techniques for boolean satisfiability"):
  Abstract: Boolean satisfiability ({\SAT}) has played a key role in diverse areas spanning testing, formal verification, planning, optimization, inferencing and the like. Apart from the classical problem of checking boolean satisfiability, the problems of generating satisfying uniformly at random, and of counting the total number of satisfying assignments have also attracted significant theoretical and practical interest over the years. Prior work offered heuristic approaches with very weak or no guarantee of performance, and theoretical approaches with proven guarantees, but poor performance in practice. #R##N#We propose a novel approach based on limited-independence hashing that allows us to design algorithms for both problems, with strong theoretical guarantees and scalability extending to thousands of variables. Based on this approach, we present two practical algorithms, {\UniformWitness}: a near uniform generator and {\approxMC}: the first scalable approximate model counter, along with reference implementations. Our algorithms work by issuing polynomial calls to {\SAT} solver. We demonstrate scalability of our algorithms over a large set of benchmarks arising from different application domains.

Includes members:
  Member "balancing scalability and uniformity in sat witness generator":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantitative verification of neural networks and its security applications")
  Member "a scalable approximate model counter":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantitative verification of neural networks and its security applications")
  Member "a scalable and nearly uniform generator of sat witnesses":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "constrained counting and sampling bridging the gap between theory and practice")
  Member "uniform solution sampling using a constraint solver as an oracle":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exploiting database management systems and treewidth for counting")
  Member "probabilistic planning via heuristic forward search and weighted model counting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the approximability of weighted model integration on dnf structures")
  Member "the good old davis putnam procedure helps counting models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "estimating the density of states of boolean satisfiability problems on classical and quantum computing platforms")

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.LO(Logic in Computer Science)