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 "access vs bandwidth in codes for storage"):
  Abstract: Maximum distance separable (MDS) codes are widely used in storage systems to protect against disks (nodes) failures. An (n, k, l) MDS code uses n nodes of capacity l to store k information nodes. The MDS property guarantees the resiliency to any n − k node failures. An optimal bandwidth (resp. optimal access) MDS code communicates (resp. accesses) the minimum amount of data during the recovery process of a single failed node. It was shown that this amount equals a fraction of 1/(n − k) of data stored in each node. In previous optimal bandwidth constructions, l scaled polynomially with k in codes with asymptotic rate < 1. Moreover, in constructions with constant number of parities, i.e. rate approaches 1, l scaled exponentially w.r.t. k. In this paper we focus on the practical case of n − k = 2, and ask the following question: Given the capacity of a node l what is the largest (w.r.t. k) optimal bandwidth (resp. access) (k + 2, k, l) MDS code. We give an upper bound for the general case, and two tight bounds in the special cases of two important families of codes.

Includes members:
  Member "zigzag codes mds array codes with optimal rebuilding":
    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 "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff":
    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 "interference alignment in regenerating codes for distributed storage necessity and code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "mds array codes with optimal rebuilding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "speeding up distributed machine learning using codes")
  Member "repair optimal erasure codes through hadamard designs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "on codes for optimal rebuilding access":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a systematic construction of mds codes with small sub packetization level and near optimal repair bandwidth")
  Member "distributed storage codes through hadamard designs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit mds codes for optimal repair bandwidth")
  Member "enabling node repair in any erasure code for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")

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)