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 "a family of optimal locally recoverable codes"):
  Abstract: A code over a finite alphabet is called locally recoverable (LRC) if every symbol in the encoding is a function of a small number (at most #N# r#N# ) other symbols. We present a family of LRC codes that attain the maximum possible value of the distance for a given locality parameter and code cardinality. The codewords are obtained as evaluations of specially constructed polynomials over a finite field, and reduce to a Reed-Solomon code if the locality parameter #N# r#N# is set to be equal to the code dimension. The size of the code alphabet for most parameters is only slightly greater than the code length. The recovery procedure is performed by polynomial interpolation over #N# r#N# points. We also construct codes with several disjoint recovering sets for every symbol. This construction enables the system to conduct several independent and simultaneous recovery processes of a specific symbol by accessing different parts of the codeword. This property enables high availability of frequently accessed data (“hot data”).

Includes members:
  Member "bounds on locally recoverable codes with multiple recovering sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "explicit maximally recoverable codes with locality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "update efficiency and local repairability limits for capacity approaching codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "achieving multi port memory performance on single port memory with coding techniques")
  Member "on the locality of codeword symbols in non linear codes":
    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 "zigzag codes mds array codes with optimal rebuilding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "optimal locally repairable codes via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "locally repairable codes with multiple repair alternatives":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "array codes for functional pir and batch codes")
  Member "an upper bound on the size of locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the complete hierarchical locality of the punctured simplex code")

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)