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 "hfr code a flexible replication scheme for cloud storage systems"):
  Abstract: Fractional repetition (FR) codes are a family of repair-efficient storage codes that provide exact and uncoded node repair at the minimum bandwidth regenerating point. The advantageous repair properties are achieved by a tailor-made two-layer encoding scheme which concatenates an outer maximum-distance-separable (MDS) code and an inner repetition code. In this paper, we generalize the application of FR codes and propose heterogeneous fractional repetition (HFR) code, which is adaptable to the scenario where the repetition degrees of coded packets are different. We provide explicit code constructions by utilizing group divisible designs, which allow the design of HFR codes over a large range of parameters. The constructed codes achieve the system storage capacity under random access repair and have multiple repair alternatives for node failures. Further, we take advantage of the systematic feature of MDS codes and present a novel design framework of HFR codes, in which storage nodes can be wisely partitioned into clusters such that data reconstruction time can be reduced when contacting nodes in the same cluster.

Includes members:
  Member "irregular fractional repetition code optimization for heterogeneous cloud storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on universally good flower codes")
  Member "optimal fractional repetition codes based on graphs and designs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")
  Member "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an overflow problem in network coding for secure cloud storage")
  Member "locally repairable codes with multiple repair alternatives":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "array codes for functional pir and batch codes")
  Member "on weak dress codes for cloud storage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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-7 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")
  Member "analysis and construction of functional regenerating codes with uncoded repair for 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)