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 "enabling optimal access and error correction for the repair of reed solomon codes"):
  Abstract: Recently Reed-Solomon (RS) codes were shown to possess a repair scheme that supports repair of failed nodes with optimal repair bandwidth. In this paper, we extend this result in two directions. First, we propose a new repair scheme for the RS codes constructed in [Tamo-Ye-Barg, {\em IEEE Transactions on Information Theory}, vol. 65, May 2019] and show that our new scheme is robust to erroneous information provided by the helper nodes while maintaining the optimal repair bandwidth. Second, we construct a new family of RS codes with optimal access for the repair of any single failed node. We also show that the constructed codes can accommodate both features, supporting optimal-access repair with optimal error-correction capability. Going beyond RS codes, we also prove that any scalar MDS code with optimal repair bandwidth allows for a repair scheme with optimal access property.

Includes members:
  Member "explicit constructions of msr codes for clustered distributed storage the rack aware storage model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "topology aware cooperative data protection in blockchain based decentralized storage networks")
  Member "optimal repairing schemes for reed solomon codes with alphabet sizes linear in lengths under the rack aware model":
    also connected through other hyperedges:
      (none)
  Member "on the i o costs of some repair schemes for full length reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "repairing multiple failures for scalar mds codes")
  Member "the repair problem for reed solomon codes optimal repair of single and multiple erasures asymptotically optimal node size":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cooperative repair constructions of optimal mds codes for all admissible parameters")
  Member "a tight lower bound on the sub packetization level of optimal access msr and mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "repairing reed solomon codes with multiple erasures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "minimum storage regenerating codes for all parameters":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "explicit constructions of high rate mds array codes with optimal repair bandwidth":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards practical private information retrieval from mds array 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)