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 "update efficient error correcting regenerating codes"):
  Abstract: Regenerating codes provide an efficient way to recover data a t failed nodes in distributed storage systems. It has been shown that regenerating codes can be designed to minimize the per-node storage (called MSR) or minimize the communication overhead for regeneration (called MBR). In this work, we propose new encoding schemes for [n,d] error-correcting MSR and MBR codes that generalize our earlier work on error-correcting regenerating codes. We show that by choosing a suitable diagonal matrix, any generator matrix of the [n,�] Reed-Solomon (RS) code can be integrated into the encoding matrix. Hence, MSR codes with the least update complexity can be found. By using the coefficients of generator polynomials of [n,k] and [n,d] RS codes, we present a least-update-complexity encoding scheme for MBR codes. An efficient decoding scheme is propose d that utilizes the [n,�] RS code to perform data reconstruction for MSR codes. The proposed decoding scheme has better error correction capability and incurs the least number of node accesses when errors are present. A new decoding scheme is also proposed for MBR codes that can correct more error-patterns.

Includes members:
  Member "regenerating codes for errors and erasures in distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction":
    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 "byzantine fault tolerance of regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bandwidth adaptive error resilient mbr exact repair regenerating codes")
  Member "exact regenerating codes for byzantine fault tolerance in distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "searching for minimum storage regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cascade codes for distributed storage systems")
  Member "explicit construction of optimal exact regenerating codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")
  Member "network coding for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")

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.IT(Information Theory)