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: "adaptive video streaming over lte unlicensed"
  Abstract: In this paper we consider the problem of adaptive video streaming over an LTE-A network that utilizes Licensed Assisted Access (LAA) which is an instance of LTE Unlicensed. With LTE Unlicensed users of the LTE-A network opportunisti- cally access radio resources from unlicensed and licensed carriers through Carrier Aggregation (CA). Our objective is to select the highest possible video quality for each LTE-A user while also try to deliver video data in time for playback, and thus avoid buffer under-run events that deteriorate viewing experience. However, the unpredictable nature of the wireless channel, as well as the unknown utilization of the unlicensed carrier by other unlicensed users, result in a challenging optimization problem. We first focus on developing an accurate system model of the adaptive streaming system, LTE-A, and the stochastic availability of unlicensed resources. Then, the formulated problem is solved in two stages: First, we calculate a proportionally fair video quality for each user, and second we execute resource allocation on a shorter time scale compatible with LTE-A. We compare our framework with the typical proportional fair scheduler as well as a state-of-the-art LTE-A adaptive video streaming framework in terms of average segment quality and number of buffer under- run events. Results show that the proposed quality selection and scheduling algorithms, not only achieve higher video segment quality in most cases, but also minimize the amount and duration of video freezes as a result of buffer under-run events.

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)