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: "utility aware optimal resource allocation protocol for uav assisted small cells with heterogeneous coverage demands"
  Abstract: In this paper, we consider a UAV-assisted small-cell having heterogeneous users with different data rates and coverage demands. Specifically, we propose a novel utility-aware resource-allocation protocol to maximize the utility of UAV by allowing it to simultaneously serve the highest possible number of heterogeneous users with available energy resources. In this regard, first, we derive a closed-form expression for the rate-coverage probability of a user considering Rician fading to incorporate the strong line of sight (LoS) component in UAV communication. Next, since this UAV utility maximization problem is non-convex and combinatorial, to obtain the global optimal resource allocation policy we propose an iterative feasibility checking method for fixed integers ranging from lower to upper bound on the number of users that can be served by UAV. To further reduce the complexity, we formulate an equivalent problem aimed at minimizing per user energy consumption, where tight analytical relaxation on rate-coverage probability constraint is used along with semi-closed expressions for joint-optimal power and time allocation. Lastly, via detailed numerical investigation, we validate our analytical claims, present insights on the impact of key system parameters, and demonstrate that 60% more users can be served using the proposed scheme, as compared to relevant benchmarks.

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.IT(Information Theory)