human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a multicore tool for constraint solving"):
  Abstract: *** To appear in IJCAI 2015 proceedings *** In Constraint Programming (CP), a portfolio solver uses a variety of different solvers for solving a given Constraint Satisfaction / Optimization Problem. In this paper we introduce sunny-cp2: the first parallel CP portfolio solver that enables a dynamic, cooperative, and simultaneous execution of its solvers in a multicore setting. It incorporates state-of-the-art solvers, providing also a usable and configurable framework. Empirical results are very promising. sunny-cp2 can even outperform the performance of the oracle solver which always selects the best solver of the portfolio for a given problem.

Includes members:
  Member "sunny a lazy portfolio approach for constraint solving":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the algorithm selection competitions 2015 and 2017")
  Member "claspfolio 2 advances in algorithm selection for answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficiently coupling the i dlv grounder with asp solvers")
  Member "an enhanced features extractor for a portfolio of constraint solvers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sunny cp and the minizinc challenge")
  Member "proteus a hierarchical portfolio of solvers and transformations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the algorithm selection competitions 2015 and 2017")
  Member "satzilla portfolio based algorithm selection for sat":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deciding the consistency of non linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings")

Question: Please tell me which class the source paper 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)