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: "league championship algorithm based job scheduling scheme for infrastructure as a service cloud"
  Abstract: In this research work, we proposed a job scheduling algorithm based on the LCA optimization technique for the IaaS cloud. Two other well established algorithms i.e. First Come First Served (FCFS) and Last Job First (LJF) were used to evaluate the performance of the proposed algorithm. The parameters used for measuring the scheduling algorithms in this experiment are based on three factors - Average Response Time, Makespan Time, and the Average Completion Time. The data set was formed by using workload 5000 processes (jobs). The experiment was performed by varying the number of virtual machines in the IaaS cloud from 10 to 130. All three algorithms assumed to be non-preemptive.

Connected through hyperedge HE-1 (induced by source paper "a survey of league championship algorithm prospects and challenges"):
  with members:
    - "tasks scheduling technique using league championship algorithm for makespan minimization in iaas cloud"
    - "grid based search technique for massive academic publications"
    - "on demand grid provisioning using cloud infrastructures and related virtualization tools a survey and taxonomy"

Connected through hyperedge HE-2 (induced by source paper "tasks scheduling technique using league championship algorithm for makespan minimization in iaas cloud"):
  with members:
    - "grid based search technique for massive academic publications"
    - "on demand grid provisioning using cloud infrastructures and related virtualization tools a survey and taxonomy"

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.DC(Distributed, Parallel, and Cluster Computing)