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: "fundamental limits of caching improved delivery rate cache capacity trade off"
  Abstract: We consider a centralized coded caching system consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link. Each user is equipped with a local cache of capacity MF bits. The contents can be proactively cached into the user caches by the server over low traffic period; however, without the knowledge of the user demands. During the peak traffic period each user requests a single file from the database. The goal is to utilize the user caches in order to minimize the number of bits delivered by the server over a shared link, known as the delivery rate, to satisfy all the user demands. We propose a novel coded caching algorithm for the cache capacity of M = N−1 K , when N and K have a common divisor greater than 1, and satisfy 4 ≤ N < K ≤ 3N 2 . It is shown that the proposed scheme achieves a smaller delivery rate than the existing coded caching schemes in the literature for 1 K ≤M ≤ N K when N < K < 3N 2 , and 1 K ≤M ≤ 2N K when K = 3N 2 .

Connected through hyperedge HE-1 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching"):
  with members:
    - "coding for distributed fog computing"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "how to optimally allocate resources for coded distributed computing"
    - "information theoretic caching the multi user case"
    - "degrees of freedom of cache aided wireless interference networks"
    - "noisy broadcast networks with receiver caching"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "fundamental limits of cache aided interference management"

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"
    - "coded caching in a multi server system with random topology"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "the optimal memory rate trade off for the non uniform centralized caching problem with two files under uncoded placement"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "a novel centralized strategy for coded caching with non uniform demands"
    - "full characterization of optimal uncoded placement for the structured clique cover delivery of nonuniform demands"
    - "speeding up distributed machine learning using codes"
    - "uncoded caching and cross level coded delivery for non uniform file popularity"
    - "optimization of heterogeneous coded caching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "structural properties of uncoded placement optimization for coded delivery"

Connected through hyperedge HE-4 (induced by source paper "characterizing the rate memory tradeoff in cache networks within a factor of 2"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "information theoretic caching the multi user case"
    - "noisy broadcast networks with receiver caching"
    - "fundamental limits of cache aided interference management"
    - "coded caching for a large number of users"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "a new converse bound for coded caching"
    - "caching and delivery via interference elimination"

Connected through hyperedge HE-5 (induced by source paper "optimal placement delivery arrays with minimum number of rows"):
  with members:
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "a new converse bound for coded caching"
    - "coded caching with low subpacketization levels"
    - "wireless content caching for small cell and d2d networks"
    - "caching and delivery via interference elimination"
    - "the optimal placement delivery arrays"
    - "on the optimality of uncoded cache placement"

Connected through hyperedge HE-6 (induced by source paper "some new bounds of placement delivery arrays"):
  with members:
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "optimal placement delivery arrays with minimum number of rows"
    - "a new converse bound for coded caching"
    - "centralized coded caching schemes a hypergraph theoretical approach"
    - "the optimal placement delivery arrays"
    - "new results for traitor tracing schemes"
    - "a note on the fundamental limits of coded caching"
    - "hierarchical coded caching"

Connected through hyperedge HE-7 (induced by source paper "improved approximation of storage rate tradeoff for caching with multiple demands"):
  with members:
    - "fundamental limits of cache aided interference management"
    - "a new converse bound for coded caching"
    - "on caching with more users than files"
    - "critical database size for effective caching"
    - "on the optimality of uncoded cache placement"
    - "cache aided wireless networks tradeoffs between storage and latency"
    - "caching aided coded multicasting with multiple random requests"
    - "fundamental limits of caching with secure delivery"

Connected through hyperedge HE-8 (induced by source paper "coded caching for a large number of users"):
  with members:
    - "fundamental limits of cache aided interference management"
    - "centralized coded caching for heterogeneous lossy requests"
    - "wireless content caching for small cell and d2d networks"
    - "a rate distortion approach to caching"
    - "on caching with more users than files"
    - "joint cache channel coding over erasure broadcast channels"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "the performance analysis of coded cache in wireless fading channel"

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)