human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "mobility aware content placement for device to device caching systems"):
  with members:
    - "device caching for network offloading delay minimization with presence of user mobility"
    - "mobility and popularity aware coded small cell caching"
    - "wireless device to device caching networks basic principles and system performance"
    - "mobility aware caching for content centric wireless networks modeling and methodology"
    - "mobility aware caching in d2d networks"
    - "distributed storage in mobile wireless networks with device to device communication"
    - "caching placement in stochastic wireless caching helper networks channel selection diversity via caching"
    - "what will 5g be"

Connected through hyperedge HE-2 (induced by source paper "content placement in cache networks using graph coloring"):
  with members:
    - "mobility aware caching for content centric wireless networks modeling and methodology"
    - "wireless content caching for small cell and d2d networks"
    - "caching placement in stochastic wireless caching helper networks channel selection diversity via caching"
    - "cache enabled heterogeneous cellular networks optimal tier level content placement"
    - "optimal caching placement for d2d assisted wireless caching networks"
    - "cooperative local caching under heterogeneous file preferences"
    - "cache enabled opportunistic cooperative mimo for video streaming in wireless systems"
    - "base station assisted device to device communications for high throughput wireless video networks"

Connected through hyperedge HE-3 (induced by source paper "simplifying wireless social caching via network coding"):
  with members:
    - "optimizing mds coded caching in wireless networks with device to device communication"
    - "wireless device to device caching networks basic principles and system performance"
    - "decentralized coded caching with distinct cache capacities"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "multi level coded caching"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "distributed storage allocations"

Connected through hyperedge HE-4 (induced by source paper "caching with time domain buffer sharing"):
  with members:
    - "self sustaining caching stations toward cost effective 5g enabled vehicular networks"
    - "wireless device to device caching networks basic principles and system performance"
    - "big data caching for networking moving from cloud to edge"
    - "a utility optimization approach to network cache design"
    - "improved approximation of storage rate tradeoff for caching with multiple demands"
    - "coded caching for multi level popularity and access"
    - "online coded caching"
    - "coded caching with nonuniform demands"

Connected through hyperedge HE-5 (induced by source paper "storage allocation for multi class distributed data storage systems"):
  with members:
    - "on storage allocation for maximum service rate in distributed storage systems"
    - "on distributed storage allocations for memory limited systems"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "distributed storage allocations"
    - "allocations for heterogenous distributed storage"
    - "minimization of storage cost in distributed storage systems with repair consideration"
    - "distributed storage allocations for optimal delay"
    - "memory allocation in distributed storage networks"

Question: Please tell me which class the center node 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)