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"
  Abstract: Caching is a technique to reduce peak traffic rates by prefetching popular content into memories at the end users. Conventionally, these memories are used to deliver requested content in part from a locally cached copy rather than through the network. The gain offered by this approach, which we term local caching gain, depends on the local cache size (i.e, the memory available at each individual user). In this paper, we introduce and exploit a second, global, caching gain not utilized by conventional caching schemes. This gain depends on the aggregate global cache size (i.e., the cumulative memory available at all users), even though there is no cooperation among the users. #R##N#To evaluate and isolate these two gains, we introduce an information-theoretic formulation of the caching problem focusing on its basic structure. For this setting, we propose a novel coded caching scheme that exploits both local and global caching gains, leading to a multiplicative improvement in the peak rate compared to previously known schemes. In particular, the improvement can be on the order of the number of users in the network. Moreover, we argue that the performance of the proposed scheme is within a constant factor of the information-theoretic optimum for all values of the problem parameters.

Connected through hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic"):
  with members:
    - "fundamental limits of wireless caching under uneven capacity channels"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "cache aided communications with multiple antennas at finite snr"
    - "centralized and decentralized cache aided interference management in heterogeneous parallel channels"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"

Connected through hyperedge HE-2 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry"):
  with members:
    - "some new constructions of coded caching schemes with reduced subpacketization"
    - "a multi antenna coded caching scheme with linear subpacketization"
    - "decentralized coded caching without file splitting"
    - "subpacketization rate trade off in multi antenna coded caching"
    - "coded caching based on combinatorial designs"
    - "a unified framework for constructing centralized coded caching schemes"
    - "low subpacketization coded caching via projective geometry for broadcast and d2d networks"
    - "coded caching via projective geometry a new low subpacketization scheme"

Connected through hyperedge HE-3 (induced by source paper "an index coding approach to caching with uncoded cache placement"):
  with members:
    - "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "benefits of cache assignment on degraded broadcast channels"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "on the capacity for distributed index coding"
    - "coded caching for a large number of users"

Connected through hyperedge HE-4 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space"):
  with members:
    - "joint downlink scheduling for file placement and delivery in cache assisted wireless networks with finite file lifetime"
    - "optimal caching designs for perfect imperfect and unknown file popularity distributions in large scale multi tier wireless networks"
    - "online user scheduling and resource allocation for mobile edge computing systems"
    - "cooperative job dispatching in edge computing network with unpredictable uploading delay"
    - "mdp based scheduling design for mobile edge computing systems with random user arrival"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "stochastic content centric multicast scheduling for cache enabled heterogeneous cellular networks"
    - "wireless device to device caching networks basic principles and system performance"

Connected through hyperedge HE-5 (induced by source paper "degrees of freedom of cache aided wireless cellular networks"):
  with members:
    - "content caching and delivery in wireless radio access networks"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "cache aided fog radio access networks with partial connectivity"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "on heterogeneous coded distributed computing"

Connected through hyperedge HE-6 (induced by source paper "on optimal load memory tradeoff of cache aided scalar linear function retrieval"):
  with members:
    - "codedprivateml a fast and privacy preserving framework for distributed machine learning"
    - "on coded caching with private demands"
    - "device to device private caching with trusted server"
    - "private and secure distributed matrix multiplication with flexible communication load"
    - "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the fundamental limits of coded data shuffling for distributed learning systems"
    - "near optimal coded data shuffling for distributed learning"

Connected through hyperedge HE-7 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution"):
  with members:
    - "a low complexity cache aided multi antenna content delivery scheme"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "opportunistic content delivery in fading broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "caching and coded delivery over gaussian broadcast channels for energy efficiency"
    - "edge caching wireless networks performance analysis and optimization"
    - "multi antenna interference management for coded caching"
    - "scalable content delivery with coded caching in multi antenna fading channels"

Connected through hyperedge HE-8 (induced by source paper "mobile communications computing and caching resources optimization for coded caching with device computing"):
  with members:
    - "bandwidth gain from mobile edge computing and caching in wireless multicast systems"
    - "minimizing latency to support vr social interactions over wireless cellular systems via bandwidth allocation"
    - "optimized base station cache allocation for cloud radio access network with multicast backhaul"
    - "communications caching and computing for mobile virtual reality modeling and tradeoff"
    - "edge computing meets millimeter wave enabled vr paving the way to cutting the cord"
    - "coded caching with distributed storage"
    - "the three primary colors of mobile systems"
    - "energy efficient resource allocation for mobile edge computation offloading"

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)