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: "structural properties of uncoded placement optimization for coded delivery"
  Abstract: A centralized coded caching scheme has been proposed by Maddah-Ali and Niesen to reduce the worst-case load of 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 of size M. However, this centralized coded caching scheme is not able to take advantage of a non-uniform, possibly very skewed, file popularity distribution. In this work, we consider the same network setting but aim to reduce the average load under an arbitrary (known) file popularity distribution. First, we consider a class of centralized coded caching schemes utilizing general uncoded placement and a specific coded delivery strategy, which are specified by a general file partition parameter. Then, we formulate the coded caching design optimization problem over the considered class of schemes with 2^K2^N variables to minimize the average load by optimizing the file partition parameter under an arbitrary file popularity. Furthermore, we show that the optimization problem is convex, and the resulting optimal solution generally improves upon known schemes. Next, we analyze structural properties of the optimization problem to obtain design insights and reduce the complexity. Specifically, we obtain an equivalent linear optimization problem with (K+1)N variables under an arbitrary file popularity and an equivalent linear optimization problem with K+1 variables under the uniform file popularity. Under the uniform file popularity, we also obtain the closed form optimal solution, which corresponds to Maddah-Ali-Niesen's centralized coded caching scheme. Finally, we present an information-theoretic converse bound on the average load under an arbitrary file popularity.

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 "optimization based decentralized coded caching for files and caches with arbitrary size"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "optimization of heterogeneous coded caching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "a new converse bound for coded caching"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "improved lower bounds for coded caching"
    - "coded caching with nonuniform demands"

Connected through hyperedge HE-3 (induced by source paper "structure of optimal cache placement for coded caching with heterogeneous demands"):
  with members:
    - "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"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "fundamental limits of caching in wireless d2d networks"
    - "living on the edge the role of proactive caching in 5g wireless networks"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

Connected through hyperedge HE-4 (induced by source paper "towards jointly optimal placement and delivery to code or not to code in wireless caching networks"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "optimization of heterogeneous coded caching"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "economics of wifi offloading trading delay for cellular capacity"
    - "proactive resource allocation harnessing the diversity and multicast gains"
    - "proactive resource allocation turning predictable behavior into spectral gain"

Connected through hyperedge HE-5 (induced by source paper "optimal wireless caching with placement cost"):
  with members:
    - "towards jointly optimal placement and delivery to code or not to code in wireless caching networks"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "optimization of heterogeneous coded caching"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-6 (induced by source paper "coded caching for heterogeneous systems an optimization perspective"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coded caching with heterogeneous distortion requirements"
    - "benefits of cache assignment on degraded broadcast channels"
    - "optimization of heterogeneous coded caching"
    - "cache aided content delivery over erasure broadcast channels"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "combination networks with or without secrecy constraints the impact of caching relays"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"

Connected through hyperedge HE-7 (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-8 (induced by source paper "the optimal memory rate trade off for the non uniform centralized caching problem with two files under uncoded placement"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "a novel centralized strategy for coded caching with non uniform demands"
    - "full characterization of optimal uncoded placement for the structured clique cover delivery of nonuniform demands"
    - "speeding up distributed machine learning using codes"
    - "uncoded caching and cross level coded delivery for non uniform file popularity"
    - "optimization of heterogeneous coded caching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "fundamental limits of caching improved bounds with coded prefetching"

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)