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 "fractional repetition codes with flexible repair from combinatorial designs"):
  Abstract: Fractional repetition (FR) codes are a class of regenerating codes for distributed storage systems with an exact (table-based) repair process that is also uncoded, i.e., upon failure, a node is regenerated by simply downloading packets from the surviving nodes. In our work, we present constructions of FR codes based on Steiner systems and resolvable combinatorial designs such as affine geometries, Hadamard designs and mutually orthogonal Latin squares. The failure resilience of our codes can be varied in a simple manner. We construct codes with normalized repair bandwidth ($\beta$) strictly larger than one; these cannot be obtained trivially from codes with $\beta = 1$. Furthermore, we present the Kronecker product technique for generating new codes from existing ones and elaborate on their properties. FR codes with locality are those where the repair degree is smaller than the number of nodes contacted for reconstructing the stored file. For these codes we establish a tradeoff between the local repair property and failure resilience and construct codes that meet this tradeoff. Much of prior work only provided lower bounds on the FR code rate. In our work, for most of our constructions we determine the code rate for certain parameter ranges.

Includes members:
  Member "capacity of sum networks for different message alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coded caching schemes with reduced subpacketization from linear block codes")
  Member "optimal locally repairable and secure codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal fractional repetition codes based on graphs and designs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "bounds on fractional repetition codes using hypergraphs")
  Member "explicit mbr all symbol locality codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complete hierarchical locality of the punctured simplex code")
  Member "regenerating codes a system perspective":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "alpha entanglement codes practical erasure codes to archive data in unreliable environments")
  Member "exact repair regenerating codes via layered erasure correction and block designs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on secure exact repair regenerating codes with a single pareto optimal point")
  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-8 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon 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)