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 "on minimizing the maximum age of information for wireless erasure channels"):
  Abstract: Age-of-Information (AoI) is a recently proposed metric for quantifying the freshness of information from the UE's perspective in a communication network. Recently, Kadota et al. [1] have proposed an index-type approximately optimal scheduling policy for minimizing the average-AoI metric for a downlink transmission problem. For delay-sensitive applications, including real-time control of a cyber-physical system, or scheduling URLLC traffic in 5G, it is essential to have a more stringent uniform control on AoI across all users. In this paper, we derive an exactly optimal scheduling policy for this problem in a downlink cellular system with erasure channels. Our proof of optimality involves an explicit solution to the associated average-cost Bellman Equation, which might be of independent theoretical interest. We also establish that the resulting Age-process is positive recurrent under the optimal policy, and has an exponentially light tail, with the optimal large-deviation exponent. Finally, motivated by typical applications in small-cell residential networks, we consider the problem of minimizing the peak-AoI with throughput constraints to specific UEs, and derive a heuristic policy for this problem. Extensive numerical simulations have been carried out to compare the efficacy of the proposed policies with other well-known scheduling policies, such as Randomized scheduling and Proportional Fair.

Includes members:
  Member "scheduling policies for minimizing age of information in broadcast wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "who should google scholar update more often")
  Member "age optimal sampling and transmission scheduling in multi source systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "timely status updating through intermittent sensing and transmission")
  Member "wireless access for ultra reliable low latency communication urllc principles and building blocks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "massive mimo for internet of things iot connectivity")

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)