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: "claspfolio 2 advances in algorithm selection for answer set programming"
  Abstract: To appear in Theory and Practice of Logic Programming (TPLP). Building on the award-winning, portfolio-based ASP solver claspfolio, we present claspfolio 2, a modular and open solver architecture that integrates several different portfolio-based algorithm selection approaches and techniques. The claspfolio 2 solver framework supports various feature generators, solver selection approaches, solver portfolios, as well as solver-schedule-based pre-solving techniques. The default configuration of claspfolio 2 relies on a light-weight version of the ASP solver clasp to generate static and dynamic instance features. The flexible open design of claspfolio 2 is a distinguishing factor even beyond ASP. As such, it provides a unique framework for comparing and combining existing portfolio-based algorithm selection approaches and techniques in a single, unified framework. Taking advantage of this, we conducted an extensive experimental study to assess the impact of different feature sets, selection approaches and base solver portfolios. In addition to gaining substantial insights into the utility of the various approaches and techniques, we identified a default configuration of claspfolio 2 that achieves substantial performance gains not only over clasp's default configuration and the earlier version of claspfolio 2, but also over manually tuned configurations of clasp.

Connected through hyperedge HE-1 (induced by source paper "efficiently coupling the i dlv grounder with asp solvers"):
  with members:
    - "combining answer set programming and domain heuristics for solving hard industrial problems application paper"
    - "anytime answer set optimization via unsatisfiable core shrinking"
    - "asperix a first order forward chaining approach for answer set computing"
    - "predicate logic as a modeling language modeling and solving some machine learning and data mining problems with idp3"
    - "a multi engine approach to answer set programming"
    - "team building with answer set programming in the gioia tauro seaport"
    - "satzilla portfolio based algorithm selection for sat"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-2 (induced by source paper "exploiting partial knowledge in declarative domain specific heuristics for asp"):
  with members:
    - "the seventh answer set programming competition design and results"
    - "degrees of laziness in grounding effects of lazy grounding strategies on asp solving"
    - "combining answer set programming and domain heuristics for solving hard industrial problems application paper"
    - "asperix a first order forward chaining approach for answer set computing"
    - "clingo asp control preliminary report"
    - "team building with answer set programming in the gioia tauro seaport"
    - "logic programs with propositional connectives and aggregates"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-3 (induced by source paper "encoding selection for solving hamiltonian cycle problems with asp"):
  with members:
    - "automated algorithm selection survey and perspectives"
    - "lpopt a rule optimization tool for answer set programming"
    - "a multi engine approach to answer set programming"
    - "satzilla portfolio based algorithm selection for sat"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-4 (induced by source paper "research report on automatic synthesis of local search neighborhood operators"):
  with members:
    - "generating local search neighborhood with synthesized logic programs"
    - "a multi engine approach to answer set programming"

Connected through hyperedge HE-5 (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"
    - "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-6 (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"
    - "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-7 (induced by source paper "automated algorithm selection survey and perspectives"):
  with members:
    - "coco a platform for comparing continuous optimizers in a black box setting"
    - "aslib a benchmark library for algorithm selection"
    - "auto weka combined selection and hyperparameter optimization of classification algorithms"
    - "analyzing search topology without running any search on the connection between causal graphs and h"
    - "the fast downward planning system"
    - "planning through stochastic local search and temporal action graphs in lpg"

Connected through hyperedge HE-8 (induced by source paper "predicting runtime distributions using deep neural networks"):
  with members:
    - "restart strategy selection using machine learning techniques"
    - "satzilla portfolio based algorithm selection for sat"

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)