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: "optimizing age of information in wireless networks with perfect channel state information"
  Abstract: Age of information (AoI), defined as the time elapsed since the last received update was generated, is a newly proposed metric to measure the timeliness of information updates in a network. We consider AoI minimization problem for a network with general interference constraints, and time varying channels. We propose two policies, namely, virtual-queue based policy and age-based policy when the channel state is available to the network scheduler at each time step. We prove that the virtual-queue based policy is nearly optimal, up to a constant additive factor, and the age-based policy is at-most factor 4 away from optimality. Comparing with our previous work, which derived age optimal policies when channel state information is not available to the scheduler, we demonstrate a 4 fold improvement in age due to the availability of channel state information.

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 "optimizing information freshness in wireless networks a stochastic geometry approach"):
  with members:
    - "timely updates in energy harvesting two hop networks offline and online policies"
    - "age optimal updates of multiple information flows"
    - "delay analysis of random scheduling and round robin in small cell networks"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age minimal transmission for energy harvesting sensors with finite batteries online policies"
    - "optimal status update for age of information minimization with an energy harvesting source"
    - "cell edge aware precoding for downlink massive mimo cellular networks"
    - "age optimal information updates in multihop networks"

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 "optimal sampling and scheduling for timely status updates in multi source networks"):
  with members:
    - "optimizing information freshness using low power status updates via sleep wake scheduling"
    - "age optimal updates of multiple information flows"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age optimal sampling and transmission scheduling in multi source systems"
    - "scheduling policies for age minimization in wireless networks with unknown channel state"
    - "the age of information in multihop networks"

Connected through hyperedge HE-6 (induced by source paper "waiting but not aging age of information and utility optimization under the pull model"):
  with members:
    - "combinatorial sleeping bandits with fairness constraints"
    - "the age of information in networks moments distributions and sampling"
    - "minimizing content staleness in dynamo style replicated storage systems"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "status updates through multicast networks"
    - "the age of information in multihop networks"
    - "the power of waiting for more than one response in minimizing the age of information"
    - "reward maximization under uncertainty leveraging side observations on networks"

Connected through hyperedge HE-7 (induced by source paper "benefits of coding on age of information in broadcast networks"):
  with members:
    - "sampling for remote estimation through queues age of information and beyond"
    - "optimal age over erasure channels"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "the age of information in networks moments distributions and sampling"
    - "online timely status updates with erasures for energy harvesting sensors"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "delay and peak age violation probability in short packet transmissions"

Connected through hyperedge HE-8 (induced by source paper "optimal control of status updates in a multiple access channel with stability constraints"):
  with members:
    - "optimal status updating with a finite battery energy harvesting source"
    - "control of status updates for energy harvesting devices that monitor processes with alarms"
    - "age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node"
    - "optimal status updating for an energy harvesting sensor with a noisy channel"
    - "age of information and throughput in a shared access network with heterogeneous traffic"
    - "coded status updates in an energy harvesting erasure channel"
    - "age of information performance of multiaccess strategies with packet management"
    - "optimizing information freshness in wireless networks under general interference constraints"

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)