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 "flexible fractional repetition codes for distributed storage networks"):
  Abstract: Consider the following fundamental question of distributed storage networks: Given any arbitrary $(n,k,d)$ values, whether there exists an intelligent helper selection scheme (assuming unlimited memory and computing power) that can strictly improve the storage-bandwidth (S-B) tradeoff. Ahmad et al. 18' answered this question by proving that for a subset of $(n,k,d)$ values, no helper selection scheme can ever improve the S-B tradeoff, and for the $(n,k,d)$ not in that subset, a new scheme called family helper selection (FHS) can strictly improve the S-B tradeoff over a blind helper selection scheme. Nonetheless, the analysis of FHS is done by a min-cut analysis with no actual code construction. #R##N#This work fills this gap between pure min-cut analysis and actual code construction by pairing FHS with a new, generalized version of the existing fractional repetition (FR) codes. Specifically, existing FR codes are exact-repair codes that admit the highly-desirable repair-by-transfer property, but its unique construction limits the application to a restricted set of $(n,k,d)$ values. In contrast, our new construction, termed flexible fractional repetition codes, can be applied to arbitrary $(n,k,d)$ while retaining most of the practical benefits of FR codes, i.e., admitting small repair bandwidth, being exact-repair, and being almost repairable-by-transfer.

Includes members:
  Member "optimal fractional repetition codes based on graphs and designs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")
  Member "fractional repetition codes with flexible repair from combinatorial designs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")
  Member "replication based storage systems with local repair":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bounds on fractional repetition codes using hypergraphs")
  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-4 (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-5 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "scalable constructions of fractional repetition codes in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on universally good flower codes")
  Member "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "a construction of systematic mds codes with minimum repair bandwidth":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a novel construction of low complexity mds codes with optimal repair capability 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)