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 nonuniform demands"
  Abstract: We consider a network consisting of a file server connected through a shared link to a number of users, each equipped with a cache. Knowing the popularity distribution of the files, the goal is to optimally populate the caches such as to minimize the expected load of the shared link. For a single cache, it is well known that storing the most popular files is optimal in this setting. However, we show here that this is no longer the case for multiple caches. Indeed, caching only the most popular files can be highly suboptimal. Instead, a fundamentally different approach is needed, in which the cache contents are used as side information for coded communication over the shared link. We propose such a coded caching scheme and prove that it is close to optimal.

Connected through hyperedge HE-1 (induced by source paper "symmetric uncoded caching schemes with low subpacketization levels"):
  with members:
    - "low subpacketization coded caching via projective geometry for broadcast and d2d networks"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "coded caching with low subpacketization levels"
    - "centralized coded caching schemes a hypergraph theoretical approach"
    - "caching and delivery via interference elimination"
    - "on the optimality of uncoded cache placement"
    - "finite length analysis of caching aided coded multicasting"

Connected through hyperedge HE-2 (induced by source paper "content caching and delivery in wireless radio access networks"):
  with members:
    - "mobility aware coded storage and delivery"
    - "cache aided fog radio access networks with partial connectivity"
    - "a converse bound for cache aided interference networks"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "fundamental limits of decentralized caching in fog rans with wireless fronthaul"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "decentralized coded caching in wireless networks trade off between storage and latency"
    - "online edge caching and wireless delivery in fog aided networks with dynamic content popularity"

Connected through hyperedge HE-3 (induced by source paper "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "speeding up distributed machine learning using codes"
    - "wireless mapreduce distributed computing"
    - "a pliable index coding approach to data shuffling"
    - "coded computation over heterogeneous clusters"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "coded caching in partially cooperative d2d communication networks"
    - "how to optimally allocate resources for coded distributed computing"

Connected through hyperedge HE-4 (induced by source paper "device to device coded caching with distinct cache sizes"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "device to device secure coded caching"
    - "on coded caching with heterogeneous distortion requirements"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "coded caching with heterogeneous cache sizes and link qualities the two user case"
    - "optimization of heterogeneous coded caching"
    - "coded caching in partially cooperative d2d communication networks"
    - "a novel index coding scheme and its application to coded caching"

Connected through hyperedge HE-5 (induced by source paper "individual preference aware caching policy design in wireless d2d networks"):
  with members:
    - "throughput outage analysis and evaluation of cache aided d2d networks with measured popularity distributions"
    - "modeling and performance analysis of full duplex communications in cache enabled d2d networks"
    - "learning based delay aware caching in wireless d2d caching networks"
    - "caching policy optimization for d2d communications by learning user preference"
    - "high throughput opportunistic cooperative device to device communications with caching"
    - "cache enabled device to device communications offloading gain and energy cost"
    - "on consideration of content preference and sharing willingness in d2d assisted offloading"
    - "optimizing content caching to maximize the density of successful receptions in device to device networking"

Connected through hyperedge HE-6 (induced by source paper "decentralized asynchronous coded caching design and performance analysis in fog radio access networks"):
  with members:
    - "asynchronous coded caching"
    - "user preference learning based edge caching for fog radio access network"
    - "decentralized asynchronous coded caching in fog ran"
    - "proactive edge computing in latency constrained fog networks"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "an online secretary framework for fog network formation with minimal latency"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "centralized coded caching schemes a hypergraph theoretical approach"

Connected through hyperedge HE-7 (induced by source paper "learning to code coded caching via deep reinforcement learning"):
  with members:
    - "an approximation algorithm for optimal clique cover delivery in coded caching"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "deep learning based caching for self driving car in multi access edge computing"
    - "a reinforcement learning approach to proactive caching in wireless networks"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "a deep reinforcement learning based framework for content caching"
    - "caching policy for cache enabled d2d communications by learning user preference"

Connected through hyperedge HE-8 (induced by source paper "throughput outage analysis and evaluation of cache aided d2d networks with measured popularity distributions"):
  with members:
    - "modeling and performance analysis of full duplex communications in cache enabled d2d networks"
    - "performance of caching based d2d video distribution with measured popularity distributions"
    - "high throughput opportunistic cooperative device to device communications with caching"
    - "cache enabled device to device communications offloading gain and energy cost"
    - "cost optimal caching for d2d networks with user mobility modeling analysis and computational approaches"
    - "spatially correlated content caching for device to device communications"
    - "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"

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)