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 "fast product matrix regenerating codes"):
  Abstract: A class of product-matrix (PM) regenerating codes named sparse-PM regenerating codes for fault-tolerance protection in distributed storage systems is provided, designed for enhanced network bandwidth and computational performance. The codes are based on Vandermonde or Cauchy matrices. In particular, linear and/or systematic sparse-PM regenerating codes permit fast computations, allowing throughputs of up to about 800 MBps for typical settings. These throughputs are compatible with current practical deployments of erasure codes while presenting significant improvement in network bandwidth (network related repair cost). Methods and apparatuses for encoding, regenerating and decoding data for fault-tolerance in a distributed storage system are also provided by using sparse-PM regenerating codes.

Includes members:
  Member "core augmenting regenerating coding based recovery for single and concurrent failures in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "concurrent regenerating codes and scalable application in network storage")
  Member "zigzag codes mds array codes with optimal rebuilding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "regenerating codes a system perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "alpha entanglement codes practical erasure codes to archive data in unreliable environments")
  Member "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "interference alignment in regenerating codes for distributed storage necessity and code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "access vs bandwidth in codes for storage":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit msr codes with optimal access optimal sub packetization and small field size for d k 1 k 2 k 3")
  Member "locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a locality based approach for coded computation")

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)