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 "rockit exploiting parallelism and symmetry for map inference in statistical relational models"):
  Abstract: RockIt is a maximum a-posteriori (MAP) query engine for statistical relational models. MAP inference in graphical models is an optimization problem which can be compiled to integer linear programs (ILPs). We describe several advances in translating MAP queries to ILP instances and present the novel meta-algorithm cutting plane aggregation (CPA). CPA exploits local context-specific symmetries and bundles up sets of linear constraints. The resulting counting constraints lead to more compact ILPs and make the symmetry of the ground model more explicit to state-of-the-art ILP solvers. Moreover, RockIt parallelizes most parts of the MAP inference pipeline taking advantage of ubiquitous shared-memory multi-core architectures. #R##N#We report on extensive experiments with Markov logic network (MLN) benchmarks showing that RockIt outperforms the state-of-the-art systems Alchemy, Markov TheBeast, and Tuffy both in terms of efficiency and quality of results.

Includes members:
  Member "automorphism groups of graphical models and lifted variational inference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generating and sampling orbits for lifted probabilistic inference")
  Member "a delayed column generation strategy for exact k bounded map inference in markov logic networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "markov chains on orbits of permutation groups")
  Member "improving the accuracy and efficiency of map inference for markov logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beyond markov logic efficient mining of prediction rules in large graphs")
  Member "markov chains on orbits of permutation groups":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generating and sampling orbits for lifted probabilistic inference")
  Member "counting belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lifted hybrid variational inference")
  Member "exploiting uniform assignments in first order mpe":
    also connected through other hyperedges:
      (none)
  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 "tuffy scaling up statistical inference in markov logic networks using an rdbms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "nonlinear equation solving a faster alternative to feedforward computation")

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)