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 bound on rate of codes with locality with sequential recovery from multiple erasures"):
  Abstract: In this paper, we derive an upper bound on rate of a code with locality with sequential recovery from multiple erasures for any $r \geq 3$ and any $t>0$ . We also give a construction of codes achieving our rate bound for any $r$ and $t \in 2\mathbb{Z_{+}}$.

Includes members:
  Member "binary codes with locality for multiple erasures having short block length":
    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 "on sequential locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a rate optimal construction of codes with sequential recovery with low block length")
  Member "binary codes with locality for four erasures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "binary locally repairable codes sequential repair for multiple erasures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "some improvements on locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "binary codes with locality for multiple erasures having short block length")
  Member "locally repairable codes with functional repair and multiple erasure tolerance":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "binary linear locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "bounds on the parameters of locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)