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: "fair dynamic spectrum management in licensed shared access systems"
  Abstract: Licensed Shared Access (LSA) is a spectrum sharing mechanism where bandwidth is shared between a primary network, called incumbent, and a secondary mobile network. In this work, we address dynamic spectrum management mechanisms for LSA systems. We propose a fair spectrum management algorithm for distributing incumbent's available spectrum among mobile networks. Then, we adapt the proposed algorithm to take mobile network operator's regulatory compliance aspect into account and penalize the misbehaving network operators in spectrum allocation. We extend our results to the scenario where more than one incumbent offer spectrum to the mobile operators in a service area and propose various protocols, which ensure long term fair spectrum allocation within the individual LSA networks. Finally, we numerically evaluate the performance of the proposed spectrum allocation algorithms and compare them using various performance metrics. For the single incumbent case, the numerical results show that the spectrum allocation is fair when the mobile operators follow the spectrum access regulations. We demonstrate the effect of our proposed penalty functions on spectrum allocation when the operators do not comply with the regulatory aspects. For the multi-incumbent scenario, the results show a trade-off between efficient spectrum allocation and flexibility in spectrum access for our proposed algorithms.

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)