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 review of literature on parallel constraint solving"):
  Abstract: As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it. Researchers need to address a number of issues to exploit parallelism, such as: investigating which constraint algorithms are amenable to parallelisation; whether to use shared memory or distributed computation; whether to use static or dynamic decomposition; and how to best exploit portfolios and cooperating search. We review the literature, and see that we can sometimes do quite well, some of the time, on some instances, but we are far from a general solution. Yet there seems to be little overall guidance that can be given on how best to exploit multicore computers to speed up constraint solving. We hope at least that this survey will provide useful pointers to future researchers wishing to correct this situation. #R##N#Under consideration in Theory and Practice of Logic Programming (TPLP).

Includes members:
  Member "parallel strategies selection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning robust search strategies using a bandit based approach")
  Member "solving and verifying the boolean pythagorean triples problem via cube and conquer":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nonexistence certificates for ovals in a projective plane of order ten")
  Member "a multicore tool for constraint solving":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "constraint programming for flexible service function chaining deployment")
  Member "hordesat a massively parallel portfolio sat solver":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computing storyline visualizations with few block crossings")
  Member "the shape of the search tree for the maximum clique problem and the implications for parallel branch and bound":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "replicable parallel branch and bound search")
  Member "proteus a hierarchical portfolio of solvers and transformations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the algorithm selection competitions 2015 and 2017")
  Member "asymmetric distributed constraint optimization problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "pt isabb a hybrid tree based complete algorithm to solve asymmetric distributed constraint optimization problems")
  Member "algorithm selection for combinatorial search problems a survey":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "lossless compression of deep neural networks")

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)