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: "proteus a hierarchical portfolio of solvers and transformations"
  Abstract: In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There are also a number of different encodings for representing CSPs as SAT instances. In this paper, we leverage advances in both SAT and CSP solving to present a novel hierarchical portfolio-based approach to CSP solving, which we call Proteus, that does not rely purely on CSP solvers. Instead, it may decide that it is best to encode a CSP problem instance into SAT, selecting an appropriate encoding and a corresponding SAT solver. Our experimental evaluation used an instance of Proteus that involved four CSP solvers, three SAT encodings, and six SAT solvers, evaluated on the most challenging problem instances from the CSP solver competitions, involving global and intensional constraints. We show that significant performance improvements can be achieved by Proteus obtained by exploiting alternative view-points and solvers for combinatorial problem-solving.

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"
    - "sunny a lazy portfolio approach for constraint solving"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "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 "a review of literature on parallel constraint solving"):
  with members:
    - "parallel strategies selection"
    - "solving and verifying the boolean pythagorean triples problem via cube and conquer"
    - "a multicore tool for constraint solving"
    - "hordesat a massively parallel portfolio sat solver"
    - "the shape of the search tree for the maximum clique problem and the implications for parallel branch and bound"
    - "asymmetric distributed constraint optimization problems"
    - "algorithm selection for combinatorial search problems a survey"
    - "distributed solving through model splitting"

Connected through hyperedge HE-3 (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"
    - "sunny a lazy portfolio approach for constraint solving"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "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-4 (induced by source paper "learning robust search strategies using a bandit based approach"):
  with members:
    - "correlation heuristics for constraint programming"
    - "parallel strategies selection"
    - "activity based search for black box contraint programming solvers"

Connected through hyperedge HE-5 (induced by source paper "aslib a benchmark library for algorithm selection"):
  with members:
    - "openml networked science in machine learning"
    - "sunny a lazy portfolio approach for constraint solving"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "an enhanced features extractor for a portfolio of constraint solvers"
    - "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-6 (induced by source paper "a multicore tool for constraint solving"):
  with members:
    - "sunny a lazy portfolio approach for constraint solving"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "an enhanced features extractor for a portfolio of constraint solvers"
    - "satzilla portfolio based algorithm selection for sat"

Connected through hyperedge HE-7 (induced by source paper "llama leveraging learning to automatically manage algorithms"):
  with members:
    - "algorithm selection for combinatorial search problems a survey"
    - "satzilla portfolio based algorithm selection for sat"

Connected through hyperedge HE-8 (induced by source paper "algorithm selection for combinatorial search problems a survey"):
  with members:
    - "sunny a lazy portfolio approach for constraint solving"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "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)