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 code rates of fractional repetition codes"):
  Abstract: In \textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \textit{Fractional Repetition} (FR) codes have been introduced, in which, data is replicated in a smart way on distributed servers using a \textit{Maximum Distance Separable} (MDS) code. In this work, for a non-uniform FR code, bounds on the FR code rate and DSS code rate are studied. Using matrix representation of an FR code, some universally good FR codes have been obtained.

Includes members:
  Member "on some universally good fractional repetition codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on universally good flower codes")
  Member "irregular fractional repetition code optimization for heterogeneous cloud storage":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on universally good flower codes")
  Member "reconstruction and repair degree of fractional repetition codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on universally good flower codes")
  Member "explicit mbr all symbol locality codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complete hierarchical locality of the punctured simplex code")
  Member "enumerating some fractional repetition codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on universally good flower codes")
  Member "on weak dress codes for cloud storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bounds on fractional repetition codes using hypergraphs")
  Member "repairable replication based storage systems using resolvable designs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")
  Member "scalable constructions of fractional repetition codes in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on universally good flower codes")

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)