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 "on optimization modulo theories maxsmt and sorting networks"):
  Abstract: Optimization Modulo Theories (OMT) is an extension of SMT which allows for finding models that optimize given objectives. (Partial weighted) MaxSMT --or equivalently OMT with Pseudo-Boolean objective functions, OMT+PB-- is a very-relevant strict subcase of OMT. We classify existing approaches for MaxSMT or OMT+PB in two groups: MaxSAT-based approaches exploit the efficiency of state-of-the-art MAXSAT solvers, but they are specific-purpose and not always applicable; OMT-based approaches are general-purpose, but they suffer from intrinsic inefficiencies on MaxSMT/OMT+PB problems. #R##N#We identify a major source of such inefficiencies, and we address it by enhancing OMT by means of bidirectional sorting networks. We implemented this idea on top of the OptiMathSAT OMT solver. We run an extensive empirical evaluation on a variety of problems, comparing MaxSAT-based and OMT-based techniques, with and without sorting networks, implemented on top of OptiMathSAT and {\nu}Z. The results support the effectiveness of this idea, and provide interesting insights about the different approaches.

Includes members:
  Member "multi objective reasoning with constrained goal models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "from minizinc to optimization modulo theories and back extended version")
  Member "requirements evolution and evolution requirements with constrained goal models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi objective reasoning with constrained goal models")
  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 "from minizinc to optimization modulo theories and back extended version")
  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 "from minizinc to optimization modulo theories and back extended version")
  Member "optimization in smt with la q cost functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "from minizinc to optimization modulo theories and back extended version")

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)