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 "multi layer transformed mds codes with optimal repair access and low sub packetization"):
  Abstract: An $(n,k)$ maximum distance separable (MDS) code has optimal repair access if the minimum number of symbols accessed from $d$ surviving nodes is achieved, where $k+1\le d\le n-1$. Existing results show that the sub-packetization $\alpha$ of an $(n,k,d)$ high code rate (i.e., $k/n>0.5$) MDS code with optimal repair access is at least $(d-k+1)^{\lceil\frac{n}{d-k+1}\rceil}$. In this paper, we propose a class of multi-layer transformed MDS codes such that the sub-packetization is $(d-k+1)^{\lceil\frac{n}{(d-k+1)\eta}\rceil}$, where $\eta=\lfloor\frac{n-k-1}{d-k}\rfloor$, and the repair access is optimal for any single node. We show that the sub-packetization of the proposed multi-layer transformed MDS codes is strictly less than the existing known lower bound when $\eta=\lfloor\frac{n-k-1}{d-k}\rfloor>1$, achieving by restricting the choice of $d$ specific helper nodes in repairing a failed node. We further propose multi-layer transformed EVENODD codes that have optimal repair access for any single node and lower sub-packetization than the existing binary MDS array codes with optimal repair access for any single node. With our multi-layer transformation, we can design new MDS codes that have the properties of low computational complexity, optimal repair access for any single node, and relatively small sub-packetization, all of which are critical for maintaining the reliability of distributed storage systems.

Includes members:
  Member "a unified form of evenodd and rdp codes and their efficient decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "array codes with local properties")
  Member "a generic transformation to enable optimal repair in mds codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "binary mds array codes with optimal repair":
    also connected through other hyperedges:
      (none)
  Member "a tight lower bound on the sub packetization level of optimal access msr and mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "minimum storage regenerating codes for all parameters":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "towards practical private information retrieval from mds array codes")
  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 "repair optimal mds array codes over gf 2":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a new design of binary mds array codes with asymptotically weak optimal repair")

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)