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: "uncoded placement optimization for coded delivery"
  Abstract: Existing coded caching schemes fail to simultaneously achieve efficient content placement for non-uniform file popularity and efficient content delivery in the presence of common requests, and hence may not achieve desirable average load under a non-uniform, possibly very skewed, popularity distribution. In this paper, we consider a network consisting of a server with access to N files and connected through a shared link to K users, each equipped with a cache. First, we present a class of coded caching schemes specified by a general file partition parameter reflecting the fraction of memory allocated to each file. Then, we formulate the coded caching optimization problem within the class with N2^K variables to minimize the average load under an arbitrary file popularity by optimizing the file partition parameter. Next, we impose some conditions on the file partition parameter, and derive a simplified average load expression. Based on the simplified expression, we transform the original optimization problem into a linear optimization problem with N(K + 1) variables under an arbitrary file popularity and a linear optimization problem with K + 1 variables under the uniform file popularity. Under the uniform file popularity, we also obtain a closed-form optimal solution. Finally, numerical results reveal that the imposed conditions do not affect the optimality of the original problem and demonstrate the performance gain of the optimized coded caching scheme over some existing schemes.

Connected through hyperedge HE-1 (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-2 (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"
    - "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-3 (induced by source paper "on the dynamic centralized coded caching design"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "optimization of heterogeneous coded caching"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with low subpacketization levels"
    - "centralized coded caching schemes a hypergraph theoretical approach"
    - "caching and delivery via interference elimination"
    - "on the optimality of uncoded cache placement"

Connected through hyperedge HE-4 (induced by source paper "linear coded caching scheme for centralized networks"):
  with members:
    - "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"
    - "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"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "a novel recursive construction for coded caching schemes"

Connected through hyperedge HE-5 (induced by source paper "optimal cache placement for modified coded caching with arbitrary cache size"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "optimization of heterogeneous coded caching"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "cache aided interference channels"
    - "living on the edge the role of proactive caching in 5g wireless networks"
    - "coded caching with nonuniform demands"

Connected through hyperedge HE-6 (induced by source paper "constructions of coded caching schemes with flexible memory size"):
  with members:
    - "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"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "a new converse bound for coded caching"
    - "wireless content caching for small cell and d2d networks"
    - "centralized coded caching schemes a hypergraph theoretical approach"

Connected through hyperedge HE-7 (induced by source paper "structural properties of uncoded placement optimization for coded delivery"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "improved converses and gap results for coded caching"
    - "a new converse bound for coded caching"
    - "on the optimality of uncoded cache placement"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "finite length analysis of caching aided coded multicasting"
    - "coded caching with nonuniform demands"
    - "matching the universal barrier without paying the costs solving linear programs with o sqrt rank linear system solves"

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)