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 "joint and competitive caching designs in large scale multi tier wireless multicasting networks"):
  Abstract: Caching and multicasting are two promising methods to support massive content delivery in multi-tier wireless networks. In this paper, we consider a random caching and multicasting scheme with caching distributions in the two tiers as design parameters, to achieve efficient content dissemination in a two-tier large-scale cache-enabled wireless multicasting network. First, we derive tractable expressions for the successful transmission probabilities in the general region as well as the high SNR and high user density region, respectively, utilizing tools from stochastic geometry. Then, for the case of a single operator for the two tiers, we formulate the optimal joint caching design problem to maximize the successful transmission probability in the asymptotic region, which is nonconvex in general. By using the block successive approximate optimization technique, we develop an iterative algorithm, which is shown to converge to a stationary point. Next, for the case of two different operators, one for each tier, we formulate the competitive caching design game where each tier maximizes its successful transmission probability in the asymptotic region. We show that the game has a unique Nash equilibrium (NE) and develop an iterative algorithm, which is shown to converge to the NE under a mild condition. Finally, by numerical simulations, we show that the proposed designs achieve significant gains over existing schemes.

Includes members:
  Member "ultra dense edge caching under spatio temporal demand and network dynamics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wireless edge computing with latency and reliability guarantees")
  Member "random caching based cooperative transmission in heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  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 "caching in wireless small cell networks a storage bandwidth tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wireless edge computing with latency and reliability guarantees")
  Member "optimal caching and user association in cache enabled heterogeneous wireless networks":
    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 "a stackelberg game for incentive proactive caching mechanisms in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the effective throughput of coded caching a game theoretic perspective")
  Member "cache enabled heterogeneous cellular networks comparison and tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "enhancing performance of random caching in large scale heterogeneous wireless networks with random discontinuous transmission")
  Member "optimization and analysis of probabilistic caching in n tier heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")

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)