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 "optimal construction of regenerating code through rate matching in hostile networks"):
  Abstract: Regenerating code is a class of code very suitable for distributed storage systems, which can maintain optimal bandwidth and storage space. Two types of important regenerating code have been constructed: the minimum storage regeneration (MSR) code and the minimum bandwidth regeneration (MBR) code. However, in hostile networks where adversaries can compromise storage nodes, the storage capacity of the network can be significantly affected. In this paper, we propose two optimal constructions of regenerating codes through rate-matching that can combat against this kind of adversaries in hostile networks: 2-layer rate-matched regenerating code and $m$-layer rate-matched regenerating code. For the 2-layer code, we can achieve the optimal storage efficiency for given system requirements. Our comprehensive analysis shows that our code can detect and correct malicious nodes with higher storage efficiency compared to the universally resilient regenerating code which is a straightforward extension of regenerating code with error detection and correction capability. Then we propose the $m$-layer code by extending the 2-layer code and achieve the optimal error correction efficiency by matching the code rate of each layer's regenerating code. We also demonstrate that the optimized parameter can achieve the maximum storage capacity under the same constraint. Compared to the universally resilient regenerating code, our code can achieve much higher error correction efficiency.

Includes members:
  Member "toward optimal secure distributed storage systems with exact repair":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity of secure distributed matrix multiplication")
  Member "repairing reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "beyond the mds bound in distributed cloud storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bandwidth adaptive error resilient mbr exact repair regenerating codes")
  Member "layered exact repair regenerating codes via embedded error correction and block designs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cascade codes for distributed storage systems")
  Member "multilevel diversity coding with regeneration":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an open source toolbox for computer aided investigation on the fundamental limits of information systems version 0 1")
  Member "regenerating codes for errors and erasures in distributed storage":
    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 "interference alignment in regenerating codes for distributed storage necessity and code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "practical functional regenerating codes for broadcast repair of multiple nodes")

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)