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 "extended integrated interleaved codes over any field with applications to locally recoverable codes"):
  Abstract: Integrated Interleaved (II) and Extended Integrated Interleaved (EII) codes are a versatile alternative for Locally Recoverable (LRC) codes, since they require fields of relatively small size. II and EII codes are generally defined over Reed-Solomon type of codes. A new comprehensive definition of EII codes is presented, allowing for EII codes over any field, and in particular, over the binary field $GF(2)$. The traditional definition of II and EII codes is shown to be a special case of the new definition. Improvements over previous constructions of LRC codes, in particular, for binary codes, are given, as well as cases meeting an upper bound on the minimum distance. Properties of the codes are presented as well, in particular, an iterative decoding algorithm on rows and columns generalizing the iterative decoding algorithm of product codes. Two applications are also discussed: one is finding a systematic encoding of EII codes such that the parity symbols have a balanced distribution on rows, and the other is the problem of ordering the symbols of an EII code such that the maximum length of a correctable burst is achieved.

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 "optimal lrc codes for all lenghts n q":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "constructive asymptotic bounds of locally repairable codes via function fields")
  Member "erasure coding for distributed storage an overview":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secrecy and accessibility in distributed storage")
  Member "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "bounds and constructions for linear locally repairable codes over binary fields":
    also connected through other hyperedges:
      (none)
  Member "optimal binary linear locally repairable codes with disjoint repair groups":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "codes with hierarchical locality from covering maps of curves")
  Member "extended product and integrated interleaved codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hierarchical coding to enable scalability and flexibility in heterogeneous cloud storage")

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)