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: "on the monotonicity log concavity and tight bounds of the generalized marcum and nuttall q functions"
  Abstract: In this paper, we present a comprehensive study of the monotonicity and log-concavity of the generalized Marcum and Nuttall Q-functions. More precisely, a simple probabilistic method is firstly given to prove the monotonicity of these two functions. Then, the log-concavity of the generalized Marcum Q-function and its deformations is established with respect to each of the three parameters. Since the Nuttall Q-function has similar probabilistic interpretations as the generalized Marcum Q-function, we deduce the log-concavity of the Nuttall Q-function. By exploiting the log-concavity of these two functions, we propose new tight lower and upper bounds for the generalized Marcum and Nuttall Q-functions. Our proposed bounds are much tighter than the existing bounds in the literature in most of the cases. The relative errors of our proposed bounds converge to 0 as b tends to infinity. The numerical results show that the absolute relative errors of the proposed bounds are less than 5% in most of the cases. The proposed bounds can be effectively applied to the outage probability analysis of interference-limited systems such as cognitive radio and wireless sensor network, in the study of error performance of various wireless communication systems operating over fading channels and extracting the log-likelihood ratio for differential phase-shift keying (DPSK) signals.

Connected through hyperedge HE-1 (induced by source paper "utility aware optimal resource allocation protocol for uav assisted small cells with heterogeneous coverage demands"):
  with members:
    - "capacity characterization of uav enabled two user broadcast channel"
    - "3 d placement of an unmanned aerial vehicle base station for maximum coverage of users with different qos requirements"
    - "placement optimization of uav mounted mobile base stations"
    - "joint trajectory and communication design for multi uav enabled wireless networks"
    - "mobile unmanned aerial vehicles uavs for energy efficient internet of things communications"
    - "efficient deployment of multiple unmanned aerial vehicles for optimal wireless coverage"
    - "resource allocation for machine to machine communications with unmanned aerial vehicles"
    - "wireless communications with unmanned aerial vehicles opportunities and challenges"

Connected through hyperedge HE-2 (induced by source paper "a comprehensive performance evaluation of a df based multi hop system over alpha kappa mu and alpha kappa mu extreme fading channels"):
  with members:
    - "rician k factor based analysis of xlos service probability in 5g outdoor ultra dense networks"
    - "on the capacity of decode and forward relaying over rician fading channels"

Connected through hyperedge HE-3 (induced by source paper "low papr preamble design for fbmc systems"):
  with members:
    - "preamble based channel estimation for cp ofdm and ofdm oqam systems a comparative study"

Connected through hyperedge HE-4 (induced by source paper "multi snapshot newtonized orthogonal matching pursuit for line spectrum estimation with multiple measurement vectors"):
  with members:
    - "sparse methods for direction of arrival estimation"
    - "efficient downlink channel reconstruction for fdd multi antenna systems"
    - "on the sample complexity of multichannel frequency estimation via convex optimization"
    - "compressive channel estimation and tracking for large arrays in mm wave picocells"
    - "newtonized orthogonal matching pursuit frequency estimation over the continuum"
    - "off the grid line spectrum denoising and estimation with multiple measurement vectors"
    - "exact joint sparse frequency recovery via optimization methods"
    - "a discretization free sparse and parametric approach for linear array signal processing"

Connected through hyperedge HE-5 (induced by source paper "newtonized orthogonal matching pursuit for line spectrum estimation with multiple measurement vectors"):
  with members:
    - "sparse methods for direction of arrival estimation"
    - "efficient downlink channel reconstruction for fdd multi antenna systems"
    - "on the sample complexity of multichannel frequency estimation via convex optimization"
    - "compressive channel estimation and tracking for large arrays in mm wave picocells"
    - "newtonized orthogonal matching pursuit frequency estimation over the continuum"
    - "off the grid line spectrum denoising and estimation with multiple measurement vectors"
    - "exact joint sparse frequency recovery via optimization methods"
    - "a discretization free sparse and parametric approach for linear array signal processing"

Connected through hyperedge HE-6 (induced by source paper "wilad wireless localisation through anomaly detection"):
  with members:
    - "one class classification taxonomy of study and review of techniques"

Connected through hyperedge HE-7 (induced by source paper "a new asymptotic analysis technique for diversity receptions over correlated lognormal fading channels"):
  with members:
    - "performance analysis of mimo mrc in double correlated rayleigh environments"

Connected through hyperedge HE-8 (induced by source paper "finite blocklength analysis of energy harvesting channels"):
  with members:
    - "moderate deviation asymptotics for variable length codes with feedback"
    - "non asymptotic achievable rates for energy harvesting channels using save and transmit"
    - "channels with cost constraints strong converse and dispersion"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "moderate deviations in channel coding"
    - "information spectrum approach to second order coding rate in channel coding"

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)