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: "multi objective reasoning with constrained goal models"
  Abstract: Goal models have been widely used in computer science to represent software requirements, business objectives, and design qualities. Existing goal modelling techniques, however, have shown limitations of expressiveness and/or tractability in coping with complex real-world problems. In this work, we exploit advances in automated reasoning technologies, notably satisfiability and optimization modulo theories (SMT/OMT), and we propose and formalize: (1) an extended modelling language for goals, namely the constrained goal model (CGM), which makes explicit the notion of goal refinement and of domain assumption, allows for expressing preferences between goals and refinements and allows for associating numerical attributes to goals and refinements for defining constraints and optimization goals over multiple objective functions, refinements, and their numerical attributes; (2) a novel set of automated reasoning functionalities over CGMs, allowing for automatically generating suitable refinements of input CGMs, under user-specified assumptions and constraints, that also maximize preferences and optimize given objective functions. We have implemented these modelling and reasoning functionalities in a tool, named CGM-Tool, using the OMT solver OptiMathSAT as automated reasoning backend. Moreover, we have conducted an experimental evaluation on large CGMs to support the claim that our proposal scales well for goal models with 1000s of elements.

Connected through hyperedge HE-1 (induced by source paper "from minizinc to optimization modulo theories and back extended version"):
  with members:
    - "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"
    - "optimization in smt with la q cost functions"

Connected through hyperedge HE-2 (induced by source paper "on representing and eliciting resilience requirements of microservice architecture systems"):
  with members:
    - "a pattern language for high performance computing resilience"
    - "about microservices containers and their underestimated impact on network performance"
    - "microservices how to make your application scale"
    - "circuit breakers discovery and api gateways in microservices"

Connected through hyperedge HE-3 (induced by source paper "specifying and reasoning about contextual preferences in the goal oriented requirements modelling"):
  with members:
    - "istar 2 0 language guide"

Connected through hyperedge HE-4 (induced by source paper "on optimization modulo theories maxsmt and sorting networks"):
  with members:
    - "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"
    - "optimization in smt with la q cost functions"

Connected through hyperedge HE-5 (induced by source paper "short er reasoning about larger requirements models"):
  with members:
    - "tuning for software analytics"

Connected through hyperedge HE-6 (induced by source paper "requirements evolution and evolution requirements with constrained goal models"):
  with members:
    - "optimization modulo theories with linear rational costs"

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)