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: "wireless optimisation via convex bandits unlicensed lte wifi coexistence"
  Abstract: Bandit Convex Optimisation (BCO) is a powerful framework for sequential decision-making in non-stationary and partially observable environments. In a BCO problem, a decision-maker sequentially picks actions to minimize the cumulative cost associated with these decisions, all while receiving partial feedback about the state of the environment. This formulation is a very natural fit for wireless-network optimisation problems and has great application potential since: i) instead of assuming full observability of the network state, it only requires the metric to optimise as input, and ii) it provides strong performance guarantees while making only minimal assumptions about the network dynamics. Despite these advantages, BCO has not yet been explored in the context of wireless-network optimisation. In this paper, we make the first steps to demonstrate the potential of BCO techniques by formulating an unlicensed LTE/WiFi fair coexistence use case in the framework, and providing experimental results in a simulated environment. On the algorithmic front, we propose a simple and natural sequential multi-point BCO algorithm amenable to wireless networking optimisation, and provide its theoretical analysis. We expect the contributions of this paper to pave the way to further research on the application of online convex methods in the bandit setting.

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)