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 "a class of msr codes for clustered distributed storage"):
  Abstract: Clustered distributed storage models real data centers where intra- and cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: $\epsilon=0$ and $\epsilon=1/(n-k)$, where $\epsilon$ is the ratio of the available cross- and intra-cluster repair bandwidths, $n$ is the total number of distributed nodes and $k$ is the number of contact nodes in data retrieval. The former represents the scenario where cross-cluster communication is not allowed, while the latter corresponds to the case of minimum cross-cluster bandwidth that is possible under the minimum storage overhead constraint. For the $\epsilon=0$ case, two types of locally repairable codes are proven to achieve the MSR point. As for $\epsilon=1/(n-k)$, an explicit MSR coding scheme is suggested for the two-cluster situation under the specific condition of $n = 2k$.

Includes members:
  Member "the storage versus repair bandwidth trade off for clustered storage systems":
    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 repair layering for erasure coded data centers from theory to practice":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model")
  Member "increasing availability in distributed storage systems via clustering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model")
  Member "capacity of clustered distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cascade codes for distributed storage systems")
  Member "minimum storage regenerating codes for all parameters":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "codes between mbr and msr points with exact repair property":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit construction of mbr codes for clustered distributed storage")
  Member "a family of optimal locally recoverable 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)