human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "time aware test case execution scheduling for cyber physical systems"
  Abstract: Testing cyber-physical systems involves the execution of test cases on target-machines equipped with the latest release of a software control system. When testing industrial robots, it is common that the target machines need to share some common resources, e.g., costly hardware devices, and so there is a need to schedule test case execution on the target machines, accounting for these shared resources. With a large number of such tests executed on a regular basis, this scheduling becomes difficult to manage manually. In fact, with manual test execution planning and scheduling, some robots may remain unoccupied for long periods of time and some test cases may not be executed.

Connected through hyperedge HE-1 (induced by source paper "multi cycle assignment problems with rotational diversity"):
  with members:
    - "rotational diversity in multi cycle assignment problems"
    - "reinforcement learning for automatic test case prioritization and selection in continuous integration"
    - "scheduling a dynamic aircraft repair shop with limited repair resources"
    - "robust local search for solving rcpsp max with durational uncertainty"
    - "bin completion algorithms for multicontainer packing knapsack and covering problems"
    - "negotiating socially optimal allocations of resources"

Connected through hyperedge HE-2 (induced by source paper "ite a lightweight implementation of stratified reasoning for constructive logical operators"):
  with members:
    - "the ultrametric constraint and its application to phylogenetics"
    - "efficient constraint propagation engines"

Connected through hyperedge HE-3 (induced by source paper "stratified constructive disjunction and negation in constraint programming"):
  with members:
    - "the ultrametric constraint and its application to phylogenetics"
    - "efficient constraint propagation engines"

Question: Please tell me which class the center node 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.SE(Software Engineering)