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: "gang ftp scheduling of periodic and parallel rigid real time tasks"
  Abstract: In this paper we consider the scheduling of periodic and parallel rigid tasks. We provide (and prove correct) an exact schedulability test for Fixed Task Priority (FTP) Gang scheduler sub-classes: Parallelism Monotonic, Idling, Limited Gang, and Limited Slack Reclaiming. Additionally, we study the predictability of our schedulers: we show that Gang FJP schedulers are not predictable and we identify several sub-classes which are actually predictable. Moreover, we extend the definition of rigid, moldable and malleable jobs to recurrent tasks.

Connected through hyperedge HE-1 (induced by source paper "rt gang real time gang scheduling framework for safety critical systems"):
  with members:
    - "denial of service attacks on shared cache in multicore analysis and prevention"
    - "protecting real time gpu kernels on integrated cpu gpu soc platforms"
    - "deeppicar a low cost deep neural network based autonomous car"
    - "end to end learning for self driving cars"

Connected through hyperedge HE-2 (induced by source paper "virtual gang based scheduling of real time tasks on multicore platforms"):
  with members:
    - "rt gang real time gang scheduling framework for safety critical systems"
    - "denial of service attacks on shared cache in multicore analysis and prevention"
    - "deeppicar a low cost deep neural network based autonomous car"

Connected through hyperedge HE-3 (induced by source paper "energy minimization for parallel real time systems with malleable jobs and homogeneous frequencies"):
  with members:
    - "integrating job parallelism in real time scheduling theory"

Connected through hyperedge HE-4 (induced by source paper "scheduling of hard real time multi thread periodic tasks"):
  with members:
    - "integrating job parallelism in real time scheduling theory"

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.OS(Operating Systems)