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 "explicit mds codes for optimal repair bandwidth"):
  Abstract: MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of#R##N#redundancy or parity symbols. If an MDS code has r parities and no more than r erasures occur, then by transmitting#R##N#all the remaining data in the code, the original information can be recovered. However, it was shown that in order#R##N#to recover a single symbol erasure, only a fraction of 1/r of the information needs to be transmitted. This fraction#R##N#is called the repair bandwidth (fraction). Explicit code constructions were given in previous works. If we view each#R##N#symbol in the code as a vector or a column over some field, then the code forms a 2D array and such codes are#R##N#especially widely used in storage systems. In this paper, we address the following question: given the length of the#R##N#column l, number of parities r, can we construct high-rate MDS array codes with optimal repair bandwidth of 1/r,#R##N#whose code length is as long as possible? In this paper, we give code constructions such that the code length is#R##N#(r +1) log_r l.

Includes members:
  Member "a framework of constructions of minimal storage regenerating codes with the optimal access update property":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a systematic construction of mds codes with small sub packetization level and near optimal repair bandwidth")
  Member "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "information theoretically secure erasure codes for distributed storage")
  Member "zigzag codes mds array codes with optimal rebuilding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "an improved sub packetization bound for minimum storage regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "interference alignment in regenerating codes for distributed storage necessity and code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "access vs bandwidth in codes for storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explicit msr codes with optimal access optimal sub packetization and small field size for d k 1 k 2 k 3")
  Member "mds array codes with optimal rebuilding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "speeding up distributed machine learning using 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-8 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")

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)