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 "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"):
  Abstract: The paper is devoted to the problem of erasure coding in distributed storage. We consider a model of storage that assumes that nodes are organized into equally sized groups, called racks, that within each group the nodes can communicate freely without taxing the system bandwidth, and that the only information transmission that counts is the one between the racks. This assumption implies that the nodes within each of the racks can collaborate before providing information to the failed node. The main emphasis of the paper is on code construction for this storage model. We present an explicit family of MDS array codes that support recovery of a single failed node from any number of helper racks using the minimum possible amount of inter-rack communication (such codes are said to provide optimal repair). The codes are constructed over finite fields of size comparable to the code length. #R##N#We also derive a bound on the number of symbols accessed at helper nodes for the purposes of repair, and construct a code family that approaches this bound, while still maintaining the optimal repair property. #R##N#Finally, we present a construction of scalar Reed-Solomon codes that support optimal repair for the rack-oriented storage model.

Includes members:
  Member "a generic transformation to enable optimal repair in mds codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "the storage versus repair bandwidth trade off for clustered storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "topology aware cooperative data protection in blockchain based decentralized storage networks")
  Member "rack aware regenerating codes for data centers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "topology aware cooperative data protection in blockchain based decentralized storage networks")
  Member "cooperative repair constructions of optimal mds codes for all admissible parameters":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "topology aware cooperative data protection in blockchain based decentralized storage networks")
  Member "a class of msr codes for clustered distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cascade codes for distributed storage systems")
  Member "erasure coding for distributed storage an overview":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secrecy and accessibility in distributed storage")
  Member "optimal repair layering for erasure coded data centers from theory to practice":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity of distributed storage systems with clusters and separate nodes")
  Member "increasing availability in distributed storage systems via clustering":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "explicit construction of mbr codes for clustered distributed storage")

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)