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 "linear programming bounds for distributed storage codes"):
  Abstract: A major issue of locally repairable codes is their robustness. If a local repair group is not able to perform the repair process, this will result in increasing the repair cost. Therefore, it is critical for a locally repairable code to have multiple repair groups. In this paper we consider robust locally repairable coding schemes which guarantee that there exist multiple alternative local repair groups for any single failure such that the failed node can still be repaired locally even if some of the repair groups are not available. We use linear programming techniques to establish upper bounds on the code size of these codes. Furthermore, we address the update efficiency problem of the distributed data storage networks. Any modification on the stored data will result in updating the content of the storage nodes. Therefore, it is essential to minimise the number of nodes which need to be updated by any change in the stored data. We characterise the update-efficient storage code properties and establish the necessary conditions that the weight enumerator of these codes need to satisfy.

Includes members:
  Member "combinatorial alphabet dependent bounds for locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "rate optimal binary linear locally repairable codes with small availability":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analyzing the download time of availability codes")
  Member "bounds and constructions of codes with multiple localities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "codes with unequal locality":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "private information retrieval from locally repairable databases with colluding servers")
  Member "locality and availability in distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "repair locality from a combinatorial perspective":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures")
  Member "optimal locally repairable and secure codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "codes with locality for two erasures":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)