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 information freshness in wireless networks under general interference constraints"
  Abstract: Age of information (AoI) is a recently proposed metric for measuring information freshness. AoI measures the time that elapsed since the last received update was generated. We consider the problem of minimizing average and peak AoI in wireless networks under general interference constraints. When fresh information is always available for transmission, we show that a stationary scheduling policy is peak age optimal. We also prove that this policy achieves average age that is within a factor of two of the optimal average age. In the case where fresh information is not always available, and packet/information generation rate has to be controlled along with scheduling links for transmission, we prove an important separation principle: the optimal scheduling policy can be designed assuming fresh information, and independently, the packet generation rate control can be done by ignoring interference. Peak and average AoI for discrete time G/Ber/1 queue is analyzed for the first time, which may be of independent interest.

Connected through hyperedge HE-1 (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 age of information in wireless networks with perfect channel state information"
    - "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-2 (induced by source paper "revealing much while saying less predictive wireless for status update"):
  with members:
    - "age of information vs value of information scheduling for cellular networked control systems"
    - "sampling for remote estimation through queues age of information and beyond"
    - "ai assisted low information latency wireless networking"
    - "status from a random field how densely should one update"
    - "closed form whittle s index enabled random access for timely status update"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "peak age of information in priority queueing systems"):
  with members:
    - "on the optimality of the whittle s index policy for minimizing the age of information"
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "age of information with prioritized streams when to buffer preempted packets"
    - "waiting before serving a companion to packet management in status update systems"
    - "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"
    - "timely status update in massive iot systems decentralized scheduling for wireless uplinks"
    - "age of information in g g 1 1 systems"

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"
    - "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"

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"
    - "age optimal sampling and transmission scheduling in multi source systems"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "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 "age of information optimized mac in v2x sidelink via piggyback based collaboration"):
  with members:
    - "ai assisted low information latency wireless networking"
    - "analytical models of the performance of c v2x mode 4 vehicular communications"
    - "hierarchical soft slicing to meet multi dimensional qos demand in cache enabled vehicular 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"
    - "study of the impact of phy and mac parameters in 3gpp c v2v mode 4"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"

Connected through hyperedge HE-7 (induced by source paper "optimal scheduling for maximizing information freshness system performance in industrial cyber physical systems"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "remote estimation of the wiener process over a channel with random delay"
    - "on the age of information in status update systems with packet management"

Connected through hyperedge HE-8 (induced by source paper "minimum age of information in the internet of things with non uniform status packet sizes"):
  with members:
    - "average peak age of information minimization in uav assisted iot networks"
    - "age optimal transmission of rateless codes in an erasure channel"
    - "beyond 5g with uavs foundations of a 3d wireless cellular network"
    - "a reinforcement learning approach to age of information in multi user networks"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "sampling for data freshness optimization non linear age functions"
    - "controlling packet drops to improve freshness of information"
    - "joint status sampling and updating for minimizing age of information in the internet of things"

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)