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 "product matrix msr codes with bandwidth adaptive exact repair"):
  Abstract: In a distributed storage systems (DSS) with $k$ systematic nodes, robustness against node failure is commonly provided by storing redundancy in a number of other nodes and performing repair mechanism to reproduce the content of the failed nodes. Efficiency is then achieved by minimizing the storage overhead and the amount of data transmission required for data reconstruction and repair, provided by coding solutions such as regenerating codes [1]. Common explicit regenerating code constructions enable efficient repair through accessing a predefined number, $d$, of arbitrary chosen available nodes, namely helpers. In practice, however, the state of the system dynamically changes based on the request load, the link traffic, etc., and the parameters which optimize system's performance vary accordingly. It is then desirable to have coding schemes which are able to operate optimally under a range of different parameters simultaneously. Specifically, adaptivity in the number of helper nodes for repair is of interest. While robustness requires capability of performing repair with small number of helpers, it is desirable to use as many helpers as available to reduce the transmission delay and total repair traffic. #R##N#In this work we focus on the minimum storage regenerating (MSR) codes, where each node is supposed to store $\alpha$ information units, and the source data of size $k\alpha$ could be recovered from any arbitrary set of $k$ nodes. We introduce a class MSR codes that realize optimal repair bandwidth simultaneously with a set of different choices for the number of helpers, namely $D=\{d_{1}, \cdots, d_{\delta}\}$. Our coding scheme follows the Product Matrix (PM) framework introduced in [2], and could be considered as a generalization of the PM MSR code presented in [2], such that any $d_{i} = (i+1)(k-1)$ helpers can perform an optimal repair. ...

Includes members:
  Member "bandwidth adaptive error resilient mbr exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "product matrix minimum storage regenerating codes with flexible number of helpers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bandwidth adaptive error resilient mbr exact repair regenerating codes")
  Member "mds codes with progressive engagement property for cloud storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bandwidth adaptive error resilient mbr exact repair regenerating codes")
  Member "general sub packetized access optimal regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "explicit constructions of high rate mds array codes with optimal repair bandwidth":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "asymptotically optimal regenerating codes over any field":
    also connected through other hyperedges:
      (none)
  Member "explicit constructions of optimal access mds codes with nearly optimal sub packetization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "a high rate msr code with polynomial sub packetization level":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cascade codes for 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)