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 "computing sharp recovery structures for locally recoverable codes"):
  Abstract: A locally recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. In this article we develop an algorithm that computes a recovery structure as concise posible for an arbitrary linear code $\mathcal{C}$ and a recovery method that realizes it. This algorithm also provides the locality and the dual distance of $\mathcal{C}$. Complexity issues are studied as well. Several examples are included.

Includes members:
  Member "construction of optimal locally repairable codes via automorphism groups of rational function fields":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constructive asymptotic bounds of locally repairable codes via function fields")
  Member "integrated interleaved codes as locally recoverable codes properties and performance":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spatially coupled ldpc codes with sub block locality")
  Member "cyclic lrc codes and their subfield subcodes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "locally recoverable j affine variety codes")
  Member "locally recoverable codes on algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "optimal locally repairable and secure codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "a family of optimal locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a locality based approach for coded computation")
  Member "on the ideal associated to a linear code":
    also connected through other hyperedges:
      (none)
  Member "locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a locality based approach for coded computation")

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)