human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "core augmenting regenerating coding based recovery for single and concurrent failures in distributed storage systems"
  Abstract: Data availability is critical in distributed storage systems, especially when node failures are prevalent in real life. A key requirement is to minimize the amount of data transferred among nodes when recovering the lost or unavailable data of failed nodes. This paper explores recovery solutions based on regenerating codes, which are shown to provide fault-tolerant storage and minimum recovery bandwidth. Existing optimal regenerating codes are designed for single node failures. We build a system called CORE, which augments existing optimal regenerating codes to support a general number of failures including single and concurrent failures. We theoretically show that CORE achieves the minimum possible recovery bandwidth for most cases. We implement CORE and evaluate our prototype atop a Hadoop HDFS cluster testbed with up to 20 storage nodes. We demonstrate that our CORE prototype conforms to our theoretical findings and achieves recovery bandwidth saving when compared to the conventional recovery approach based on erasure codes.

Connected through hyperedge HE-1 (induced by source paper "concurrent regenerating codes and scalable application in network storage"):
  with members:
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "exact scalar minimum storage coordinated regenerating codes"
    - "cooperative regenerating codes for distributed storage systems"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-2 (induced by source paper "codes for distributed storage from 3 regular graphs"):
  with members:
    - "a family of optimal locally recoverable codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "explicit construction of optimal exact regenerating codes for distributed storage"

Connected through hyperedge HE-3 (induced by source paper "fast product matrix regenerating codes"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "regenerating codes a system perspective"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "access vs bandwidth in codes for storage"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-4 (induced by source paper "evaluation of codes with inherent double replication for hadoop"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "codes with local regeneration"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-5 (induced by source paper "the core storage primitive cross object redundancy for efficient data repair access in erasure coded storage"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "rapidraid pipelined erasure codes for fast data archival in distributed storage systems"
    - "locally repairable codes"
    - "self repairing codes for distributed storage a projective geometric construction"
    - "on the locality of codeword symbols"
    - "cooperative regenerating codes for distributed storage systems"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"
    - "self repairing homomorphic codes for distributed storage systems"

Question: Please tell me which class the center node 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)