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 "irregular fractional repetition code optimization for heterogeneous cloud storage"):
  Abstract: This paper presents a flexible irregular model for heterogeneous cloud storage systems and investigates how the cost of repairing failed nodes can be minimized. The fractional repetition code, originally designed for minimizing repair bandwidth for homogeneous storage systems, is generalized to the irregular fractional repetition code, which is adaptable to heterogeneous environments. The code structure and the associated storage allocation can be obtained by solving an integer linear programming problem. For moderate sized networks, a heuristic algorithm is proposed and shown to be near-optimal by computer simulations.

Includes members:
  Member "zigzag codes mds array codes with optimal rebuilding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "capacity and security of heterogeneous distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity of distributed storage systems with clusters and separate nodes")
  Member "enumerating some fractional repetition codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on universally good flower codes")
  Member "wireless device to device communications with distributed caching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "d2d aware device caching in mmwave cellular networks")
  Member "distributed storage allocations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "repairable replication based storage systems using resolvable designs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")
  Member "locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a locality based approach for coded computation")
  Member "scalable constructions of fractional repetition codes in 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)