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 product and integrated interleaved codes"):
  Abstract: A new class of codes, Extended Product (EPC) Codes, consisting of a product code with a number of extra parities added, is presented and applications for erasure decoding are discussed. An upper bound on the minimum distance of EPC codes is given, as well as constructions meeting the bound for some relevant cases. A special case of EPC codes, Extended Integrated Interleaved (EII) codes, which naturally unify Integrated Interleaved (II) codes and product codes, is defined and studied in detail. It is shown that EII codes often improve the minimum distance of II codes with the same rate, and they enhance the decoding algorithm by allowing decoding on columns as well as on rows. It is also shown that EII codes allow for encoding II codes with an uniform distribution of the parity symbols.

Includes members:
  Member "multi block interleaved codes for local and global read access":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spatially coupled ldpc codes with sub block locality")
  Member "maximally recoverable codes for grid like topologies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "repair rate lower bounds for distributed storage")
  Member "bounds and constructions of codes with multiple localities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "new constructions of sd and mr codes over small finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximally recoverable codes with hierarchical locality")
  Member "integrated interleaved codes as locally recoverable codes properties and performance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spatially coupled ldpc codes with sub block locality")
  Member "generalized and extended product codes":
    also connected through other hyperedges:
      (none)
  Member "density evolution for deterministic generalized product codes on the binary erasure channel at high rates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "binary message passing decoding of product like codes")
  Member "repair locality with multiple erasure tolerance":
    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)