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 "decentralized coded caching without file splitting"):
  Abstract: Coded caching is an effective technique to reduce the redundant traffic in wireless networks. The existing coded caching schemes require the splitting of files into a possibly large number of subfiles, i.e., they perform coded subfile caching. Keeping the files intact during the caching process would actually be appealing, broadly speaking because of its simpler implementation. However, little is known about the effectiveness of this coded file caching in reducing the data delivery rate. In this paper, we propose such a file caching scheme that uses a decentralized algorithm for content placement and either a greedy clique cover or an online matching algorithm for the delivery of missing data. We derive approximations to the expected delivery rates of both schemes using the differential equations method, and show them to be tight through concentration analysis and computer simulations. Our numerical results demonstrate that the proposed coded file caching is significantly more effective than uncoded caching in reducing the delivery rate. We, furthermore, show the additional improvement in the performance of the proposed scheme when its application is extended to subfile caching with a small number of subfiles.

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 "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs":
    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 "caching at the wireless edge design aspects challenges and future directions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "wireless caching technical misconceptions and business barriers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "big data caching for networking moving from cloud to edge":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fog computing systems state of the art research issues and future trends")
  Member "an efficient coded multicasting scheme preserving the multiplicative caching gain":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "from centralized to decentralized coded caching")
  Member "finite length analysis of caching aided coded multicasting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "effect of number of users in multi level coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "device to device coded caching with distinct cache sizes")

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)