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 for delay sensitive content"
  Abstract: Coded caching is a recently proposed technique that achieves significant performance gains for cache networks compared to uncoded caching schemes. However, this substantial coding gain is attained at the cost of large delivery delay, which is not tolerable in delay-sensitive applications such as video streaming. In this paper, we identify and investigate the tradeoff between the performance gain of coded caching and the delivery delay. We propose a computationally efficient caching algorithm that provides the gains of coding and respects delay constraints. The proposed algorithm achieves the optimum performance for large delay, but still offers major gains for small delay. These gains are demonstrated in a practical setting with a videostreaming prototype.

Connected through hyperedge HE-1 (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-2 (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-3 (induced by source paper "decentralized coded caching without file splitting"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "caching at the wireless edge design aspects challenges and future directions"
    - "wireless caching technical misconceptions and business barriers"
    - "big data caching for networking moving from cloud to edge"
    - "an efficient coded multicasting scheme preserving the multiplicative caching gain"
    - "finite length analysis of caching aided coded multicasting"
    - "effect of number of users in multi level coded caching"

Connected through hyperedge HE-4 (induced by source paper "an approximation algorithm for optimal clique cover delivery in coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "capacity of some index coding problems with symmetric neighboring interference"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "decentralized coded caching with distinct cache capacities"
    - "novel delivery schemes for decentralized coded caching in the finite file size regime"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "finite length analysis of caching aided coded multicasting"

Connected through hyperedge HE-5 (induced by source paper "asynchronous coded caching"):
  with members:
    - "decentralized asynchronous coded caching design and performance analysis in fog radio access networks"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "coded caching for networks with the resolvability property"

Connected through hyperedge HE-6 (induced by source paper "coded caching for heterogeneous systems an optimization perspective"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coded caching with heterogeneous distortion requirements"
    - "benefits of cache assignment on degraded broadcast channels"
    - "optimization of heterogeneous coded caching"
    - "cache aided content delivery over erasure broadcast channels"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "combination networks with or without secrecy constraints the impact of caching relays"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"

Connected through hyperedge HE-7 (induced by source paper "adaptive coded caching for fair delivery over fading channels"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "utility optimal scheduling for coded caching in general topologies"
    - "multi antenna coded caching"
    - "noisy broadcast networks with receiver caching"
    - "wireless caching technical misconceptions and business barriers"
    - "wireless coded caching a topological perspective"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "the performance analysis of coded cache in wireless fading channel"

Connected through hyperedge HE-8 (induced by source paper "audience retention rate aware caching and coded video delivery with asynchronous demands"):
  with members:
    - "asynchronous coded caching"
    - "a reinforcement learning approach to proactive caching in wireless networks"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "coded caching for a large number of users"
    - "wireless content caching for small cell and d2d networks"
    - "decentralized caching and coded delivery with distinct cache capacities"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "adapting caching to audience retention rate which video chunk to store"

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)