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 tree reweighted variational inference"):
  Abstract: We analyze variational inference for highly symmetric graphical models such as those arising from first-order probabilistic models. We first show that for these graphical models, the tree-reweighted variational objective lends itself to a compact lifted formulation which can be solved much more efficiently than the standard TRW formulation for the ground graphical model. Compared to earlier work on lifted belief propagation, our formulation leads to a convex optimization problem for lifted marginal inference and provides an upper bound on the partition function. We provide two approaches for improving the lifted TRW upper bound. The first is a method for efficiently computing maximum spanning trees in highly symmetric graphs, which can be used to optimize the TRW edge appearance probabilities. The second is a method for tightening the relaxation of the marginal polytope using lifted cycle inequalities and novel exchangeable cluster consistency constraints.

Includes members:
  Member "on the complexity and approximation of binary evidence in lifted inference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "taming reasoning in temporal probabilistic relational models")
  Member "automorphism groups of graphical models and lifted variational inference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generating and sampling orbits for lifted probabilistic inference")
  Member "template based inference in symmetric relational markov random fields":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "state space abstractions for probabilistic inference a systematic review")
  Member "tightening lp relaxations for map using message passing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph structured prediction energy networks")
  Member "markov chains on orbits of permutation groups":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generating and sampling orbits for lifted probabilistic inference")
  Member "counting belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lifted hybrid variational inference")
  Member "convergent propagation algorithms via oriented trees":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalized belief propagation on tree robust structured region graphs")
  Member "a new class of upper bounds on the log partition function":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "visual semantic information pursuit a survey")

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)