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 "structured learning modulo theories"):
  Abstract: Modelling problems containing a mixture of Boolean and numerical variables is a long-standing interest of Artificial Intelligence. However, performing inference and learning in hybrid domains is a particularly daunting task. The ability to model this kind of domains is crucial in "learning to design" tasks, that is, learning applications where the goal is to learn from examples how to perform automatic {\em de novo} design of novel objects. In this paper we present Structured Learning Modulo Theories, a max-margin approach for learning in hybrid domains based on Satisfiability Modulo Theories, which allows to combine Boolean reasoning and optimization over continuous linear arithmetical constraints. The main idea is to leverage a state-of-the-art generalized Satisfiability Modulo Theory solver for implementing the inference and separation oracles of Structured Output SVMs. We validate our method on artificial and real world scenarios.

Includes members:
  Member "optimization modulo theories with linear rational costs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "semiring programming a declarative framework for generalized sum product problems")
  Member "pushing the envelope of optimization modulo theories with linear arithmetic cost functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "from minizinc to optimization modulo theories and back extended version")
  Member "probabilistic similarity logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non parametric learning of gaifman models")
  Member "church a language for generative models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semiring programming a declarative framework for generalized sum product problems")
  Member "inference in probabilistic logic programs with continuous random variables":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "model checking with probabilistic tabled logic programming")
  Member "lifted relational variational inference":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lifted hybrid variational inference")
  Member "optimization in smt with la q cost functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "from minizinc to optimization modulo theories and back extended version")
  Member "lifted inference for relational continuous models":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "lifted hybrid variational inference")

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)