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: "scalably scheduling power heterogeneous processors"
  Abstract: We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted flow plus energy.

Connected through hyperedge HE-1 (induced by source paper "green data centers a survey perspectives and future directions"):
  with members:
    - "new online algorithm for dynamic speed scaling with sleep state"
    - "a fully polynomial time approximation scheme for speed scaling with sleep state"
    - "sleepscale runtime joint speed scaling and sleep states management for power efficient data centers"
    - "throughput maximization in multiprocessor speed scaling"
    - "throughput maximization in the speed scaling setting"
    - "energy efficient scheduling with time and processors eligibility restrictions"
    - "speed scaling on parallel processors with migration"
    - "polynomial time algorithms for minimum energy scheduling"

Connected through hyperedge HE-2 (induced by source paper "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"):
  with members:
    - "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
    - "online primal dual for non linear optimization with applications to speed scaling"

Connected through hyperedge HE-3 (induced by source paper "scheduling to minimize energy and flow time in broadcast scheduling"):
  with members:
    - "online primal dual for non linear optimization with applications to speed scaling"
    - "longest wait first for broadcast scheduling"
    - "minimizing maximum response time and delay factor in broadcast scheduling"
    - "nonclairvoyant speed scaling for flow and energy"

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.DS(Data Structures and Algorithms)