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: "taming the tail of maximal information age in wireless industrial networks"
  Abstract: In wireless industrial networks, the information of time-sensitive control systems needs to be transmitted in an ultra-reliable and low-latency manner. This letter studies the resource allocation problem in  finite blocklength  transmission, in which the information freshness is measured as the  age of information  (AoI) whose maximal AoI is characterized using  extreme value theory  (EVT). The considered system design is to minimize the sensors’ transmit power and transmission blocklength subject to constraints on the maximal AoI’s tail behavior. The studied problem is solved using Lyapunov stochastic optimization, and a dynamic reliability and age-aware policy for resource allocation and status updates is proposed. Simulation results validate the effectiveness of using EVT to characterize the maximal AoI. It is shown that sensors need to send larger-size data with longer transmission blocklength at lower transmit power. Moreover, the maximal AoI’s tail decays faster at the expense of higher average information age.

Connected through hyperedge HE-1 (induced by source paper "risk aware optimization of age of information in the internet of things"):
  with members:
    - "optimized age of information tail for ultra reliable low latency communications in vehicular networks"
    - "a reinforcement learning framework for optimizing age of information in rf powered communication systems"
    - "a vision of 6g wireless systems applications trends technologies and open research problems"
    - "minimum age of information in the internet of things with non uniform status packet sizes"
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "joint status sampling and updating for minimizing age of information in the internet of things"
    - "age of information minimization for an energy harvesting source with updating erasures with and without feedback"
    - "when to preempt age of information minimization under link capacity constraint"

Connected through hyperedge HE-2 (induced by source paper "predictive control and communication co design a gaussian process regression approach"):
  with members:
    - "extreme urllc vision challenges and key enablers"
    - "massive autonomous uav path planning a neural network based mean field game theoretic approach"
    - "wireless network intelligence at the edge"
    - "joint communication and control for wireless autonomous vehicular platoon systems"
    - "wireless network design for control systems a survey"
    - "stability and capacity regions or discrete time queueing 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.NI(Networking and Internet Architecture)