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 in a multi server system with random topology"
  Abstract: Cache-aided content delivery is studied in a multi-server system with $K$ users, each equipped with a local cache memory. In the delivery phase, each user connects randomly to any $\rho$ servers out of a total of $P$ servers. Thanks to the availability of multiple servers, which model small base stations with limited storage capacity, user demands can be satisfied with reduced storage capacity at each server and reduced delivery rate per server; however, this also leads to reduced multicasting opportunities compared to a single server serving all the users simultaneously. A joint storage and proactive caching scheme is proposed, which exploits coded storage across the servers, uncoded cache placement at the users, and coded delivery; and it is shown that the achievable average sum delivery rate is comparable to that achieved by a single server, while the gap between the two depends on $\rho$, the available redundancy across servers. It is also shown that the gap can be reduced by increasing the storage capacity at the SBSs.

Connected through hyperedge HE-1 (induced by source paper "routing based delivery in combination type networks with random topology"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "joint optimization of cloud and edge processing for fog radio access networks"
    - "on the optimality of uncoded cache placement"
    - "fundamental limits of caching"
    - "femtocaching wireless video content delivery through distributed caching helpers"

Connected through hyperedge HE-2 (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"
    - "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"
    - "caching and coded delivery over gaussian broadcast channels for energy efficiency"

Connected through hyperedge HE-3 (induced by source paper "mobility aware coded storage and delivery"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "delay aware coded caching for mobile users"
    - "novel decentralized coded caching through coded prefetching"
    - "the optimal memory rate trade off for the non uniform centralized caching problem with two files under uncoded placement"
    - "low subpacketization schemes for coded caching"
    - "optimization of heterogeneous coded caching"
    - "mds coded distributed caching for low delay wireless content delivery"

Connected through hyperedge HE-4 (induced by source paper "cache aided combination networks with interference"):
  with members:
    - "cache aided fog radio access networks with partial connectivity"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "a reinforcement learning approach to proactive caching in wireless networks"
    - "decentralized coded caching in wireless networks trade off between storage and latency"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "cache aided interference management in partially connected wireless networks"

Connected through hyperedge HE-5 (induced by source paper "achieving spatial scalability for coded caching over wireless networks"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "novel outer bounds and inner bounds with uncoded cache placement for combination networks with end user caches"
    - "caching at the wireless edge design aspects challenges and future directions"
    - "wireless caching technical misconceptions and business barriers"
    - "fog computing based radio access networks issues and challenges"

Connected through hyperedge HE-6 (induced by source paper "cache aided fog radio access networks with partial connectivity"):
  with members:
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "decentralized coded caching in wireless networks trade off between storage and latency"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "cache aided interference management in partially connected wireless networks"
    - "noisy broadcast networks with receiver caching"
    - "wireless content caching for small cell and d2d networks"
    - "coded caching for networks with the resolvability property"
    - "decentralized caching and coded delivery with distinct cache capacities"

Connected through hyperedge HE-7 (induced by source paper "reduced transmission in multi server coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "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 caching with more users than files"
    - "on the optimality of uncoded cache placement"
    - "fundamental limits of caching with secure delivery"
    - "improved lower bounds for coded caching"

Connected through hyperedge HE-8 (induced by source paper "improved rate for a multi server coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with distributed storage"
    - "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"

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)