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 fractional repetition codes and fractional repetition batch codes"):
  Abstract: Fractional repetition (FR) codes is a family of codes for distributed storage systems (DSS) that allow uncoded exact repairs with minimum repair bandwidth. In this work, we consider a bound on the maximum amount of data that can be stored using an FR code. Optimal FR codes which attain this bound are presented. The constructions of these FR codes are based on families of regular graphs, such as Tur\'an graphs and graphs with large girth; and on combinatorial designs, such as transversal designs and generalized polygons. In addition, based on a connection between FR codes and batch codes, we propose a new family of codes for DSS, called fractional repetition batch codes, which allow uncoded efficient exact repairs and load balancing which can be performed by several users in parallel.

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 "optimal combinatorial batch codes based on block designs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "constructions of batch codes via finite geometry")
  Member "replication based storage systems with local repair":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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-6 (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-7 (induced by source paper "on universally good flower codes")
  Member "fractional repetition codes for repair in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "numerically stable binary gradient coding")

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)