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: "age oriented opportunistic relaying in cooperative status update systems with stochastic arrivals"
  Abstract: This paper considers a cooperative status update system with a source aiming to send randomly generated status updates to a designated destination as timely as possible with the help of a relay. We adopt a recently proposed concept, Age of Information (AoI), to characterize the timeliness of the status updates. We propose an age-oriented opportunistic relaying (AoR) protocol to reduce the AoI of the considered system. Specifically, the relay opportunistically replaces the source to retransmit the successfully received status updates that have not been correctly delivered to the destination, but the retransmission of the relay can be preempted by the arrival of a new status update at the source. By carefully analyzing the evolution of AoI, we derive a closed-form expression of the average AoI for the proposed AoR protocol. We further minimize the average AoI by optimizing the generation probability of the status updates at the source. Simulation results validate our theoretical analysis and demonstrate that the average AoI performance of the proposed AoR protocol is superior to that of the non-cooperative system.

Connected through hyperedge HE-1 (induced by source paper "age of information dependent random access for massive iot networks"):
  with members:
    - "minimizing age of information via hybrid noma oma"
    - "minimizing the age of information of cognitive radio based iot systems under a collision constraint"
    - "minimizing the age of information noma or oma"
    - "minimizing age of information for real time monitoring in resource constrained industrial iot networks"
    - "age of information in random access channels"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "multiuser scheduling for minimizing age of information in uplink mimo systems"):
  with members:
    - "minimizing age of information via hybrid noma oma"
    - "on the optimality of the whittle s index policy for minimizing the age of information"
    - "minimizing the age of information of cognitive radio based iot systems under a collision constraint"
    - "age of information dependent random access for massive iot networks"
    - "minimizing the age of information in wireless networks with stochastic arrivals"
    - "age optimal updates of multiple information flows"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "a reinforcement learning approach to age of information in multi user networks"

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)