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 "edge caching with real time guarantees"):
  Abstract: In recent years, optimization of the success transmission probability in wireless cache-enabled networks has been studied extensively. However, few works have concerned about the real-time performance of the cache-enabled networks. In this paper, we investigate the performance of the cache-enabled with real-time guarantees by adopting the age of information (AoI) as the metric to characterize the timeliness of the delivered information. We establish a spatial-temporal model by utilizing the stochastic geometry and queuing theory which captures both the temporal traffic dynamics and the interferers' geographic distribution. Under the random caching framework, we achieve the closed-form expression of AoI by adopting the maximum average received power criterion for the user association. Finally, we formulate a convex optimization problem for the minimization of the Peak AoI (PAoI) and obtain the optimal caching probabilities by utilizing the Karush-Kuhn-Tucker (KKT) conditions. Numerical results demonstrate that the random caching strategy is a better choice rather than the most popular content and uniform caching strategy to improve the real-time performance for the cached file as well as maintaining the file diversity at a relatively high level.

Includes members:
  Member "locally adaptive scheduling policy for optimizing information freshness in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a spatiotemporal framework for information freshness in iot uplink networks")
  Member "age of information performance of multiaccess strategies with packet management":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "optimizing information freshness in wireless networks under general interference constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")
  Member "optimizing age of information in wireless networks with perfect channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age of information in poisson networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a spatiotemporal framework for information freshness in iot uplink networks")
  Member "analysis and optimization of caching and multicasting in large scale cache enabled wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "caching at base stations with multi cluster multicast wireless backhaul via accelerated first order algorithm")
  Member "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stochastic geometry analysis of sojourn time in multi tier cellular 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)