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 "novel inter file coded placement and d2d delivery for a cache aided fog ran architecture"):
  Abstract: This paper considers a novel cache-aided "fog" Radio Access Network (Fog-RAN) architecture including a Macro-cell Base Station (MBS) and several Small-cell Base Stations (SBSs), serving users without caches. Some users, not in the reach of SBSs, are directly served by the MBS. Other users, in the reach of SBSs, are "offloaded" and receive information only from the SBSs through high throughput links. The SBSs have their own local caches. The MBS broadcasts packets to the SBSs and the directly served users. Subsequently, the SBSs can communicate among each other such that each SBS can obtain enough information to decode demanded files by its connected users. For the proposed Fog-RAN we study the memory-loads tradeoff for the worst-case demands. The main contribution of this paper is the design of a novel inter-file coded cache placement and a novel D2D caching scheme with shared-caches to handle the inter-SBS communication phase. The proposed scheme is proved to be order optimal within a constant factor when each SBS is connected to the same number of users. As by-product, the proposed inter-file coded placement can also be used in coded caching systems with heterogeneous cache sizes, where some users have no cache. The proposed coded placement depends on the network topology only by the number of SBSs and the number of users directly served by the MBS. Then, by relaxing the requirement of topology independence, we improve the proposed scheme by designing a cache placement with a subfile division dependent on network structure, which is exactly optimal in some memory size regimes. As another by-product, we also improve the existing shared-link caching scheme with shared-caches by this novel topology-dependent subfile division and placement.

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 "benefits of coded placement for networks with heterogeneous cache sizes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coded caching with heterogeneous cache sizes and link qualities the two user case")
  Member "coded caching with shared caches fundamental limits with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "centralized caching with unequal cache sizes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under uneven capacity channels")
  Member "coded caching with heterogeneous cache sizes and link qualities the two user case":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "device to device coded caching with distinct cache sizes")
  Member "efficient file delivery for coded prefetching in shared cache networks with multiple requests per user":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the fundamental limits of fog ran cache aided networks with downlink and sidelink communications")
  Member "optimization of heterogeneous coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "device to device coded caching with distinct cache sizes")
  Member "characterizing the rate memory tradeoff in cache networks within a factor of 2":
    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)