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 in heterogeneous networks with uncoded prefetching"
  Abstract: The work explores the fundamental limits of coded caching in heterogeneous networks where multiple ($N_0$) senders/antennas, serve different users which are associated (linked) to shared caches, where each such cache helps an arbitrary number of users. Under the assumption of uncoded cache placement, the work derives the exact optimal worst-case delay and DoF, for a broad range of user-to-cache association profiles where each such profile describes how many users are helped by each cache. This is achieved by presenting an information-theoretic converse based on index coding that succinctly captures the impact of the user-to-cache association, as well as by presenting a coded caching scheme that optimally adapts to the association profile by exploiting the benefits of encoding across users that share the same cache. The work reveals a powerful interplay between shared caches and multiple senders/antennas, where we can now draw the striking conclusion that, as long as each cache serves at least $N_0$ users, adding a single degree of cache-redundancy can yield a DoF increase equal to $N_0$, while at the same time --- irrespective of the profile --- going from 1 to $N_0$ antennas reduces the delivery time by a factor of $N_0$. Finally some conclusions are also drawn for the related problem of coded caching with multiple file requests.

Connected through hyperedge HE-1 (induced by source paper "rate memory trade off for multi access coded caching with uncoded placement"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "novel decentralized coded caching through coded prefetching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "uncoded placement optimization for coded delivery"
    - "a novel index coding scheme and its application to coded caching"
    - "novel outer bounds and inner bounds with uncoded cache placement for combination networks with end user caches"

Connected through hyperedge HE-2 (induced by source paper "an optimal linear error correcting delivery scheme for coded caching with shared caches"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "optimal error correcting delivery scheme for an optimal coded caching scheme with small buffers"
    - "optimal error correcting delivery scheme for coded caching with symmetric batch prefetching"
    - "noisy broadcast networks with receiver caching"
    - "caching and delivery via interference elimination"
    - "online coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

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)