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 "parity models a general framework for coding based resilience in ml inference"):
  Abstract: Machine learning models are becoming the primary workhorses for many applications. Production services deploy models through prediction serving systems that take in queries and return predictions by performing inference on machine learning models. In order to scale to high query rates, prediction serving systems are run on many machines in cluster settings, and thus are prone to slowdowns and failures that inflate tail latency and cause violations of strict latency targets. Current approaches to reducing tail latency are inadequate for the latency targets of prediction serving, incur high resource overhead, or are inapplicable to the computations performed during inference. #R##N#We present ParM, a novel, general framework for making use of ideas from erasure coding and machine learning to achieve low-latency, resource-efficient resilience to slowdowns and failures in prediction serving systems. ParM encodes multiple queries together into a single parity query and performs inference on the parity query using a parity model. A decoder uses the output of a parity model to reconstruct approximations of unavailable predictions. ParM uses neural networks to learn parity models that enable simple, fast encoders and decoders to reconstruct unavailable predictions for a variety of inference tasks such as image classification, speech recognition, and object localization. We build ParM atop an open-source prediction serving system and through extensive evaluation show that ParM improves overall accuracy in the face of unavailability with low latency while using 2-4$\times$ less additional resources than replication-based approaches. ParM reduces the gap between 99.9th percentile and median latency by up to $3.5\times$ compared to approaches that use an equal amount of resources, while maintaining the same median.

Includes members:
  Member "collage inference tolerating stragglers in distributed neural network inference using coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a locality based approach for coded computation")
  Member "pretzel opening the black box of machine learning prediction serving systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cloudburst stateful functions as a service")
  Member "mobilenetv2 inverted residuals and linear bottlenecks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "learning a code machine learning for approximate non linear coded computation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a locality based approach for coded computation")
  Member "leveraging coding techniques for speeding up distributed computing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "heterogeneous coded distributed computing joint design of file allocation and function assignment")
  Member "speeding up distributed machine learning using codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "rafiki machine learning as an analytics service system":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "automated machine learning state of the art and open challenges")
  Member "tvm an automated end to end optimizing compiler for deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the deep learning compiler a comprehensive 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)