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: "coded caching for multi level popularity and access"
  Abstract: To address the exponentially rising demand for wireless content, use of caching is emerging as a potential solution. It has been recently established that joint design of content delivery and storage (coded caching) can significantly improve performance over conventional caching. Coded caching is well suited to emerging heterogeneous wireless architectures which consist of a dense deployment of local-coverage wireless access points (APs) with high data rates, along with sparsely-distributed, large-coverage macro-cell base stations (BS). This enables design of coded caching-and-delivery schemes that equip APs with storage, and place content in them in a way that creates coded-multicast opportunities for combining with macro-cell broadcast to satisfy users even with different demands. Such coded-caching schemes have been shown to be order-optimal with respect to the BS transmission rate, for a system with single-level content, i.e., one where all content is uniformly popular. In this work, we consider a system with non-uniform popularity content which is divided into multiple levels, based on varying degrees of popularity. The main contribution of this work is the derivation of an order-optimal scheme which judiciously shares cache memory among files with different popularities. To show order-optimality we derive new information-theoretic lower bounds, which use a sliding-window entropy inequality, effectively creating a non-cutset bound. We also extend the ideas to when users can access multiple caches along with the broadcast. Finally we consider two extreme cases of user distribution across caches for the multi-level popularity model: a single user per cache (single-user setup) versus a large number of users per cache (multi-user setup), and demonstrate a dichotomy in the order-optimal strategies for these two extreme cases.

Connected through hyperedge HE-1 (induced by source paper "device to device coded caching with distinct cache sizes"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "device to device secure coded caching"
    - "on coded caching with heterogeneous distortion requirements"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "coded caching with heterogeneous cache sizes and link qualities the two user case"
    - "optimization of heterogeneous coded caching"
    - "coded caching in partially cooperative d2d communication networks"
    - "a novel index coding scheme and its application to coded caching"

Connected through hyperedge HE-2 (induced by source paper "on the effective throughput of coded caching a game theoretic perspective"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "energy efficiency gains of caching for interference channels"
    - "caching meets millimeter wave communications for enhanced mobility management in 5g networks"
    - "on coded caching in the overloaded miso broadcast channel"
    - "a survey on low latency towards 5g ran core network and caching solutions"
    - "cost optimal caching for d2d networks with user mobility modeling analysis and computational approaches"
    - "caching at the wireless edge design aspects challenges and future directions"
    - "a stackelberg game for incentive proactive caching mechanisms in wireless networks"

Connected through hyperedge HE-3 (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"
    - "fundamental limits of caching in heterogeneous networks 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"

Connected through hyperedge HE-4 (induced by source paper "fundamental limits of caching in heterogeneous networks with uncoded prefetching"):
  with members:
    - "cooperative multi sender index coding"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "leveraging coding techniques for speeding up distributed computing"
    - "coded distributed computing with node cooperation substantially increases speedup factors"
    - "achieving spatial scalability for coded caching over wireless networks"
    - "a new combinatorial design of coded distributed computing"
    - "low subpacketization schemes for coded caching"
    - "on the placement delivery array design for centralized coded caching scheme"

Connected through hyperedge HE-5 (induced by source paper "mobility aware coded storage and delivery"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "delay aware coded caching for mobile users"
    - "novel decentralized coded caching through coded prefetching"
    - "the optimal memory rate trade off for the non uniform centralized caching problem with two files under uncoded placement"
    - "coded caching in a multi server system with random topology"
    - "low subpacketization schemes for coded caching"
    - "optimization of heterogeneous coded caching"

Connected through hyperedge HE-6 (induced by source paper "decentralized caching schemes and performance limits in two layer networks"):
  with members:
    - "riding on the primary a new spectrum sharing paradigm for wireless powered iot devices"
    - "low subpacketization schemes for coded caching"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "on edge caching with secrecy constraints"
    - "decentralized coded caching with distinct cache capacities"
    - "improved approximation of storage rate tradeoff for caching with multiple demands"
    - "fundamental limits of secretive coded caching"
    - "caching aided coded multicasting with multiple random requests"

Connected through hyperedge HE-7 (induced by source paper "resource pooling in large scale content delivery systems"):
  with members:
    - "effects of storage heterogeneity in distributed cache systems"
    - "content replication in large distributed caches"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "serving content with unknown demand the high dimensional regime"
    - "multi level coded caching"
    - "online coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

Connected through hyperedge HE-8 (induced by source paper "caching with time domain buffer sharing"):
  with members:
    - "self sustaining caching stations toward cost effective 5g enabled vehicular networks"
    - "wireless device to device caching networks basic principles and system performance"
    - "big data caching for networking moving from cloud to edge"
    - "optimal storage allocation for wireless cloud caching systems with a limited sum storage capacity"
    - "a utility optimization approach to network cache design"
    - "improved approximation of storage rate tradeoff for caching with multiple demands"
    - "online coded caching"
    - "coded caching with nonuniform demands"

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)