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 "markov chains on orbits of permutation groups"):
  Abstract: We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the symmetries of graphical models. Second, we introduce orbital Markov chains, a novel family of Markov chains leveraging model symmetries to reduce mixing times. We establish an insightful connection between model symmetries and rapid mixing of orbital Markov chains. Thus, we present the first lifted MCMC algorithm for probabilistic graphical models. Both analytical and empirical results demonstrate the effectiveness and efficiency of the approach.

Includes members:
  Member "lower complexity bounds for lifted inference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of bayesian networks specified by propositional and relational languages")
  Member "practical graph isomorphism ii":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "general purpose mcmc inference over relational structures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "swift compiled inference for probabilistic programming languages")
  Member "a delayed column generation strategy for exact k bounded map inference in markov logic networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rockit exploiting parallelism and symmetry for map inference in statistical relational models")
  Member "bisimulation based approximate lifted inference":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "abstracting probabilistic models a logical perspective")
  Member "improving the accuracy and efficiency of map inference for markov logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "beyond markov logic efficient mining of prediction rules in large graphs")
  Member "counting belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lifted hybrid variational inference")
  Member "probabilistic theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "equivalence of dataflow graphs via rewrite rules using a graph to sequence neural model")

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)