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: "optimization in smt with la q cost functions"
  Abstract: In the contexts of automated reasoning and formal verification, important decision problems are effectively encoded into Satisfiability Modulo Theories (SMT). In the last decade efficient SMT solvers have been developed for several theories of practical interest (e.g., linear arithmetic, arrays, bit-vectors). Surprisingly, very few work has been done to extend SMT to deal with optimization problems; in particular, we are not aware of any work on SMT solvers able to produce solutions which minimize cost functions over arithmetical variables. This is unfortunate, since some problems of interest require this functionality. #R##N#In this paper we start filling this gap. We present and discuss two general procedures for leveraging SMT to handle the minimization of LA(Q) cost functions, combining SMT with standard minimization techniques. We have implemented the proposed approach within the MathSAT SMT solver. Due to the lack of competitors in AR and SMT domains, we experimentally evaluated our implementation against state-of-the-art tools for the domain of linear generalized disjunctive programming (LGDP), which is closest in spirit to our domain, on sets of problems which have been previously proposed as benchmarks for the latter tools. The results show that our tool is very competitive with, and often outperforms, these tools on these problems, clearly demonstrating the potential of the approach.

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"
    - "pushing the envelope of optimization modulo theories with linear arithmetic cost functions"

Connected through hyperedge HE-2 (induced by source paper "model agnostic counterfactual explanations for consequential decisions"):
  with members:
    - "the what if tool interactive probing of machine learning models"
    - "counterfactual explanations without opening the black box automated decisions and the gdpr"
    - "reluplex an efficient smt solver for verifying deep neural networks"
    - "challenges for transparency"
    - "the mythos of model interpretability"
    - "safety verification of deep neural networks"

Connected through hyperedge HE-3 (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"
    - "pushing the envelope of optimization modulo theories with linear arithmetic cost functions"
    - "ilp modulo theories"

Connected through hyperedge HE-4 (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"
    - "pushing the envelope of optimization modulo theories with linear arithmetic 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-5 (induced by source paper "delta decision procedures for exists forall problems over the reals"):
  with members:
    - "a literature survey of benchmark functions for global optimisation problems"
    - "delta decidability over the reals"
    - "applications of quantified constraint solving over the reals bibliography"
    - "delta complete decision procedures for satisfiability over the reals"

Connected through hyperedge HE-6 (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"
    - "pushing the envelope of optimization modulo theories with linear arithmetic cost functions"

Connected through hyperedge HE-7 (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"
    - "pushing the envelope of optimization modulo theories with linear arithmetic cost functions"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"

Connected through hyperedge HE-8 (induced by source paper "a survey of satisfiability modulo theory"):
  with members:
    - "proof tree preserving interpolation"
    - "how to compute worst case execution time by optimization modulo theory and a clever encoding of program semantics"
    - "generating non linear interpolants by semidefinite programming"
    - "invariant generation through strategy iteration in succinctly represented control flow graphs"
    - "pagai a path sensitive static analyzer"
    - "succinct representations for abstract interpretation"
    - "on using floating point computations to help an exact linear arithmetic decision procedure"
    - "a quantifier elimination algorithm for linear real arithmetic"

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.AI(Artificial Intelligence)