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 "capacity of wireless distributed storage systems with broadcast repair"):
  Abstract: In wireless distributed storage systems, storage nodes are connected by wireless channels, which are broadcast in nature. This paper exploits this unique feature to design an efficient repair mechanism, called broadcast repair, for wireless distributed storage systems in the presence of multiple-node failures. Due to the broadcast nature of wireless transmission, we advocate a new measure on repair performance called repair-transmission bandwidth. In contrast to repair bandwidth, which measures the average number of packets downloaded by a newcomer to replace a failed node, repair-transmission bandwidth measures the average number of packets transmitted by helper nodes per failed node. A fundamental study on the storage capacity of wireless distributed storage systems with broadcast repair is conducted by modeling the storage system as a multicast network and analyzing the minimum cut of the corresponding information flow graph. The fundamental tradeoff between storage efficiency and repair-transmission bandwidth is also obtained for functional repair. The performance of broadcast repair is compared both analytically and numerically with that of cooperative repair, the basic repair method for wired distributed storage systems with multiple-node failures. While cooperative repair is based on the idea of allowing newcomers to exchange packets, broadcast repair is based on the idea of allowing a helper to broadcast packets to all newcomers simultaneously. We show that broadcast repair outperforms cooperative repair, offering a better tradeoff between storage efficiency and repair-transmission bandwidth.

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 "centralized multi node repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "practical functional regenerating codes for broadcast repair of multiple nodes")
  Member "wireless device to device caching networks basic principles and system performance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "distributed storage in mobile wireless networks with device to device communication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mobility aware content placement for device to device caching systems")
  Member "broadcast repair for wireless distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "centralized repair of multiple node failures with applications to communication efficient secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed secure storage rate privacy trade off and xor based coding scheme")
  Member "space time storage codes for wireless distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "algebraic codes and a new physical layer transmission protocol for wireless distributed storage systems")

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)