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 to minimize age of synchronization in wireless broadcast networks with random updates"
  Abstract: In this work, a wireless broadcast network with a base station (BS) sending random time-sensitive information updates to multiple users with interference constraints is considered. The Age of Synchronization (AoS), namely the amount of time elapsed since the information stored at the network user becomes desynchronized, is adopted to measure data freshness from the perspective of network users. Compared with the more widely used metric---the Age of Information (AoI), AoS accounts for the freshness of the randomly changing content. The AoS minimization scheduling problem is formulated into a discrete time Markov decision process and the optimal solution is approximated through structural finite state policy iteration. An index based heuristic scheduling policy based on restless multi-arm bandit (RMAB) is provided to further reduce computational complexity. Simulation results show that the proposed index policy can achieve compatible performance with the MDP and close to the AoS lower bound. Moreover, theoretic analysis and simulations reveal the differences between AoS and AoI. AoI minimization scheduling policy cannot guarantee a good AoS performance.

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

Connected through hyperedge HE-2 (induced by source paper "timely synchronization with sporadic status changes"):
  with members:
    - "the age of incorrect information a new performance metric for status updates"
    - "control of status updates for energy harvesting devices that monitor processes with alarms"
    - "timely cloud computing preemption and waiting"
    - "age optimal updates of multiple information flows"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "to skip or to switch minimizing age of information under link capacity constraint"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "age of information minimization for an energy harvesting source with updating erasures with and without feedback"

Connected through hyperedge HE-3 (induced by source paper "age of information aware cache updating with file and age dependent update durations"):
  with members:
    - "age of information for updates with distortion"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "joint status sampling and updating for minimizing age of information in the internet of things"
    - "when to preempt age of information minimization under link capacity constraint"
    - "scheduling policies for age minimization in wireless networks with unknown channel state"
    - "the age of information real time status updating by multiple sources"
    - "robust monotonic optimization framework for multicell miso systems"

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)