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 "the core storage primitive cross object redundancy for efficient data repair access in erasure coded storage"):
  Abstract: Erasure codes are an integral part of many distributed storage systems aimed at Big Data, since they provide high fault-tolerance for low overheads. However, traditional erasure codes are inefficient on reading stored data in degraded environments (when nodes might be unavailable), and on replenishing lost data (vital for long term resilience). Consequently, novel codes optimized to cope with distributed storage system nuances are vigorously being researched. In this paper, we take an engineering alternative, exploring the use of simple and mature techniques ‐ juxtaposing a standard erasure code with RAID4 like parity. We carry out an analytical study to determine the efficacy of this approach over traditional as well as some novel codes. We build upon this study to design CORE, a general storage primitive that we integrate into HDFS. We benchmark this implementation in a proprietary cluster and in EC2. Our experiments show that compared to traditional erasure codes, CORE uses 50% less bandwidth and is up to 75% faster while recovering a single failed node, while the gains are respectively 15% and 60% for double node failures.

Includes members:
  Member "xoring elephants novel erasure codes for big data":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "core augmenting regenerating coding based recovery for single and concurrent failures in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "concurrent regenerating codes and scalable application in network storage")
  Member "rapidraid pipelined erasure codes for fast data archival in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "balanced reed solomon codes")
  Member "locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a locality based approach for coded computation")
  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")
  Member "repairing multiple failures with coordinated and adaptive regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")

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)