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 "binary codes with locality for multiple erasures having short block length"):
  Abstract: This paper considers linear, binary codes having locality parameter r, that are capable of recovering from t ≥ 2 erasures and which additionally, possess short block length. Both sequential and parallel (through orthogonal parity checks) recovery are considered. In the case of sequential repair, the results include (a) extending and characterizing minimum-block-length constructions for t = 2, (b) providing improved bounds on block length for t = 3 as well as a general construction for t = 3 having short block length, (c) providing high-rate constructions for (r = 2, t ∈ {4, 5, 6, 7}) and (d) providing short-block-length constructions for general (r, t). In the case of parallel repair, minimum-block-length constructions are characterized whenever t|(r2 + r) and examples examined.

Includes members:
  Member "binary locally repairable codes sequential repair for multiple erasures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "a bound on rate of codes with locality with sequential recovery from multiple erasures")
  Member "locally repairable codes with functional repair and multiple erasure tolerance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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-5 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "repair locality with multiple erasure tolerance":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "locality and availability in distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "repair locality from a combinatorial perspective":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures")

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)