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: "sunny a lazy portfolio approach for constraint solving"
  Abstract: Within the context of constraint solving, a portfolio approach allows one to exploit the synergy between different solvers in order to create a globally better solver. In this paper we present SUNNY: a simple and flexible algorithm that takes advantage of a portfolio of constraint solvers in order to compute — without learning an explicit model — a schedule of them for solving a given Constraint Satisfaction Problem (CSP). Motivated by the performance reached by SUNNY vs. different simulations of other state of the art approaches, we developed  sunny-csp , an effective portfolio solver that exploits the underlying SUNNY algorithm in order to solve a given CSP. Empirical tests conducted on exhaustive benchmarks of MiniZinc models show that the actual performance of  sunny-csp  conforms to the predictions. This is encouraging both for improving the power of CSP portfolio solvers and for trying to export them to fields such as Answer Set Programming and Constraint Logic Programming.

Connected through hyperedge HE-1 (induced by source paper "the algorithm selection competitions 2015 and 2017"):
  with members:
    - "aslib a benchmark library for algorithm selection"
    - "openml networked science in machine learning"
    - "a multi engine approach to answer set programming"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "proteus a hierarchical portfolio of solvers and transformations"
    - "a bayesian approach to tackling hard computational problems"
    - "llama leveraging learning to automatically manage algorithms"
    - "algorithm runtime prediction methods evaluation"

Connected through hyperedge HE-2 (induced by source paper "the algorithm selection competition series 2015 17"):
  with members:
    - "aslib a benchmark library for algorithm selection"
    - "openml networked science in machine learning"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "proteus a hierarchical portfolio of solvers and transformations"
    - "a bayesian approach to tackling hard computational problems"
    - "llama leveraging learning to automatically manage algorithms"
    - "auto weka combined selection and hyperparameter optimization of classification algorithms"

Connected through hyperedge HE-3 (induced by source paper "sunny cp and the minizinc challenge"):
  with members:
    - "a multicore tool for constraint solving"
    - "an enhanced features extractor for a portfolio of constraint solvers"
    - "algorithm runtime prediction methods evaluation"
    - "algorithm selection for combinatorial search problems a survey"

Connected through hyperedge HE-4 (induced by source paper "aslib a benchmark library for algorithm selection"):
  with members:
    - "openml networked science in machine learning"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "an enhanced features extractor for a portfolio of constraint solvers"
    - "proteus a hierarchical portfolio of solvers and transformations"
    - "llama leveraging learning to automatically manage algorithms"
    - "algorithm runtime prediction methods evaluation"
    - "algorithm selection for combinatorial search problems a survey"
    - "auto weka combined selection and hyperparameter optimization of classification algorithms"

Connected through hyperedge HE-5 (induced by source paper "a multicore tool for constraint solving"):
  with members:
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "an enhanced features extractor for a portfolio of constraint solvers"
    - "proteus a hierarchical portfolio of solvers and transformations"
    - "satzilla portfolio based algorithm selection for sat"

Connected through hyperedge HE-6 (induced by source paper "algorithm selection for combinatorial search problems a survey"):
  with members:
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "proteus a hierarchical portfolio of solvers and transformations"
    - "a bayesian approach to tackling hard computational problems"
    - "algorithm portfolio design theory vs practice"
    - "new techniques for algorithm portfolio design"
    - "rational deployment of csp heuristics"
    - "machine learning for constraint solver design a case study for the alldifferent constraint"
    - "restart strategy selection using machine learning techniques"

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)