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: "truthful online scheduling with commitments"
  Abstract: We study online mechanisms for preemptive scheduling with deadlines, with the goal of maximizing the total value of completed jobs. This problem is fundamental to deadline-aware cloud scheduling, but there are strong lower bounds even for the algorithmic problem without incentive constraints. However, these lower bounds can be circumvented under the natural assumption of deadline slackness, i.e., that there is a guaranteed lower bound s > 1 on the ratio between a job's size and the time window in which it can be executed. In this paper, we construct a truthful scheduling mechanism with a constant competitive ratio, given slackness s > 1. Furthermore, we show that if s is large enough then we can construct a mechanism that also satisfies a commitment property: it can be determined whether or not a job will finish, and the requisite payment if so, well in advance of each job's deadline. This is notable because, in practice, users with strict deadlines may find it unacceptable to discover only very close to their deadline that their job has been rejected.

Connected through hyperedge HE-1 (induced by source paper "online revenue maximization for server pricing"):
  with members:
    - "stability of service under time of use pricing"
    - "era a framework for economic resource allocation for the cloud"
    - "learning simple auctions"
    - "the sample complexity of revenue maximization"
    - "the pseudo dimension of near optimal auctions"
    - "combinatorial auctions via posted prices"

Connected through hyperedge HE-2 (induced by source paper "a framework for allocating server time to spot and on demand services in cloud computing"):
  with members:
    - "on the benefits of qos differentiated posted pricing in cloud computing an analytical model"
    - "towards designing cost optimal policies to utilize iaas clouds under online learning"
    - "a truthful 1 epsilon optimal mechanism for on demand cloud resource provisioning"
    - "spot pricing in the cloud ecosystem a comparative investigation"
    - "algorithms for scheduling deadline sensitive malleable tasks"
    - "fixed and market pricing for cloud services"

Connected through hyperedge HE-3 (induced by source paper "optimally handling commitment issues in online throughput maximization"):
  with members:
    - "a general framework for handling commitment in online throughput maximization"

Connected through hyperedge HE-4 (induced by source paper "on the cluster admission problem for cloud computing"):
  with members:
    - "overcommitment in cloud services bin packing with chance constraints"
    - "era a framework for economic resource allocation for the cloud"
    - "fixed and market pricing for cloud services"
    - "fair allocation without trade"
    - "no justified complaints on fair sharing of multiple resources"
    - "finding approximate pomdp solutions through belief compression"
    - "nonapproximability results for partially observable markov decision processes"

Connected through hyperedge HE-5 (induced by source paper "online job scheduling in distributed machine learning clusters"):
  with members:
    - "towards distributed machine learning in shared clusters a dynamically partitioned approach"
    - "tensorflow a system for large scale machine learning"
    - "deep residual learning for image recognition"
    - "batch normalization accelerating deep network training by reducing internal covariate shift"
    - "firecaffe near linear acceleration of deep neural network training on compute clusters"
    - "mxnet a flexible and efficient machine learning library for heterogeneous distributed systems"
    - "very deep convolutional networks for large scale image recognition"

Connected through hyperedge HE-6 (induced by source paper "pricing for online resource allocation intervals and paths"):
  with members:
    - "stability of service under time of use pricing"
    - "era a framework for economic resource allocation for the cloud"
    - "simple mechanisms for subadditive buyers via duality"
    - "prophet inequalities made easy stochastic optimization by pricing non stochastic inputs"
    - "mechanism design for subadditive agents via an ex ante relaxation"
    - "the invisible hand of dynamic market pricing"
    - "simple mechanisms for a subadditive buyer and applications to revenue monotonicity"
    - "a simple and approximately optimal mechanism for an additive buyer"

Connected through hyperedge HE-7 (induced by source paper "simple pricing schemes for the cloud"):
  with members:
    - "pricing multi unit markets"
    - "pricing identical items"
    - "revenue gaps for discriminatory and anonymous sequential posted pricing"
    - "prophet inequalities made easy stochastic optimization by pricing non stochastic inputs"
    - "revenue gaps for static and dynamic posted pricing of homogeneous goods"
    - "hiring secretaries over time the benefit of concurrent employment"
    - "on demand or spot selling the cloud to risk averse customers"
    - "the invisible hand of dynamic market pricing"

Connected through hyperedge HE-8 (induced by source paper "stability of service under time of use pricing"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "fast algorithms for online stochastic convex programming"
    - "combinatorial auctions via posted prices"
    - "primal beats dual on online packing lps in the random order model"
    - "sequential posted pricing and multi parameter mechanism design"
    - "online stochastic packing applied to display ad allocation"
    - "a dynamic near optimal algorithm for online linear programming"

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)