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 "lifted relax compensate and then recover from approximate to exact lifted probabilistic inference"):
  Abstract: We propose an approach to lifted approximate inference for first-order probabilistic models, such as Markov logic networks. It is based on performing exact lifted inference in a simplified first-order model, which is found by relaxing first-order constraints, and then compensating for the relaxation. These simplified models can be incrementally improved by carefully recovering constraints that have been relaxed, also at the first-order level. This leads to a spectrum of approximations, with lifted belief propagation on one end, and exact lifted inference on the other. We discuss how relaxation, compensation, and recovery can be performed, all at the firstorder level, and show empirically that our approach substantially improves on the approximations of both propositional solvers and lifted belief propagation.

Includes members:
  Member "approximating the partition function by deleting and then correcting for model edges":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dual decomposition from the perspective of relax compensate and then recover")
  Member "bisimulation based approximate lifted inference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "abstracting probabilistic models a logical perspective")
  Member "iterative join graph propagation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximate knowledge compilation by online collapsed importance sampling")
  Member "node splitting a scheme for generating upper bounds in bayesian networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "oblivious bounds on the probability of boolean functions")
  Member "counting belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lifted hybrid variational inference")
  Member "probabilistic theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equivalence of dataflow graphs via rewrite rules using a graph to sequence neural model")
  Member "towards completely lifted search based probabilistic inference":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "state space abstractions for probabilistic inference a systematic review")

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)