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 "shortened regenerating codes"):
  Abstract: For general exact repair regenerating codes, the optimal trade-offs between storage size and repair bandwith remain undetermined. Various outer bounds and partial results have been proposed. Using a simple chain rule argument we identify nonnegative differences between the functional repair and the exact repair outer bounds. One of the differences is then bounded from below by the repair data of a shortened subcode. Our main result is a new outer bound for an exact repair regenerating code in terms of its shortened subcodes. In general the new outer bound is implicit and depends on the choice of shortened subcodes. For the linear case we obtain explicit bounds.

Includes members:
  Member "a note on the rate region of exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the achievability region of regenerating codes for multiple erasures")
  Member "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cascade codes for distributed storage systems")
  Member "layered exact repair regenerating codes via embedded error correction and block designs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cascade codes for distributed storage systems")
  Member "outer bounds for exact repair codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multilevel diversity coding with secure regeneration separate coding achieves the mbr point")
  Member "characterizing the rate region of the 4 3 3 exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "exact regenerating codes between mbr and msr points":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "local codes with cooperative repair in distributed storage system")
  Member "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the achievability region of regenerating codes for multiple erasures")
  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-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)