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 probabilistic inference via word level counting"):
  Abstract: Hashing-based model counting has emerged as a promising approach for large-scale probabilistic inference on graphical models. A key component of these techniques is the use of xor-based 2-universal hash functions that operate over Boolean domains. Many counting problems arising in probabilistic inference are, however, naturally encoded over finite discrete domains. Techniques based on bit-level (or Boolean) hash functions require these problems to be propositionalized, making it impossible to leverage the remarkable progress made in SMT (Satisfiability Modulo Theory) solvers that can reason directly over words (or bit-vectors). In this work, we present the first approximate model counter that uses word-level hashing functions, and can directly leverage the power of sophisticated SMT solvers. Empirical evaluation over an extensive suite of benchmarks demonstrates the promise of the approach.

Includes members:
  Member "probabilistic inference modulo theories":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scaling up hybrid probabilistic inference with logical and arithmetic constraints via message passing")
  Member "distribution aware sampling and weighted model counting for sat":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the approximability of weighted model integration on dnf structures")
  Member "sampling techniques for boolean satisfiability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sound probabilistic sat with projection")
  Member "approximate counting in smt and value estimation for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semiring programming a declarative framework for generalized sum product problems")
  Member "structured learning modulo theories":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "from minizinc to optimization modulo theories and back extended version")
  Member "a scalable approximate model counter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "quantitative verification of neural networks and its security applications")
  Member "taming the curse of dimensionality discrete integration by hashing and optimization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards efficient discrete integration via adaptive quantile queries")

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.AI(Artificial Intelligence)