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 dress codes with flowers"):
  Abstract: Fractional Repetition (FR) codes are well known class of Distributed Replication-based Simple Storage (Dress) codes for the Distributed Storage Systems (DSSs). In such systems, the replicas of data packets encoded by Maximum Distance Separable (MDS) code, are stored on distributed nodes. Most of the available constructions for the FR codes are based on combinatorial designs and Graph theory. In this work, we propose an elegant sequence based approach for the construction of the FR code. In particular, we propose a beautiful class of codes known as Flower codes and study its basic properties.

Includes members:
  Member "optimal fractional repetition codes and fractional repetition batch codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "functional repair codes a view from projective geometry")
  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 "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 "fractional repetition codes with flexible repair from combinatorial 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 "on universally good flower codes")
  Member "replication based storage systems with local repair":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bounds on fractional repetition codes using hypergraphs")
  Member "enumerating some fractional repetition codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on universally good flower codes")
  Member "on weak dress codes for cloud storage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "bounds on fractional repetition codes using hypergraphs")

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)