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 "oversketched newton fast convex optimization for serverless systems"):
  Abstract: Motivated by recent developments in serverless systems for large-scale machine learning as well as improvements in scalable randomized matrix algorithms, we develop OverSketched Newton, a randomized Hessian-based optimization algorithm to solve large-scale smooth and strongly-convex problems in serverless systems. OverSketched Newton leverages matrix sketching ideas from Randomized Numerical Linear Algebra to compute the Hessian approximately. These sketching methods lead to inbuilt resiliency against stragglers that are a characteristic of serverless architectures. We establish that OverSketched Newton has a linear-quadratic convergence rate, and we empirically validate our results by solving large-scale supervised learning problems on real-world datasets. Experiments demonstrate a reduction of ~50% in total running time on AWS Lambda, compared to state-of-the-art distributed optimization schemes.

Includes members:
  Member "cloud programming simplified a berkeley view on serverless computing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "serverless straggler mitigation using local error correcting codes")
  Member "harnessing the power of serverless runtimes for large scale optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "serverless computing a survey of opportunities challenges and applications")
  Member "serverless computing one step forward two steps back":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "serverless straggler mitigation using local error correcting codes")
  Member "a distributed second order algorithm you can trust":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "async a cloud engine with asynchrony and history for distributed machine learning")
  Member "speeding up distributed machine learning using codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "numpywren serverless linear algebra":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cloudburst stateful functions as a service")
  Member "oversketch approximate matrix multiplication for the cloud":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "serverless straggler mitigation using local error correcting codes")
  Member "giant globally improved approximate newton method for distributed optimization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "convergence of distributed stochastic variance reduced methods without sampling extra data")

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)