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 "repairing generalized reed muller codes"):
  Abstract: In distributed storage systems, both the repair bandwidth and locality are important repair cost metrics to evaluate the performance of a storage code. Recently, Guruswami and Wooters proposed an optimal linear repair scheme based on Reed-Solomon codes for a single failure, improved the bandwidth of the classical repair scheme. In this paper, we consider the repair bandwidth of Generalized Reed-Muller (GRM) codes, which have good locality property. We generalize Guruswami and Wooters' repairing scheme to GRM codes for single failure, which has nontrivial bandwidth closing to the lower bound when the subfield is small. We further extend the repair scheme for multiple failures in distributed and centralized repair models, and compute the expectation of bandwidth by considering different erasure-patterns.

Includes members:
  Member "locality and availability of array codes constructed from subspaces":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal repair schemes for some families of full length reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")
  Member "repairing reed solomon codes with multiple erasures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "cooperative local repair in distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "locally recoverable j affine variety codes")
  Member "repairing reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "reed muller codes achieve capacity on the binary erasure channel under map decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "edge coloring and stopping sets analysis in product codes with mds components")
  Member "on locality in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "binary linear locally repairable codes")
  Member "locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a locality based approach for coded computation")

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)