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 "from minizinc to optimization modulo theories and back extended version"):
  Abstract: Optimization Modulo Theories (OMT) is an extension of SMT that allows for finding models that optimize objective functions. In this paper we aim at bridging the gap between Constraint Programming (CP) and OMT, in both directions. First, we have extended the OMT solver OptiMathSAT with a FlatZinc interface -- which can also be used as a FlatZinc-to-OMT encoder for other OMT solvers. This allows OMT tools to be used in combination with mzn2fzn on the large amount of CP problems coming from the MiniZinc community. Second, we have introduced a tool for translating SMT and OMT problems on the linear arithmetic and bit-vector theories into MiniZinc. This allows MiniZinc solvers to be used on a large amount of SMT/OMT problems. #R##N#We have discussed the main issues we had to cope with in either directions. We have performed an extensive empirical evaluation comparing three state-of-the-art OMT-based tools with many state-of-the-art CP tools on (i) CP problems coming from the MiniZinc challenge, and (ii) OMT problems coming mostly from formal verification. This analysis also allowed us to identify some criticalities, in terms of efficiency and correctness, one has to cope with when addressing CP problems with OMT tools, and vice versa.

Includes members:
  Member "multi objective reasoning with constrained goal models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on representing and eliciting resilience requirements of microservice architecture systems")
  Member "simulation based computation of certificates for safety of dynamical systems":
    also connected through other hyperedges:
      (none)
  Member "on optimization modulo theories maxsmt and sorting networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimization modulo the theories of signed bit vectors and floating point numbers")
  Member "optimization modulo theories with linear rational costs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "semiring programming a declarative framework for generalized sum product problems")
  Member "structured learning modulo theories":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "constrained counting and sampling bridging the gap between theory and practice")
  Member "pushing the envelope of optimization modulo theories with linear arithmetic cost functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimization modulo the theories of signed bit vectors and floating point numbers")
  Member "optimization in smt with la q cost functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "model agnostic counterfactual explanations for consequential decisions")

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.LO(Logic in Computer Science)