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: "scheduling policies for age minimization in wireless networks with unknown channel state"
  Abstract: Age of information (AoI) is a recently proposed metric that measures the time elapsed since the generation of the last received information update. We consider the problem of AoI minimization for a network under general interference constraints, and time varying channel. We study the case where the channel statistics are known, but the current channel state is unknown. We propose two scheduling policies, namely, the virtual queue based policy and age-based policy. In the virtual queue based policy, the scheduler schedules links with maximum weighted sum of the virtual queue lengths, while in the age-based policy, the scheduler schedules links with maximum weighted sum of a function of link AoI. We prove that the virtual queue based policy is peak age optimal, up to an additive constant, while the age-based policy is at most factor 4 away from the optimal age. Numerical results suggest that both the proposed policies are, in fact, very close to the optimal.

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 "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-3 (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-4 (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"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "the age of information in multihop networks"

Connected through hyperedge HE-5 (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-6 (induced by source paper "minimizing the age of information in wireless networks with stochastic arrivals"):
  with members:
    - "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"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"
    - "age optimal information updates in multihop networks"
    - "age and value of information non linear age case"
    - "status updates over unreliable multiaccess channels"

Connected through hyperedge HE-7 (induced by source paper "minimizing age of information with power constraints opportunistic scheduling in multi state time varying networks"):
  with members:
    - "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"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "sending information through status updates"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "timely throughput optimal scheduling with prediction"
    - "average age of information with hybrid arq under a resource constraint"

Connected through hyperedge HE-8 (induced by source paper "scheduling to minimize age of information in multi state time varying networks with power constraints"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "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"
    - "sending information through status updates"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "timely throughput optimal scheduling with prediction"
    - "average age of information with hybrid arq under a resource constraint"
    - "opportunistic scheduling as restless bandits"

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.NI(Networking and Internet Architecture)