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: "allocations for heterogenous distributed storage"
  Abstract: We study the problem of storing a data object in a set of data nodes that fail independently with given probabilities. Our problem is a natural generalization of a homogenous storage allocation problem where all the nodes had the same reliability and is naturally motivated for peer-to-peer and cloud storage systems with different types of nodes. Assuming optimal erasure coding (MDS), the goal is to find a storage allocation (i.e, how much to store in each node) to maximize the probability of successful recovery. This problem turns out to be a challenging combinatorial optimization problem. In this work we introduce an approximation framework based on large deviation inequalities and convex optimization. We propose two approximation algorithms and study the asymptotic performance of the resulting allocations.

Connected through hyperedge HE-1 (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-2 (induced by source paper "storage allocation for multi class distributed data storage systems"):
  with members:
    - "optimal storage allocation for wireless cloud caching systems with a limited sum storage capacity"
    - "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"
    - "minimization of storage cost in distributed storage systems with repair consideration"
    - "distributed storage allocations for optimal delay"
    - "memory allocation in distributed storage networks"

Connected through hyperedge HE-3 (induced by source paper "optimal storage allocation for wireless cloud caching systems with a limited sum storage capacity"):
  with members:
    - "distributed storage allocations"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "a survey on network codes for distributed storage"
    - "decentralized erasure codes for distributed networked storage"

Connected through hyperedge HE-4 (induced by source paper "tradeoff for heterogeneous distributed storage systems between storage and repair cost"):
  with members:
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "new codes and inner bounds for exact repair in distributed storage systems"
    - "on heterogeneous regenerating codes and capacity of distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "capacity and security of heterogeneous distributed storage systems"
    - "distributed storage allocations"
    - "cost bandwidth tradeoff in distributed storage systems"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-5 (induced by source paper "on distributed storage allocations for memory limited systems"):
  with members:
    - "distributed storage allocations"

Connected through hyperedge HE-6 (induced by source paper "exploiting user mobility for wireless content delivery"):
  with members:
    - "distributed storage allocations"
    - "femtocaching wireless video content delivery through distributed caching helpers"
    - "distributed storage allocations for optimal delay"

Connected through hyperedge HE-7 (induced by source paper "distributed storage allocations for neighborhood based data access"):
  with members:
    - "distributed storage allocations"
    - "sequential and parallel algorithms for mixed packing and covering"

Connected through hyperedge HE-8 (induced by source paper "capacity and security of heterogeneous distributed storage systems"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "wireless device to device communications with distributed caching"
    - "distributed storage allocations"
    - "non homogeneous distributed storage systems"
    - "cooperative regenerating codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"
    - "a construction of systematic mds codes with minimum repair bandwidth"

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)