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: "rate memory trade off for the two user broadcast caching network with correlated sources"
  Abstract: This paper studies the fundamental limits of caching in a network with two receivers and two files generated by a two-component discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of equal capacity, and the requested files are delivered over a shared error-free broadcast link. First, a lower bound on the optimal peak rate-memory trade-off is provided. Then, in order to leverage the correlation among the library files to alleviate the load over the shared link, a two-step correlation-aware cache-aided coded multicast (CACM) scheme is proposed. The first step uses Gray-Wyner source coding to represent the library via one common and two private descriptions, such that a second correlation-unaware multiple-request CACM step can exploit the additional coded multicast opportunities that arise. It is shown that the rate achieved by the proposed two-step scheme matches the lower bound for a significant memory regime and it is within half of the conditional entropy for all other memory values.

Connected through hyperedge HE-1 (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"
    - "information theoretic caching the multi user case"
    - "correlation aware distributed caching and coded delivery"

Connected through hyperedge HE-2 (induced by source paper "from centralized to decentralized coded caching"):
  with members:
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "wireless caching technical misconceptions and business barriers"
    - "centralized coded caching schemes a hypergraph theoretical approach"

Connected through hyperedge HE-3 (induced by source paper "centralized caching and delivery of correlated contents over a gaussian broadcast channel"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coding for cache aided delivery of dynamic correlated content"
    - "rate memory trade off for caching and delivery of correlated sources"
    - "a reinforcement learning approach to proactive caching in wireless networks"
    - "broadcast caching networks with two receivers and multiple correlated sources"
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "caching and coded delivery over gaussian broadcast channels for energy efficiency"

Connected through hyperedge HE-4 (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"
    - "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"
    - "a rate distortion approach to caching"
    - "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 "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"
    - "noisy broadcast networks with receiver caching"
    - "correlation aware distributed caching and coded delivery"

Connected through hyperedge HE-6 (induced by source paper "broadcast caching networks with two receivers and multiple correlated sources"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "centralized coded caching of correlated contents"
    - "information theoretic caching the multi user case"
    - "correlation aware distributed caching and coded delivery"
    - "cache aided coded multicast for correlated sources"
    - "a rate distortion approach to caching"
    - "caching aided coded multicasting with multiple random requests"

Connected through hyperedge HE-7 (induced by source paper "centralized coded caching of correlated contents"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "correlation aware distributed caching and coded delivery"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "coded caching for a large number of users"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "wireless content caching for small cell and d2d networks"
    - "a rate distortion approach to caching"
    - "living on the edge the role of proactive caching in 5g wireless networks"

Connected through hyperedge HE-8 (induced by source paper "a rate distortion approach to caching"):
  with members:
    - "second order region for gray wyner network"
    - "benefits of cache assignment on degraded broadcast channels"
    - "noisy broadcast networks with receiver caching"
    - "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"
    - "information theoretic caching sequential coding for computing"
    - "content caching and delivery over heterogeneous wireless networks"

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)