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: "distributed storage allocations"
  Abstract: We examine the problem of allocating a given total storage budget in a distributed storage system for maximum reliability. A source has a single data object that is to be coded and stored over a set of storage nodes; it is allowed to store any amount of coded data in each node, as long as the total amount of storage used does not exceed the given budget. A data collector subsequently attempts to recover the original data object by accessing only the data stored in a random subset of the nodes. By using an appropriate code, successful recovery can be achieved whenever the total amount of data accessed is at least the size of the original data object. The goal is to find an optimal storage allocation that maximizes the probability of successful recovery. This optimization problem is challenging in general because of its combinatorial nature, despite its simple formulation. We study several variations of the problem, assuming different allocation models and access models. The optimal allocation and the optimal symmetric allocation (in which all nonempty nodes store the same amount of data) are determined for a variety of cases. Our results indicate that the optimal allocations often have nonintuitive structure and are difficult to specify. We also show that depending on the circumstances, coding may or may not be beneficial for reliable storage.

Connected through 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"):
  with members:
    - "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes"
    - "load balancing performance in distributed storage with regular balanced redundancy"
    - "analyzing the download time of availability codes"
    - "service rate region of content access from erasure coded storage"
    - "simplex queues for hot data download"
    - "batch and pir codes and their connections to locally repairable codes"
    - "on distributed storage allocations of large files for maximum service rate"
    - "on the service capacity region of accessing erasure coded content"

Connected through hyperedge HE-2 (induced by source paper "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes"):
  with members:
    - "load balancing performance in distributed storage with regular balanced redundancy"
    - "service rate region of content access from erasure coded storage"
    - "simplex queues for hot data download"
    - "on distributed storage allocations of large files for maximum service rate"
    - "on the service capacity region of accessing erasure coded content"
    - "on storage allocation for maximum service rate in distributed storage systems"
    - "many to many matching games for proactive social caching in wireless small cell networks"
    - "on the locality of codeword symbols"

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"
    - "optimal storage allocation for wireless cloud caching systems with a limited sum storage capacity"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "on distributed storage allocations of large files for maximum service rate"):
  with members:
    - "on the service capacity region of accessing erasure coded content"
    - "on storage allocation for maximum service rate in distributed storage systems"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "coding for fast content download"
    - "distributed storage allocations for optimal delay"
    - "memory allocation in distributed storage networks"

Connected through hyperedge HE-5 (induced by source paper "device caching for network offloading delay minimization with presence of user mobility"):
  with members:
    - "cost optimal caching for d2d networks with user mobility modeling analysis and computational approaches"
    - "mobility aware caching for content centric wireless networks modeling and methodology"
    - "mobility aware caching in d2d networks"
    - "optimal geographic caching in cellular networks"
    - "mobicacher mobility aware content caching in small cell networks"

Connected through hyperedge HE-6 (induced by source paper "multi rack distributed data storage networks"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "increasing availability in distributed storage systems via clustering"
    - "capacity of clustered distributed storage"
    - "maximally recoverable codes for grid like topologies"
    - "architecture aware coding for distributed storage repairable block failure resilient codes"
    - "codes with hierarchical locality"
    - "xoring elephants novel erasure codes for big data"
    - "a realistic distributed storage system that minimizes data storage and repair bandwidth"

Connected through hyperedge HE-7 (induced by source paper "cost optimal caching for d2d networks with user mobility modeling analysis and computational approaches"):
  with members:
    - "incentive mechanism design for cache assisted d2d communications a mobility aware approach"
    - "mobility increases the data offloading ratio in d2d caching networks"
    - "stochastic content centric multicast scheduling for cache enabled heterogeneous cellular networks"
    - "optimizing content caching to maximize the density of successful receptions in device to device networking"
    - "wireless device to device caching networks basic principles and system performance"
    - "fog computing based radio access networks issues and challenges"
    - "mobility aware caching for content centric wireless networks modeling and methodology"
    - "mobility aware caching in d2d networks"

Connected through hyperedge HE-8 (induced by source paper "optimizing mds coded caching in wireless networks with device to device communication"):
  with members:
    - "mds coded distributed caching for low delay wireless content delivery"
    - "mds coded distributed storage for low delay wireless content delivery"
    - "caching at the wireless edge design aspects challenges and future directions"
    - "wireless device to device caching networks basic principles and system performance"
    - "mobility aware caching in d2d networks"
    - "distributed storage in mobile wireless networks with device to device communication"
    - "optimization and analysis of probabilistic caching in n tier heterogeneous networks"
    - "optimizing mds codes for caching at the edge"

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)