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 "a deep reinforcement learning approach to multi component job scheduling in edge computing"):
  Abstract: We are interested in the optimal scheduling of a collection of multi-component application jobs in an edge computing system that consists of geo-distributed edge computing nodes connected through a wide area network. The scheduling and placement of application jobs in an edge system is challenging due to the interdependence of multiple components of each job, and the communication delays between the geographically distributed data sources and edge nodes and their dynamic availability. In this paper we explore the feasibility of applying Deep Reinforcement Learning (DRL) based design to address these challenges. We introduce a DRL actor-critic algorithm that aims to find an optimal scheduling policy to minimize average job slowdown in the edge system. We have demonstrated through simulations that our design outperforms a few existing algorithms, based on both synthetic data and a Google cloud data trace.

Includes members:
  Member "joint service caching and task offloading for mobile edge computing in dense networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cooperative service caching and workload scheduling in mobile edge computing")
  Member "learning scheduling algorithms for data processing clusters":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "chameleon adaptive code optimization for expedited deep neural network compilation")
  Member "model free control for distributed stream data processing using deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "smart resource management for data streaming using an online bin packing strategy")
  Member "device placement optimization with reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "chameleon adaptive code optimization for expedited deep neural network compilation")
  Member "a game theoretic framework for revenue sharing in edge cloud computing system":
    also connected through other hyperedges:
      (none)
  Member "deep reinforcement learning in large discrete action spaces":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "i love your chain mail making knights smile in a fantasy game world open domain goal orientated dialogue agents")
  Member "continuous control with deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep reinforcement learning for autonomous driving a survey")

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)