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 caching in multi antenna small cell networks"):
  Abstract: In traditional cache-enabled small-cell networks (SCNs), a user can suffer strong interference due to contentcentric base station association. This may degenerate the advantage of collaborative content caching among multiple small base stations (SBSs), including probabilistic caching and coded caching. In this work, we tackle this issue by deploying multiple antennas at each SBS for interference management. Two types of beamforming are considered. One is matched-filter (MF) to strengthen the effective channel gain of the desired signal, and the other is zero-forcing (ZF) to cancel interference within a selected SBS cooperation group. We apply these two beamforming techniques in both probabilistic caching and coded caching, and conduct performance analysis using stochastic geometry. We obtain exact and approximate compact integral expressions of system performances measured by average fractional offloaded traffic (AFOT) and average ergodic spectral efficiency (AESE). Based on these expressions, we then optimize the caching parameters for AFOT or AESE maximization. For probabilistic caching, optimal caching solutions are obtained. For coded caching, an efficient greedy-based algorithm is proposed. Numerical results show that multiple antennas can boost the advantage of probabilistic caching and coded caching over the traditional most popular caching with the proper use of beamforming.

Includes members:
  Member "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "analysis and optimization of probabilistic caching in multi antenna small cell networks":
    also connected through other hyperedges:
      (none)
  Member "caching policy toward maximal success probability and area spectral efficiency of cache enabled hetnets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity")
  Member "modeling analysis and optimization of coded caching in small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  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 "a learning based approach to caching in heterogenous small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online convex optimization for caching networks")
  Member "fundamental storage latency tradeoff in cache aided mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "caching in wireless small cell networks a storage bandwidth tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wireless edge computing with latency and reliability guarantees")

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)