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 "modeling analysis and optimization of coded caching in small cell networks"):
  Abstract: Coded caching is able to exploit accumulated cache size and hence superior to uncoded caching by distributing different fractions of a file in different nodes. This work investigates coded caching in a large-scale small-cell network (SCN) where the locations of small base stations (SBSs) are modeled by stochastic geometry. We first propose a content delivery framework, where multiple SBSs that cache different coded packets of a desired file transmit concurrently upon a user request and the user decodes the signals using successive interference cancellation (SIC). We characterize the performance of coded caching by two performance metrics, average fractional offloaded traffic (AFOT) and average ergodic rate (AER), for which a closed-form expression and a tractable expression are derived, respectively, in the high signal-to-noise ratio region. We then formulate the coded cache placement problem for AFOT maximization as a multiple-choice knapsack problem (MCKP). By utilizing the analytical properties of AFOT, a greedy but optimal algorithm is proposed. We also consider the coded cache placement problem for AER maximization. By converting this problem into a standard MCKP, a heuristic algorithm is proposed. Analytical and numerical results reveal several design and performance insights of coded caching in conjunction with SIC receiver in interference-limited SCNs.

Includes members:
  Member "caching policy toward maximal success probability and area spectral efficiency of cache enabled hetnets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity")
  Member "stochastic content centric multicast scheduling for cache enabled heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "optimizing content caching to maximize the density of successful receptions in device to device networking":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "individual preference aware caching policy design in wireless d2d networks")
  Member "caching at the wireless edge design aspects challenges and future directions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "caching placement in stochastic wireless caching helper networks channel selection diversity via caching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "cooperative caching and transmission design in cluster centric small cell 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 "joint caching routing and channel assignment for collaborative small cell cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "consistent user traffic allocation and load balancing in mobile edge caching")
  Member "content centric sparse multicast beamforming for cache enabled cloud ran":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")

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)