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 "matroid theory and storage codes bounds and constructions"):
  Abstract: Recent research on distributed storage systems (DSSs) has revealed interesting connections between matroid theory and locally repairable codes (LRCs). The goal of this chapter is to introduce the reader to matroids and polymatroids, and illustrate their relation to distributed storage systems. While many of the results are rather technical in nature, effort is made to increase accessibility via simple examples. The chapter embeds all the essential features of LRCs, namely locality, availability, and hierarchy alongside with related generalised Singleton bounds.

Includes members:
  Member "locally recoverable codes from algebraic curves and surfaces":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "improved singleton type bounds for locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounds on binary locally repairable codes tolerating multiple erasures")
  Member "constructions and properties of linear locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "alphabet dependent bounds for linear locally repairable codes based on residual codes")
  Member "codes with hierarchical locality":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal binary locally repairable codes via anticodes":
    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 "pir with low storage overhead coding instead of replication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "bounds for batch codes with restricted query size":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "array codes for functional pir and batch codes")
  Member "applications of polymatroid theory to distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "batch and pir codes and their connections to locally repairable 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)