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: "index policies for optimal mean variance trade off of inter delivery times in real time sensor networks"
  Abstract: A problem of much current practical interest is the replacement of the wiring infrastructure connecting approximately 200 sensor and actuator nodes in automobiles by an access point. This is motivated by the considerable savings in automobile weight, simplification of manufacturability, and future upgradability. #R##N#A key issue is how to schedule the nodes on the shared access point so as to provide regular packet delivery. In this and other similar applications, the mean of the inter-delivery times of packets, i.e., throughput, is not sufficient to guarantee service-regularity. The time-averaged variance of the inter-delivery times of packets is also an important metric. #R##N#So motivated, we consider a wireless network where an Access Point schedules real-time generated packets to nodes over a fading wireless channel. We are interested in designing simple policies which achieve optimal mean-variance tradeoff in interdelivery times of packets by minimizing the sum of time-averaged means and variances over all clients. Our goal is to explore the full range of the Pareto frontier of all weighted linear combinations of mean and variance so that one can fully exploit the design possibilities. We transform this problem into a Markov decision process and show that the problem of choosing which node's packet to transmit in each slot can be formulated as a bandit problem. We establish that this problem is indexable and explicitly derive the Whittle indices. The resulting Index policy is optimal in certain cases. We also provide upper and lower bounds on the cost for any policy. Extensive simulations show that Index policies perform better than previously proposed policies.

Connected through hyperedge HE-1 (induced by source paper "closed form whittle s index enabled random access for timely status update"):
  with members:
    - "age of information in g g 1 1 systems age expressions bounds special cases and optimization"
    - "age of information scaling in large networks with hierarchical cooperation"
    - "using erasure feedback for online timely updating with an energy harvesting sensor"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "information aging through queues a mutual information perspective"
    - "delay performance of multi antenna multicasting in wireless networks"
    - "towards massive connectivity support for scalable mmtc communications in 5g networks"
    - "age optimal sampling and transmission scheduling in multi source systems"

Connected through hyperedge HE-2 (induced by source paper "optimal information updating based on value of information"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "age optimal information updates in multihop networks"
    - "remote estimation of the wiener process over a channel with random delay"
    - "decentralized throughput maximizing policies for deadline constrained wireless networks"
    - "optimizing quality of experience of dynamic video streaming over fading wireless networks"
    - "a high reliability asymptotic approach for packet inter delivery time optimization in cyber physical systems"
    - "pathwise performance of debt based policies for wireless networks with hard delay constraints"

Connected through hyperedge HE-3 (induced by source paper "scheduling policies for minimizing age of information in broadcast wireless networks"):
  with members:
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"
    - "age optimal information updates in multihop networks"
    - "age and value of information non linear age case"
    - "status updates over unreliable multiaccess channels"
    - "update or wait how to keep your data fresh"
    - "age of information in the presence of error"
    - "optimizing data freshness throughput and delay in multi server information update systems"
    - "age of information the gamma awakening"

Connected through hyperedge HE-4 (induced by source paper "a unified sampling and scheduling approach for status update in multiaccess wireless networks"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "the age of information in networks moments distributions and sampling"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "update or wait how to keep your data fresh"

Connected through hyperedge HE-5 (induced by source paper "risk sensitive optimal control of queues"):
  with members:
    - "optimal routing for delay sensitive traffic in overlay networks"
    - "throughput optimal decentralized scheduling of multi hop networks with end to end deadline constraints unreliable links"
    - "a high reliability asymptotic approach for packet inter delivery time optimization in cyber physical systems"
    - "capacity and scheduling of access points for multiple live video streams"
    - "pathwise performance of debt based policies for wireless networks with hard delay constraints"

Connected through hyperedge HE-6 (induced by source paper "dynamic adaptive streaming using index based learning algorithms"):
  with members:
    - "a high reliability asymptotic approach for packet inter delivery time optimization in cyber physical systems"
    - "analysis of buffer starvation with application to objective qoe optimization of streaming services"
    - "pathwise performance of debt based policies for wireless networks with hard delay constraints"

Connected through hyperedge HE-7 (induced by source paper "a high reliability asymptotic approach for packet inter delivery time optimization in cyber physical systems"):
  with members:
    - "optimal energy efficient regular delivery of packets in cyber physical systems"
    - "pathwise performance of debt based policies for wireless networks with hard delay constraints"
    - "applications of tauberian theorem for high snr analysis of performance over fading channels"
    - "wireless network information flow a deterministic approach"
    - "high snr analysis of outage limited communications with bursty and delay limited information"

Connected through hyperedge HE-8 (induced by source paper "decentralized throughput maximizing policies for deadline constrained wireless networks"):
  with members:
    - "a high reliability asymptotic approach for packet inter delivery time optimization in cyber physical systems"
    - "pathwise performance of debt based policies for wireless networks with hard delay constraints"
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless 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)