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 storage allocation for wireless cloud caching systems with a limited sum storage capacity"):
  Abstract: In wireless cloud storage systems, the recovery failure probability depends on not only wireless channel conditions but also storage size of each distributed storage node. For an efficient utilization of limited storage capacity and the performance characterization of allocation strategies, we asymptotically analyze the recovery failure probability of a wireless cloud storage system with a sum storage capacity constraint for both high signal-to-noise ratio (SNR) regime and low SNR regime. Then, we find the optimal storage allocation strategy across distributed storage nodes in terms of the asymptotic recovery failure probability. Our analysis reveals that the maximal symmetric allocation is optimal for high SNR regime and the minimal allocation (with    $\lfloor T\rfloor $    complete storage nodes and an incomplete storage node) is optimal for low SNR regime, where    $T$    is the sum storage capacity. Based on the numerical investigation, we also show that in intermediate SNR regime, a balance allocation between the minimal allocation and the maximal symmetric allocation would not be required if we select one between them according to SNR.

Includes members:
  Member "distributed storage allocations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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 "allocations for heterogenous distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simplifying wireless social caching via network coding")
  Member "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction":
    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 "a survey on network codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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 "decentralized erasure codes for distributed networked storage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improving the secrecy of distributed storage systems using interference alignment")

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)