human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "an aoi optimal scheduling method for wireless transmissions with truncated channel inversion"
  Abstract: Being capable of characterizing the freshness of information, Age of Information (AoI) has attracted much attention recently. To provide better real-time service over fading channels, efficient scheduling methods are highly desired for wireless transmissions with freshness requirements. However, due to the channel instability and arrival randomness, it is challenging to achieve the optimal AoI. In this paper, we are interested in the AoI-optimal transmissions with truncated channel inversion, which has a low complexity transceiver architecture exploiting fixed coding and modulation. More specifically, we utilize a probabilistic scheduling method to minimize the AoI while satisfying an average power constraint. By characterizing the probabilistic scheduling policy with a Constrained Markov Decision Process (CMDP), we formulate a Linear Programming (LP) problem. Further, we present a low complexity algorithm to obtain the optimal scheduling policy, which is proved to belong to a set of semi-threshold-based policies. Numerical results verify the reduction in computational complexity and the optimality of semi-threshold-based policy, which indicates that we can achieve well real-time service with a low calculating complexity.

Connected through hyperedge HE-1 (induced by source paper "minimizing age of information with power constraints multi user opportunistic scheduling in multi state time varying channels"):
  with members:
    - "minimizing the age of information noma or oma"
    - "scheduling to minimize age of synchronization in wireless broadcast networks with random updates"
    - "scheduling to minimize age of information in multi state time varying networks with power constraints"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "joint queue aware and channel aware delay optimal scheduling of arbitrarily bursty traffic over multi state time varying channels"

Question: Please tell me which class the center node 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)