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: "average age of information with hybrid arq under a resource constraint"
  Abstract: Scheduling of the transmission of status updates over an error-prone communication channel is studied in order to minimize the long-term average age of information (AoI) at the destination, under an average resource constraint at the source node, which limits the average number of transmissions. After each transmission, the source receives an instantaneous ACK/NACK feedback, and decides on the next update, without a priori knowledge on the success of the future transmissions. The optimal scheduling policy is studied under different feedback mechanisms; in particular, standard automatic repeat request (ARQ) and hybrid ARQ (HARQ) protocols are considered. Average-cost reinforcement learning algorithms are proposed when the error probabilities for the HARQ system are unknown.

Connected through hyperedge HE-1 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited"):
  with members:
    - "average age of information for a multi source m m 1 queueing model with packet management"
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "on the age of information in multi source queueing models"
    - "age optimal updates of multiple information flows"
    - "the age of information in networks moments distributions and sampling"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "to skip or to switch minimizing age of information under link capacity constraint"
    - "coded status updates in an energy harvesting erasure channel"

Connected through hyperedge HE-2 (induced by source paper "timely status updating through intermittent sensing and transmission"):
  with members:
    - "optimizing information freshness in computing enabled iot networks"
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "trading off computation with transmission in status update systems"
    - "waiting before serving a companion to packet management in status update systems"
    - "reducing age of information for computation intensive messages via packet replacement"
    - "the age of information in networks moments distributions and sampling"
    - "optimal status updating for an energy harvesting sensor with a noisy channel"
    - "can determinacy minimize age of information"

Connected through hyperedge HE-3 (induced by source paper "adaptive power and rate control for real time status updating over fading channels"):
  with members:
    - "on the optimality of the whittle s index policy for minimizing the age of information"
    - "minimizing age of information with power constraints multi user opportunistic scheduling in multi state time varying channels"
    - "real time reconstruction of counting process through queues"
    - "delay optimal and energy efficient communications with markovian arrivals"
    - "minimizing age of information for real time monitoring in resource constrained industrial iot networks"
    - "the roadmap to 6g ai empowered wireless networks"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "minimizing age of information with power constraints multi user opportunistic scheduling in multi state time varying channels"):
  with members:
    - "an aoi optimal scheduling method for wireless transmissions with truncated channel inversion"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "a spatiotemporal framework for information freshness in iot uplink networks"):
  with members:
    - "locally adaptive scheduling policy for optimizing information freshness in wireless networks"
    - "age of information in poisson networks"
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "the meta distribution of the sir for cellular networks with power control"
    - "heterogeneous cellular networks with spatio temporal traffic delay analysis and scheduling"
    - "the age of information real time status updating by multiple sources"
    - "the meta distribution of the sir in poisson bipolar and cellular networks"
    - "on stochastic geometry modeling of cellular uplink transmission with truncated channel inversion power control"

Connected through hyperedge HE-6 (induced by source paper "minimizing age of information via hybrid noma oma"):
  with members:
    - "minimizing the age of information of cognitive radio based iot systems under a collision constraint"
    - "minimizing the age of information noma or oma"
    - "minimizing the age of information in wireless networks with stochastic arrivals"
    - "minimizing age of information for real time monitoring in resource constrained industrial iot networks"
    - "minimizing the age of information in a csma environment"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "to skip or to switch minimizing age of information under link capacity constraint"

Connected through hyperedge HE-7 (induced by source paper "minimizing the age of information of cognitive radio based iot systems under a collision constraint"):
  with members:
    - "minimizing age of information for real time monitoring in resource constrained industrial iot networks"
    - "to skip or to switch minimizing age of information under link capacity constraint"
    - "joint status sampling and updating for minimizing age of information in the internet of things"
    - "spectrum sharing for internet of things a survey"
    - "wireless network design for control systems a survey"
    - "update or wait how to keep your data fresh"
    - "the emerging internet of things marketplace from an industrial perspective a survey"

Connected through hyperedge HE-8 (induced by source paper "age oriented opportunistic relaying in cooperative status update systems with stochastic arrivals"):
  with members:
    - "minimizing the age of information of cognitive radio based iot systems under a collision constraint"
    - "timely updates in energy harvesting two hop networks offline and online policies"
    - "minimizing age of information for real time monitoring in resource constrained industrial iot networks"
    - "the age of updates in a simple relay network"
    - "update or wait how to keep your data fresh"
    - "on the age of information in status update systems with packet management"

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)