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 "the storage vs repair bandwidth trade off for multiple failures in clustered storage networks"):
  Abstract: We study the trade-off between storage overhead and inter-cluster repair bandwidth in clustered storage systems, while recovering from multiple node failures within a cluster. A cluster is a collection of $m$ nodes, and there are $n$ clusters. For data collection, we download the entire content from any $k$ clusters. For repair of $t \geq 2$ nodes within a cluster, we take help from $\ell$ local nodes, as well as $d$ helper clusters. We characterize the optimal trade-off under functional repair, and also under exact repair for the minimum storage and minimum inter-cluster bandwidth (MBR) operating points. Our bounds show the following interesting facts: $1)$ When $t|(m-\ell)$ the trade-off is the same as that under $t=1$, and thus there is no advantage in jointly repairing multiple nodes, $2)$ When $t \nmid (m-\ell)$, the optimal file-size at the MBR point under exact repair can be strictly less than that under functional repair. $3)$ Unlike the case of $t=1$, increasing the number of local helper nodes does not necessarily increase the system capacity under functional repair.

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 "capacity of clustered distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cascade codes for distributed storage systems")
  Member "centralized repair of multiple node failures with applications to communication efficient secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed secure storage rate privacy trade off and xor based coding scheme")
  Member "architecture aware coding for distributed storage repairable block failure resilient codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the storage versus repair bandwidth trade off for clustered storage systems")
  Member "a realistic distributed storage system the rack model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the storage versus repair bandwidth trade off for clustered storage systems")
  Member "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "cooperative regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model")
  Member "repairing multiple failures with coordinated and adaptive regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")

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)