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 "multi cycle assignment problems with rotational diversity"):
  Abstract: Multi-cycle assignment problems address scenarios where a series of general assignment problems has to be solved sequentially. Subsequent cycles can differ from previous ones due to changing availability or creation of tasks and agents, which makes an upfront static schedule infeasible and introduces uncertainty in the task-agent assignment process. We consider the setting where, besides profit maximization, it is also desired to maintain diverse assignments for tasks and agents, such that all tasks have been assigned to all agents over subsequent cycles. This problem of multi-cycle assignment with rotational diversity is approached in two sub-problems: The outer problem which augments the original profit maximization objective with additional information about the state of rotational diversity while the inner problem solves the adjusted general assignment problem in a single execution of the model. We discuss strategies to augment the profit values and evaluate them experimentally. The method's efficacy is shown in three case studies: multi-cycle variants of the multiple knapsack and the multiple subset sum problems, and a real-world case study on the test case selection and assignment problem from the software engineering domain.

Includes members:
  Member "rotational diversity in multi cycle assignment problems":
    also connected through other hyperedges:
      (none)
  Member "reinforcement learning for automatic test case prioritization and selection in continuous integration":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enhancing dynamic symbolic execution by automatically learning search heuristics")
  Member "time aware test case execution scheduling for cyber physical systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ite a lightweight implementation of stratified reasoning for constructive logical operators")
  Member "scheduling a dynamic aircraft repair shop with limited repair resources":
    also connected through other hyperedges:
      (none)
  Member "robust local search for solving rcpsp max with durational uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic stochastic orienteering problems for risk aware applications")
  Member "bin completion algorithms for multicontainer packing knapsack and covering problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards bin packing preliminary problem survey models with multiset estimates")
  Member "negotiating socially optimal allocations of resources":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "why not give this work to them explaining ai moderated task allocation outcomes using negotiation trees")

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)