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 "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.

Includes members:
  Member "symbiosis of search and heuristics for random 3 sat":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "guiding high performance sat solvers with unsat core predictions")
  Member "llama leveraging learning to automatically manage algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the algorithm selection competitions 2015 and 2017")
  Member "algorithm selection for combinatorial search problems a survey":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lossless compression of deep neural networks")
  Member "machine learning for constraint solver design a case study for the alldifferent constraint":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algorithm selection for combinatorial search problems a survey")
  Member "xml representation of constraint networks format xcsp 2 1":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "message passing and combinatorial optimization")
  Member "restart strategy selection using machine learning techniques":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "extreme algorithm selection with dyadic feature representation")
  Member "satzilla portfolio based algorithm selection for sat":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)