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: "minimizing the age of information in wireless networks with stochastic arrivals"
  Abstract: We consider a wireless network with a base station serving multiple traffic streams to different destinations. Packets from each stream arrive to the base station according to a stochastic process and are enqueued in a separate (per stream) queue. The queueing discipline controls which packet within each queue is available for transmission. The base station decides, at every time t, which stream to serve to the corresponding destination. The goal of scheduling decisions is to keep the information at the destinations fresh. Information freshness is captured by the Age of Information (AoI) metric. #R##N#In this paper, we derive a lower bound on the AoI performance achievable by any given network operating under any queueing discipline. Then, we consider three common queueing disciplines and develop both an Optimal Stationary Randomized policy and a Max-Weight policy under each discipline. Our approach allows us to evaluate the combined impact of the stochastic arrivals, queueing discipline and scheduling policy on AoI. We evaluate the AoI performance both analytically and using simulations. Numerical results show that the performance of the Max-Weight policy is close to the analytical lower bound.

Connected through hyperedge HE-1 (induced by source paper "age of information for multicast transmission with fixed and random deadlines in iot systems"):
  with members:
    - "age of information for computation intensive messages in mobile edge computing"
    - "average peak age of information minimization in uav assisted iot networks"
    - "economics of age of information management under network externalities"
    - "broadcast age of information in csma ca based wireless networks"
    - "adaptive coding for information freshness in a two user broadcast erasure channel"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "reinforcement learning based scheduling algorithm for optimizing age of information in ultra reliable low latency networks"

Connected through hyperedge HE-2 (induced by source paper "multiuser scheduling for minimizing age of information in uplink mimo systems"):
  with members:
    - "age oriented opportunistic relaying in cooperative status update systems with stochastic arrivals"
    - "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"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "minimizing age of information via hybrid noma oma"):
  with members:
    - "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"
    - "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"
    - "to skip or to switch minimizing age of information under link capacity constraint"
    - "average age of information with hybrid arq under a resource constraint"

Connected through hyperedge HE-4 (induced by source paper "optimal sampling cost in wireless networks with age of information constraints"):
  with members:
    - "power minimization in wireless sensor networks with constrained aoi using stochastic optimization"
    - "optimal control of status updates in a multiple access channel with stability constraints"
    - "age of information performance of multiaccess strategies with packet management"
    - "age and value of information non linear age case"

Connected through hyperedge HE-5 (induced by source paper "age of information in random access channels"):
  with members:
    - "benefits of coding on age of information in broadcast networks"
    - "optimal age over erasure 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"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"
    - "age of information performance of multiaccess strategies with packet management"
    - "solving fractional polynomial problems by polynomial optimization theory"

Connected through hyperedge HE-6 (induced by source paper "age of information aware radio resource management in vehicular networks a proactive deep reinforcement learning perspective"):
  with members:
    - "spectrum sharing in vehicular networks based on multi agent reinforcement learning"
    - "learning to entangle radio resources in vehicular communications an oblivious game theoretic perspective"
    - "optimized computation offloading performance in virtual edge computing systems via deep reinforcement learning"
    - "multi tenant cross slice resource orchestration a deep reinforcement learning approach"
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "deep learning with long short term memory for time series prediction"
    - "deep reinforcement learning based resource allocation for v2v communications"
    - "performance optimization in mobile edge computing via deep reinforcement learning"

Connected through hyperedge HE-7 (induced by source paper "how often should i access my online social networks"):
  with members:
    - "age of information vs value of information scheduling for cellular networked control systems"
    - "performance analysis of online social platforms"
    - "biases in the facebook news feed a case study on the italian elections"
    - "fairness in online social network timelines measurements models and mechanism design"
    - "age optimal sampling and transmission scheduling in multi source systems"
    - "optimal status update for age of information minimization with an energy harvesting source"
    - "characterizing information diets of social media users"
    - "the age of information real time status updating by multiple sources"

Connected through hyperedge HE-8 (induced by source paper "deadline aware scheduling for maximizing information freshness in industrial cyber physical system"):
  with members:
    - "performance characterization using aoi in a single loop networked control system"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age optimal sampling and transmission scheduling in multi source systems"
    - "optimizing data freshness throughput and delay in multi server information update 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.NI(Networking and Internet Architecture)