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 fraction repetition codes for access balancing in distributed storage"):
  Abstract: To solve the access-balancing problem in distributed storage systems, we introduce a new combinatorial model, called MinVar model for fractional repetition (FR) codes. Since FR codes are based on graphs or set systems, our MinVar model is characterized by the property that the variance among the sums of block-labels incident to a fixed vertex is minimized. This characterization is different from Dau and Milenkovic's MaxMinSum model, while the minimum sum of labels is maximized. We show that our MinVar model is meaningful by distinguishing labelings with different variances but with the same MaxMin value for some FR codes. By reformulating the MinVar model to an equivalent vertex-labeling problem of graphs, we find several families of optimal FR codes with balanced access frequency, and provide fundamental results for both problems. It is interesting that MinVar model is closely related to the concept of magic-labeling in graph theory.

Includes members:
  Member "access balancing in storage systems by labeling partial steiner systems":
    also connected through other hyperedges:
      (none)
  Member "optimal fractional repetition codes based on graphs and designs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "access balancing in storage systems by labeling partial steiner systems")
  Member "fractional repetition codes with flexible repair from combinatorial designs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "load balanced fractional repetition codes")
  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-3 (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-4 (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-5 (induced by source paper "numerically stable binary gradient coding")
  Member "explicit construction of optimal exact regenerating codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explicit construction of mbr codes for clustered distributed storage")

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)