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: "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.

Connected through hyperedge HE-1 (induced by source paper "optimal systematic distributed storage codes with fast encoding"):
  with members:
    - "generalization of rashmi shah kumar minimum storage regenerating codes"
    - "xoring elephants novel erasure codes for big data"
    - "when do redundant requests reduce latency"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "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"

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)