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 "bounds on fractional repetition codes using hypergraphs"):
  Abstract: In the Distributed Storage Systems (DSSs), an encoded fraction of information is stored in the distributed fashion on different chunk servers. Recently a new paradigm of Fractional Repetition (FR) codes have been introduced, in which, encoded data information is stored on distributed servers, where encoding is done using a Maximum Distance Separable (MDS) code and a repetition code. In this work, we have shown that an FR code is equivalent to a hypergraph. Using the correspondence, the properties and the bounds of a hypergraph are directly mapped to the associated FR code. Some of the bounds are not satisfied by any FR codes in the literature with equality. In general, the necessary and sufficient conditions for the existence of an FR code is obtained by using the correspondence. It is also shown that any FR code associated with a linear hypergraph is universally good.

Includes members:
  Member "load balanced fractional repetition codes":
    also connected through other hyperedges:
      (none)
  Member "on the duality of fractional repetition codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on universally good flower codes")
  Member "on some universally good fractional repetition codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on universally good flower codes")
  Member "optimal fractional repetition codes and fractional repetition batch codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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-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 "when can helper node selection improve regenerating codes part ii an explicit exact repair code construction")
  Member "explicit mbr all symbol locality codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complete hierarchical locality of the punctured simplex code")

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)