human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "the exact rate memory tradeoff for caching with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "optimization of heterogeneous coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "device to device coded caching with distinct cache sizes")
  Member "structural properties of uncoded placement optimization for coded delivery":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "device to device coded caching with distinct cache sizes")
  Member "a new converse bound for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "coded caching with low subpacketization levels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "symmetric uncoded caching schemes with low subpacketization levels")
  Member "analysis and optimization of caching and multicasting in large scale cache enabled heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "novel delivery schemes for decentralized coded caching in the finite file size regime":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an approximation algorithm for optimal clique cover delivery in coded caching")
  Member "finite length analysis of caching aided coded multicasting":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")

Question: Please tell me which class the source paper 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)