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: "coded caching with distributed storage"
  Abstract: Content delivery networks store information distributed across multiple servers, so as to balance the load and avoid unrecoverable losses in case of node or disk failures. Coded caching has been shown to be a useful technique which can reduce peak traffic rates by pre-fetching popular content at the end users and encoding transmissions so that different users can extract different information from the same packet. On one hand, distributed storage limits the capability of combining content from different servers into a single message, causing performance losses in coded caching schemes. But, on the other hand, the inherent redundancy existing in distributed storage systems can be used to improve the performance of those schemes through parallelism. #R##N#This paper designs a scheme combining distributed storage of the content in multiple servers and an efficient coded caching algorithm for delivery to the users. This scheme is shown to reduce the peak transmission rate below that of state-of-the-art algorithms.

Connected through hyperedge HE-1 (induced by source paper "mobile communications computing and caching resources optimization for coded caching with device computing"):
  with members:
    - "bandwidth gain from mobile edge computing and caching in wireless multicast systems"
    - "minimizing latency to support vr social interactions over wireless cellular systems via bandwidth allocation"
    - "optimized base station cache allocation for cloud radio access network with multicast backhaul"
    - "communications caching and computing for mobile virtual reality modeling and tradeoff"
    - "edge computing meets millimeter wave enabled vr paving the way to cutting the cord"
    - "the three primary colors of mobile systems"
    - "energy efficient resource allocation for mobile edge computation offloading"
    - "optimization and analysis of probabilistic caching in n tier heterogeneous networks"

Connected through hyperedge HE-2 (induced by source paper "optimal weakly secure linear codes for some classes of the two sender index coding problem"):
  with members:
    - "cooperative multi sender index coding"
    - "on the capacity region for secure index coding"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "structural characteristics of two sender index coding"
    - "index coding rank invariant extensions"
    - "on the capacity for distributed index coding"
    - "secure index coding existence and construction"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"

Connected through hyperedge HE-3 (induced by source paper "coded caching with heterogeneous cache sizes and link qualities the two user case"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "benefits of coded placement for networks with heterogeneous cache sizes"
    - "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "coded caching in a multi server system with random topology"
    - "benefits of cache assignment on degraded broadcast channels"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "cache aided content delivery over erasure broadcast channels"

Connected through hyperedge HE-4 (induced by source paper "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"):
  with members:
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "structural characteristics of two sender index coding"
    - "index coding rank invariant extensions"
    - "on the capacity for distributed index coding"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"

Connected through hyperedge HE-5 (induced by source paper "improved rate for a multi server coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching in a multi server system with random topology"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "a new converse bound for coded caching"
    - "caching and delivery via interference elimination"
    - "on the optimality of uncoded cache placement"
    - "fundamental limits of caching with secure delivery"
    - "multi server coded caching"

Connected through hyperedge HE-6 (induced by source paper "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"):
  with members:
    - "cooperative multi sender index coding"
    - "optimal linear broadcast rates of the two sender unicast index coding problem with fully participated interactions"
    - "on the structure of interlinked cycle structures with interlocked outer cycles"
    - "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
    - "structural characteristics of two sender index coding"
    - "on the capacity for distributed index coding"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"

Connected through hyperedge HE-7 (induced by source paper "optimal linear broadcast rates of the two sender unicast index coding problem with fully participated interactions"):
  with members:
    - "cooperative multi sender index coding"
    - "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
    - "structural characteristics of two sender index coding"
    - "on the capacity for distributed index coding"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "graph theoretic approaches to two sender index coding"
    - "distributed index coding"

Connected through hyperedge HE-8 (induced by source paper "coded caching in a multi server system with random topology"):
  with members:
    - "cooperative multi sender index coding"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "decentralized coded caching with distinct cache capacities"
    - "wireless content caching for small cell and d2d networks"
    - "caching and delivery via interference elimination"
    - "decentralized caching and coded delivery with distinct cache capacities"
    - "distributed index coding"
    - "on the optimality of uncoded cache placement"

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)