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 "optimization and analysis of probabilistic caching in n tier heterogeneous networks"):
  Abstract: In this paper, we study the probabilistic caching for an $N$-tier wireless heterogeneous network (HetNet) using stochastic geometry. A general and tractable expression of the successful delivery probability (SDP) is first derived. We then optimize the caching probabilities for maximizing the SDP in the high signal-to-noise ratio (SNR) regime. The problem is proved to be convex and solved efficiently. We next establish an interesting connection between $N$-tier HetNets and single-tier networks. Unlike the single-tier network where the optimal performance only depends on the cache size, the optimal performance of $N$-tier HetNets depends also on the BS densities. The performance upper bound is, however, determined by an equivalent single-tier network. We further show that with uniform caching probabilities regardless of content popularities, to achieve a target SDP, the BS density of a tier can be reduced by increasing the cache size of the tier when the cache size is larger than a threshold; otherwise the BS density and BS cache size can be increased simultaneously. It is also found analytically that the BS density of a tier is inverse to the BS cache size of the same tier and is linear to BS cache sizes of other tiers.

Includes members:
  Member "how much cache is needed to achieve linear capacity scaling in backhaul limited dense wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "edge caching in dense heterogeneous cellular networks with massive mimo aided self backhaul")
  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 "on optimal geographical caching in heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private information retrieval from a cellular network with caching at the edge")
  Member "the three primary colors of mobile systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "degrees of freedom of cache aided wireless cellular networks")
  Member "caching in wireless small cell networks a storage bandwidth tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wireless edge computing with latency and reliability guarantees")
  Member "optimal caching placement for wireless femto caching network":
    also connected through other hyperedges:
      (none)
  Member "analysis and optimization of caching and multicasting in large scale cache enabled heterogeneous wireless 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 "caching placement in stochastic wireless caching helper networks channel selection diversity via caching":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)