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: "on the optimality of separation between caching and delivery in general cache networks"
  Abstract: We consider a system, containing a library of multiple files and a general memoryless communication network through which a server is connected to multiple users, each equipped with a local isolated cache of certain size that can be used to store part of the library. Each user will ask for one of the files in the library, which needs to be delivered by the server through the intermediate communication network. The objective is to design the cache placement (without prior knowledge of users' future requests) and the delivery phase in order to minimize the (normalized) delivery delay. We assume that the delivery phase consists of two steps: (1) generation of a set of multicast messages at the server, one for each subset of users, and (2) delivery of the multicast messages to the users. #R##N#In this setting, we show that there exists a universal scheme for cache placement and multicast message generation, which is independent of the underlying communication network between the server and the users, and achieves the optimal delivery delay to within a constant factor for all memoryless networks. We prove this result, even though the capacity region of the underlying communication network is not known, even approximately. This result demonstrates that in the aforementioned setting, a separation between caching and multicast message generation on one hand, and delivering the multicast messages to the users on the other hand is approximately optimal. This result has the important practical implication that the prefetching can be done independent of network structure in the upcoming delivery phase.

Connected through hyperedge HE-1 (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 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"
    - "improved lower bounds for coded caching"

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"
    - "cache aided content delivery over erasure broadcast channels"
    - "caching and coded delivery over gaussian broadcast channels for energy efficiency"

Connected through hyperedge HE-3 (induced by source paper "adding transmitters dramatically boosts coded caching gains for finite file sizes"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded distributed computing with node cooperation substantially increases speedup factors"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "interference networks with caches at both ends"
    - "on coded caching in the overloaded miso broadcast channel"
    - "multi antenna coded caching"
    - "degrees of freedom of cache aided wireless interference networks"

Connected through hyperedge HE-4 (induced by source paper "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "fundamental limits of decentralized caching in fog rans with wireless fronthaul"
    - "alpha fair coded caching"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit"
    - "fundamental limits of cloud and cache aided interference management with multi antenna base stations"

Connected through hyperedge HE-5 (induced by source paper "cache aided communications with multiple antennas at finite snr"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "state adaptive coded caching for symmetric broadcast channels"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "multi antenna coded caching"
    - "noisy broadcast networks with receiver caching"
    - "content delivery in erasure broadcast channels with cache and feedback"

Connected through hyperedge HE-6 (induced by source paper "achieving spatial scalability for coded caching over wireless networks"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching in a multi server system with random topology"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "novel outer bounds and inner bounds with uncoded cache placement for combination networks with end user caches"
    - "caching at the wireless edge design aspects challenges and future directions"
    - "wireless caching technical misconceptions and business barriers"
    - "fog computing based radio access networks issues and challenges"

Connected through hyperedge HE-7 (induced by source paper "novel decentralized coded caching through coded prefetching"):
  with members:
    - "from uncoded prefetching to coded prefetching in coded caching"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "caching and delivery via interference elimination"
    - "on the optimality of uncoded cache placement"
    - "hierarchical coded caching"
    - "fundamental limits of caching improved bounds for small buffer users"
    - "online coded caching"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

Connected through hyperedge HE-8 (induced by source paper "on combination networks with cache aided relays and users"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "placement delivery array design for combination networks with edge caching"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "novel outer bounds and inner bounds with uncoded cache placement for combination networks with end user caches"
    - "on the optimality of uncoded cache placement"
    - "multi server coded caching"
    - "fundamental limits of caching"

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)