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 reed solomon codes with multiple erasures"):
  Abstract: Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been overlooked in distributed storage applications due to the common belief that they have poor repair bandwidth: A naive repair approach would require the whole file to be reconstructed in order to recover a single erased codeword symbol. In a recent work, Guruswami and Wootters (STOC'16) proposed a single-erasure repair method for RS codes that achieves the optimal repair bandwidth amongst all linear encoding schemes. Their key idea is to recover the erased symbol by collecting a sufficiently large number of its traces, each of which can be constructed from a number of traces of other symbols. As all traces belong to a subfield of the defining field of the RS code and many of them are linearly dependent, the total repair bandwidth is significantly reduced compared to that of the naive repair scheme. We extend the trace collection technique to cope with multiple erasures.

Includes members:
  Member "broadcast repair for wireless distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "practical functional regenerating codes for broadcast repair of multiple nodes")
  Member "explicit constructions of high rate mds array codes with optimal repair bandwidth":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "cooperative repair of multiple node failures in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")
  Member "repairing reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "interference alignment in regenerating codes for distributed storage necessity and code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "exact scalar minimum storage coordinated regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "scalar mscr codes via the product matrix construction")
  Member "locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a locality based approach for coded computation")
  Member "cooperative regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model")

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)