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: "improved lower bounds for coded caching"
  Abstract: Content delivery networks often employ caching to reduce transmission rates from the central server to the end users. Recently, the technique of coded caching was introduced whereby coding in the caches and coded transmission signals from the central server are considered. Prior results in this area demonstrate that carefully designing the placement of content in the caches and designing appropriate coded delivery signals from the server allow for a system where the delivery rates can be significantly smaller than conventional schemes. However, matching upper and lower bounds on the transmission rate have not yet been obtained. In this work, we derive tighter lower bounds on the coded caching rate than were known previously. We demonstrate that this problem can equivalently be posed as a combinatorial problem of optimally labeling the leaves of a directed tree. Our proposed labeling algorithm allows for significantly improved lower bounds on the coded caching rate. Furthermore, we study certain structural properties of our algorithm that allow us to analytically quantify improvements on the rate lower bound for general values of the problem parameters. This allows us to obtain a multiplicative gap of at most four between the achievable rate and our lower bound.

Connected through hyperedge HE-1 (induced by source paper "on coded caching with private demands"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "device to device secure coded caching"
    - "novel inter file coded placement and d2d delivery for a cache aided fog ran architecture"
    - "secrecy capacity memory tradeoff of erasure broadcast channels"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "the capacity of cache aided private information retrieval"

Connected through hyperedge HE-2 (induced by source paper "decentralized asynchronous coded caching design and performance analysis in fog radio access networks"):
  with members:
    - "asynchronous coded caching"
    - "user preference learning based edge caching for fog radio access network"
    - "decentralized asynchronous coded caching in fog ran"
    - "proactive edge computing in latency constrained fog networks"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "an online secretary framework for fog network formation with minimal latency"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "centralized coded caching schemes a hypergraph theoretical approach"

Connected through hyperedge HE-3 (induced by source paper "embedded index coding"):
  with members:
    - "task based solutions to embedded index coding"
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on locally decodable index codes"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "distributed index coding"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "on a duality between recoverable distributed storage and index coding"

Connected through hyperedge HE-4 (induced by source paper "a unified framework for constructing centralized coded caching schemes"):
  with members:
    - "coded caching based on combinatorial designs"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching via line graphs of bipartite graphs"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"

Connected through hyperedge HE-5 (induced by source paper "fundamental limits of device to device private caching with trusted server"):
  with members:
    - "on coded caching with private demands"
    - "subpacketization in coded caching with demand privacy"
    - "embedded index coding"
    - "private pliable index coding"
    - "demand private coded caching and the exact trade off for n k 2"
    - "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"
    - "demand private coded caching"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"

Connected through hyperedge HE-6 (induced by source paper "subpacketization in coded caching with demand privacy"):
  with members:
    - "on coded caching with private demands"
    - "demand private coded caching"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "private broadcasting an index coding approach"

Connected through hyperedge HE-7 (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-8 (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 optimality of separation between caching and delivery in general cache networks"
    - "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"

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)