human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "pushing the envelope of optimization modulo theories with linear arithmetic cost functions"
  Abstract: In the last decade we have witnessed an impressive progress in the expressiveness and efficiency of Satisfiability Modulo Theories (SMT) solving techniques. This has brought previously-intractable problems at the reach of state-of-the-art SMT solvers, in particular in the domain of SW and HW verification. Many SMT-encodable problems of interest, however, require also the capability of finding models that are optimal wrt. some cost functions. In previous work, namely "Optimization Modulo Theory with Linear Rational Cost Functions -- OMT(LAR U T )", we have leveraged SMT solving to handle the minimization of cost functions on linear arithmetic over the rationals, by means of a combination of SMT and LP minimization techniques. In this paper we push the envelope of our OMT approach along three directions: first, we extend it to work also with linear arithmetic on the mixed integer/rational domain, by means of a combination of SMT, LP and ILP minimization techniques; second, we develop a multi-objective version of OMT, so that to handle many cost functions simultaneously; third, we develop an incremental version of OMT, so that to exploit the incrementality of some OMT-encodable problems. An empirical evaluation performed on OMT-encoded verification problems demonstrates the usefulness and efficiency of these extensions.

Connected through hyperedge HE-1 (induced by source paper "from minizinc to optimization modulo theories and back extended version"):
  with members:
    - "multi objective reasoning with constrained goal models"
    - "simulation based computation of certificates for safety of dynamical systems"
    - "on optimization modulo theories maxsmt and sorting networks"
    - "optimization modulo theories with linear rational costs"
    - "structured learning modulo theories"
    - "optimization in smt with la q cost functions"

Connected through hyperedge HE-2 (induced by source paper "optimization modulo the theories of signed bit vectors and floating point numbers"):
  with members:
    - "on optimization modulo theories maxsmt and sorting networks"
    - "optimization modulo theories with linear rational costs"
    - "ilp modulo theories"
    - "optimization in smt with la q cost functions"

Connected through hyperedge HE-3 (induced by source paper "multi objective reasoning with constrained goal models"):
  with members:
    - "requirements evolution and evolution requirements with constrained goal models"
    - "optimization modulo theories with linear rational costs"
    - "optimization in smt with la q cost functions"
    - "computing small unsatisfiable cores in satisfiability modulo theories"
    - "revisiting the core ontology and problem in requirements engineering"
    - "a new general method to generate random modal formulae for testing decision procedures"

Connected through hyperedge HE-4 (induced by source paper "on optimization modulo theories maxsmt and sorting networks"):
  with members:
    - "multi objective reasoning with constrained goal models"
    - "requirements evolution and evolution requirements with constrained goal models"
    - "optimization modulo theories with linear rational costs"
    - "structured learning modulo theories"
    - "optimization in smt with la q cost functions"

Connected through hyperedge HE-5 (induced by source paper "on the synthesis of guaranteed quality plans for robot fleets in logistics scenarios via optimization modulo theories"):
  with members:
    - "optimization modulo theories with linear rational costs"
    - "optimization in smt with la q cost functions"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"

Connected through hyperedge HE-6 (induced by source paper "counterexample guided inductive optimization"):
  with members:
    - "optimization modulo theories with linear rational costs"
    - "a literature survey of benchmark functions for global optimisation problems"
    - "smt based bounded model checking for embedded ansi c software"

Connected through hyperedge HE-7 (induced by source paper "structured learning modulo theories"):
  with members:
    - "optimization modulo theories with linear rational costs"
    - "probabilistic similarity logic"
    - "church a language for generative models"
    - "inference in probabilistic logic programs with continuous random variables"
    - "lifted relational variational inference"
    - "optimization in smt with la q cost functions"
    - "lifted inference for relational continuous models"
    - "the magic of logical inference in probabilistic programming"

Question: Please tell me which class the center node 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)