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: "a rate distortion approach to caching"
  Abstract: This paper takes a rate-distortion approach to understanding the information-theoretic laws governing cache-aided communications systems. Specifically, we characterise the optimal tradeoffs between the delivery rate, cache capacity and reconstruction distortions for a single-user problem and some special cases of a two-user problem. Our analysis considers discrete memoryless sources, expected- and excess-distortion constraints, and separable and f-separable distortion functions. We also establish a strong converse for separable-distortion functions, and we show that lossy versions of common information (G\'{a}cs-K\"{o}rner and Wyner) play an important role in caching. Finally, we illustrate and explicitly evaluate these laws for multivariate Gaussian sources and binary symmetric sources.

Connected through hyperedge HE-1 (induced by source paper "rate distortion memory trade offs in heterogeneous caching networks"):
  with members:
    - "on coding for cache aided delivery of dynamic correlated content"
    - "on coded caching with heterogeneous distortion requirements"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "noisy broadcast networks with receiver caching"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "distortion memory tradeoffs in cache aided wireless video delivery"
    - "on the average performance of caching and coded multicasting with random demands"

Connected through hyperedge HE-2 (induced by source paper "relaxed wyner s common information"):
  with members:
    - "information theoretic caching the multi user case"
    - "information theoretic caching sequential coding for computing"

Connected through hyperedge HE-3 (induced by source paper "rate memory trade off for caching and delivery of correlated sources"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coding for cache aided delivery of dynamic correlated content"
    - "broadcast caching networks with two receivers and multiple correlated sources"
    - "optimization of heterogeneous coded caching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "centralized coded caching of correlated contents"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "information theoretic caching the multi user case"

Connected through hyperedge HE-4 (induced by source paper "on coded caching with heterogeneous distortion requirements"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "benefits of cache assignment on degraded 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"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "decentralized coded caching with distinct cache capacities"

Connected through hyperedge HE-5 (induced by source paper "on coding for cache aided delivery of dynamic correlated content"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "centralized coded caching of correlated contents"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "correlation aware distributed caching and coded delivery"
    - "cache aided coded multicast for correlated sources"
    - "speeding up future video distribution via channel aware caching aided coded multicast"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "finite length analysis of caching aided coded multicasting"

Connected through hyperedge HE-6 (induced by source paper "improved converses and gap results for coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "centralized caching and delivery of correlated contents over a gaussian broadcast channel"
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "physical layer schemes for wireless coded caching"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "noisy broadcast networks with receiver caching"

Connected through hyperedge HE-7 (induced by source paper "benefits of cache assignment on degraded broadcast channels"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coded caching with heterogeneous distortion requirements"
    - "centralized caching and delivery of correlated contents over a gaussian broadcast channel"
    - "broadcast caching networks with two receivers and multiple correlated sources"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "on coded caching in the overloaded miso broadcast channel"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"

Connected through hyperedge HE-8 (induced by source paper "cache aided content delivery over erasure broadcast channels"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "noisy broadcast networks with receiver caching"
    - "fundamental limits of cache aided interference management"
    - "centralized coded caching for heterogeneous lossy requests"
    - "content delivery in erasure broadcast channels with cache and feedback"
    - "coded caching for a large number of users"
    - "a new converse bound for coded caching"
    - "wireless coded caching a topological perspective"

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)