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 "on optimal locally repairable codes with super linear length"):
  Abstract: Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known bounds. Optimal codes are constructed, whose length is order-optimal when compared with the new upper bounds. The length of the codes is super-linear in the alphabet size.

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 "how long can optimal locally repairable codes be":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal lrc codes for all lenghts n q":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "optimal locally repairable codes of distance 3 and 4 via cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "constructive asymptotic bounds of locally repairable codes via function fields")
  Member "explicit optimal length locally repairable codes of distance 5":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "irregular recovery and unequal locality for locally recoverable codes with availability":
    also connected through other hyperedges:
      (none)
  Member "locality and availability of array codes constructed from subspaces":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on optimal locally repairable codes and generalized sector disk 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)