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 "load balanced fractional repetition codes"):
  Abstract: We introduce load-balanced fractional repetition (LBFR) codes, which are a strengthening of fractional repetition (FR) codes. LBFR codes have the additional property that multiple node failures can be sequentially repaired by downloading no more than one block from any other node. This allows for better use of the network, and can additionally reduce the number of disk reads necessary to repair multiple nodes. We characterize LBFR codes in terms of their adjacency graphs, and use this characterization to present explicit constructions LBFR codes with storage capacity comparable existing FR codes. Surprisingly, in some parameter regimes, our constructions of LBFR codes match the parameters of the best constructions of FR codes.

Includes members:
  Member "nearly optimal constructions of pir and batch codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "array codes for functional pir and batch codes")
  Member "fractional repetition and erasure batch codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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-4 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")
  Member "codes with locality for two erasures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "batch codes through dense graphs without short cycles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "batch and pir codes and their connections to locally repairable codes")
  Member "fractional repetition codes with flexible repair from combinatorial designs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")
  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)