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 "on universally good flower codes"):
  Abstract: For a Distributed Storage System (DSS), the \textit{Fractional Repetition} (FR) code is a class in which replicas of encoded data packets are stored on distributed chunk servers, where the encoding is done using the Maximum Distance Separable (MDS) code. The FR codes allow for exact uncoded repair with minimum repair bandwidth. In this paper, FR codes are constructed using finite binary sequences. The condition for universally good FR codes is calculated on such sequences. For some sequences, the universally good FR codes are explored.

Includes members:
  Member "on the duality of fractional repetition codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bounds on fractional repetition codes using hypergraphs")
  Member "on some universally good fractional repetition codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounds on fractional repetition codes using hypergraphs")
  Member "irregular fractional repetition code optimization for heterogeneous cloud storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "load balanced fractional repetition codes")
  Member "optimal fractional repetition codes based on graphs and designs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")
  Member "reconstruction and repair degree of fractional repetition codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bounds on fractional repetition codes using hypergraphs")
  Member "enumerating some fractional repetition codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "repairable replication based storage systems using resolvable designs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")

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)