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 "an overview of codes tailor made for better repairability in networked distributed storage systems"):
  Abstract: The continuously increasing amount of digital data generated by today's society asks for better storage solutions. This survey looks at a new generation of coding techniques designed specifically for the needs of distributed networked storage systems, trying to reach the best compromise among storage space efficiency, fault tolerance, and maintenance overheads. Four families of codes tailor-made for distributed settings, namely - pyramid, hierarchical, regenerating and self-repairing codes - are presented at a high level, emphasizing the main ideas behind each of these codes, and discussing their pros and cons, before concluding with a quantitative comparison among them. This survey deliberately excluded technical details for the codes, nor does it provide an exhaustive summary of the numerous works. Instead, it provides an overview of the major code families in a manner easily accessible to a broad audience, by presenting the big picture of advances in coding techniques for distributed storage solutions.

Includes members:
  Member "storage codes coding rate and repair locality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "locality and availability of array codes constructed from subspaces")
  Member "on locality in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "repairing generalized reed muller codes")
  Member "an empirical study of the repair performance of novel coding schemes for networked distributed storage systems":
    also connected through other hyperedges:
      (none)
  Member "cooperative regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model")
  Member "mds array codes with optimal rebuilding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "speeding up distributed machine learning using codes")
  Member "self repairing codes for distributed storage a projective geometric construction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "functional repair codes a view from projective geometry")
  Member "on the locality of codeword symbols":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a locality based approach for coded computation")
  Member "cooperative regenerating codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")

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)