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 "alphabet dependent bounds for linear locally repairable codes based on residual codes"):
  Abstract: Locally repairable codes (LRC) have gained significant interest for the design of large distributed storage systems as they allow any small number of erased nodes to be recovered by accessing only a few others. Several works have thus been done to understand optimal rate-distance tradeoff and only recently the size of the alphabet has been taken into account. In this paper, a novel definition of locality is proposed to address the imprecision on the number of nodes contacted during the repair process. Then, a new alphabet-dependent bound is derived that applies to both definitions and shows better results than the currently known bounds. The bound is based on consecutive residual codes and intrinsically uses the Griesmer bound. Achievability results are also provided by considering the family of Simplex codes together with sporadic examples of optimal codes.

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 "matroid theory and storage codes bounds and constructions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complete hierarchical locality of the punctured simplex code")
  Member "mds code constructions with small sub packetization and near optimal repair bandwidth":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "bounds on binary locally repairable codes tolerating multiple erasures":
    also connected through other hyperedges:
      (none)
  Member "constructions and properties of linear locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "matroid theory and storage codes bounds and constructions")
  Member "optimal linear and cyclic locally repairable codes over small fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complete hierarchical locality of the punctured simplex code")
  Member "cooperative local repair in distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "locally recoverable j affine variety codes")
  Member "storage capacity of repairable networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on an equivalence between single server pir with side information and locally recoverable 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)