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 "on the cluster admission problem for cloud computing"):
  Abstract: Cloud computing providers must handle heterogeneous customer workloads for resources such as (virtual) CPU or GPU cores. This is particularly challenging if customers, who are already running a job on a cluster, scale their resource usage up and down over time. The provider therefore has to continuously decide whether she can add additional workloads to a given cluster or if doing so would impact existing workloads' ability to scale. Currently, this is often done using simple threshold policies to reserve large parts of each cluster, which leads to low average utilization of the cluster. In this paper, we propose more sophisticated policies for controlling admission to a cluster and demonstrate that they significantly increase cluster utilization. We first introduce the cluster admission problem and formalize it as a constrained Partially Observable Markov Decision Process (POMDP). As it is infeasible to solve the POMDP optimally, we then systematically design heuristic admission policies that estimate moments of each workload's distribution of future resource usage. Via simulations we show that our admission policies lead to a substantial improvement over the simple threshold policy. We then evaluate how much further this can be improved with learned or elicited prior information and how to incentivize users to provide this information.

Includes members:
  Member "overcommitment in cloud services bin packing with chance constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dynamic resource allocation in the cloud with near optimal efficiency")
  Member "era a framework for economic resource allocation for the cloud":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online revenue maximization for server pricing")
  Member "truthful online scheduling with commitments":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online revenue maximization for server pricing")
  Member "fixed and market pricing for cloud services":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a framework for allocating server time to spot and on demand services in cloud computing")
  Member "fair allocation without trade":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient multi resource multi unit vcg auction")
  Member "no justified complaints on fair sharing of multiple resources":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient multi resource multi unit vcg auction")
  Member "finding approximate pomdp solutions through belief compression":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a hamilton jacobi reachability based framework for predicting and analyzing human motion for safe planning")
  Member "nonapproximability results for partially observable markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "despot online pomdp planning with regularization")

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)