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 "on the optimality of uncoded cache placement"):
  Abstract: Caching is an efficient way to reduce peak-hour network traffic congestion by storing some contents at user's local cache without knowledge of later demands. Maddah-Ali and Niesen initiated a fundamental study of caching systems; they proposed a scheme (with uncoded cache placement and linear network coding delivery) that is provably optimal to within a factor 12. In this paper, by noticing that when the cache contents and the demands are fixed, the caching problem can be seen as an index coding problem, we show the optimality of Maddah-Ali and Niesen's scheme assuming that cache placement is restricted to be uncoded and the number of users is not less than the number of files. Furthermore, this result states that further improvement to the Maddah-Ali and Niesen's scheme in this regimes can be obtained only by coded cache placement.

Includes members:
  Member "a new converse bound for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "on caching with more users than files":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "a note on the fundamental limits of coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of coded caching the memory rate pair k 1 1 k 1 k 1")
  Member "improved lower bounds for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on coded caching with private demands")
  Member "caching and coded multicasting multiple groupcast index coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decentralized asynchronous coded caching design and performance analysis in fog radio access networks")
  Member "fundamental limits of caching improved bounds for small buffer users":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "on the capacity region for index coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)