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 case study of algorithm selection for the traveling thief problem"):
  Abstract: Many real-world problems are composed of several interacting components. In order to facilitate research on such interactions, the Traveling Thief Problem (TTP) was created in 2013 as the combination of two well-understood combinatorial optimization problems. #R##N#With this article, we contribute in four ways. First, we create a comprehensive dataset that comprises the performance data of 21 TTP algorithms on the full original set of 9720 TTP instances. Second, we define 55 characteristics for all TPP instances that can be used to select the best algorithm on a per-instance basis. Third, we use these algorithms and features to construct the first algorithm portfolios for TTP, clearly outperforming the single best algorithm. Finally, we study which algorithms contribute most to this portfolio.

Includes members:
  Member "evolutionary computation for multicomponent problems opportunities and future directions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the node weight dependent traveling salesperson problem approximation algorithms and randomized search heuristics")
  Member "aslib a benchmark library for algorithm selection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "extreme algorithm selection with dyadic feature representation")
  Member "packing while traveling mixed integer programming for a class of nonlinear knapsack problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "analysis of baseline evolutionary algorithms for the packing while travelling problem")
  Member "a multi engine approach to answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the seventh answer set programming competition design and results")
  Member "claspfolio 2 advances in algorithm selection for answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficiently coupling the i dlv grounder with asp solvers")
  Member "algorithm runtime prediction methods evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "procrastinating with confidence near optimal anytime adaptive algorithm configuration")
  Member "algorithm selection for combinatorial search problems a survey":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lossless compression of deep neural networks")
  Member "satzilla portfolio based algorithm selection for sat":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)