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 "green data centers a survey perspectives and future directions"):
  Abstract: At present, a major concern regarding data centers is their extremely high energy consumption and carbon dioxide emissions. However, because of the over-provisioning of resources, the utilization of existing data centers is, in fact, remarkably low, leading to considerable energy waste. Therefore, over the past few years, many research efforts have been devoted to increasing efficiency for the construction of green data centers. The goal of these efforts is to efficiently utilize available resources and to reduce energy consumption and thermal cooling costs. In this paper, we provide a survey of the state-of-the-art research on green data center techniques, including energy efficiency, resource management, thermal control and green metrics. Additionally, we present a detailed comparison of the reviewed proposals. We further discuss the key challenges for future research and highlight some future research issues for addressing the problem of building green data centers.

Includes members:
  Member "new online algorithm for dynamic speed scaling with sleep state":
    also connected through other hyperedges:
      (none)
  Member "a fully polynomial time approximation scheme for speed scaling with sleep state":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parallel machine scheduling to minimize energy consumption")
  Member "sleepscale runtime joint speed scaling and sleep states management for power efficient data centers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fastcap an efficient and fair algorithm for power capping in many core systems")
  Member "throughput maximization in multiprocessor speed scaling":
    also connected through other hyperedges:
      (none)
  Member "throughput maximization in the speed scaling setting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "speed scaling with no preemptions")
  Member "energy efficient scheduling with time and processors eligibility restrictions":
    also connected through other hyperedges:
      (none)
  Member "speed scaling on parallel processors with migration":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "speed scaling with no preemptions")
  Member "scalably scheduling power heterogeneous processors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors")

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