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: "coverage analysis in downlink poisson cellular network with kappa mu shadowed fading"
  Abstract: The downlink coverage probability of a cellular network, when the base station locations are modelled by a Poisson point process (PPP), is known when the desired channel is Nakagami distributed with an integer shape parameter. However, for many interesting fading distributions such as Rician, Rician shadowing, $\kappa$-$\mu$, $\eta$-$\mu$, etc., the coverage probability is unknown. $\kappa$-$\mu$ shadowed fading is a generic fading distribution whose special cases are many of these popular distributions known so far. In this letter, we derive the coverage probability when the desired channel experiences $\kappa$-$\mu$ shadowed fading. Using numerical simulations, we verify our analytical expressions.

Connected through hyperedge HE-1 (induced by source paper "transmit power policy and ergodic multicast rate analysis of cognitive radio networks in generalized fading"):
  with members:
    - "asymptotic performance analysis of generalized user selection for interference limited multiuser secondary networks"
    - "asymptotic maximal order statistic for sir in κ μ shadowed fading"
    - "mimo underlay cognitive radio optimized power allocation effective number of transmit antennas and harvest transmit tradeoff"
    - "error vector magnitude analysis in generalized fading with co channel interference"
    - "outage probability and rate for kappa mu shadowed fading in interference limited scenario"
    - "relay selection improves the security reliability trade off in cognitive radio systems"
    - "spectrum sharing multi hop cooperative relaying performance analysis using extreme value theory"
    - "the effects of limited channel knowledge on cognitive radio system capacity"

Connected through hyperedge HE-2 (induced by source paper "asymptotic maximal order statistic for sir in κ μ shadowed fading"):
  with members:
    - "error vector magnitude analysis in generalized fading with co channel interference"
    - "outage probability and rate for kappa mu shadowed fading in interference limited scenario"
    - "massive mimo ten myths and one critical question"
    - "uplink achievable rate for massive mimo systems with low resolution adc"
    - "massive mimo performance evaluation based on measured propagation data"
    - "massive mimo for next generation wireless systems"
    - "on the sum of correlated squared kappa mu shadowed random variables and its application to performance analysis of mrc"
    - "spectrum sharing multi hop cooperative relaying performance analysis using extreme value theory"

Connected through hyperedge HE-3 (induced by source paper "unified analysis and optimization of d2d communications in cellular networks over fading channels"):
  with members:
    - "3gpp inspired hetnet model using poisson cluster process sum product functionals and downlink coverage"
    - "a stochastic geometric analysis of device to device communications operating over generalized fading channels"
    - "unified stochastic geometry modeling and analysis of cellular networks in los nlos and shadowed fading"
    - "modeling and performance analysis of clustered device to device networks"
    - "an analytical framework for device to device communication in cellular networks"
    - "distributed sir aware opportunistic access control for d2d underlaid cellular networks"
    - "power control for d2d underlaid cellular networks modeling algorithms and analysis"

Connected through hyperedge HE-4 (induced by source paper "closed form coverage probability for downlink poisson network with double shadowed fading"):
  with members:
    - "a primer on cellular network analysis using stochastic geometry"
    - "enriched k tier hetnet model to enable the analysis of user centric small cell deployments"
    - "downlink rate distribution in heterogeneous cellular networks under generalized cell selection"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-5 (induced by source paper "unified stochastic geometry modeling and analysis of cellular networks in los nlos and shadowed fading"):
  with members:
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "unified stochastic geometry model for mimo cellular networks with retransmissions"
    - "modeling cellular networks in fading environments with dominant specular components"
    - "on modeling coverage and rate of random cellular networks under generic channel fading"
    - "optimizing user association and spectrum allocation in hetnets a utility perspective"
    - "hethetnets heterogeneous traffic distribution in heterogeneous wireless cellular networks"
    - "downlink cellular network analysis with multi slope path loss models"
    - "tractable model for rate in self backhauled millimeter wave cellular networks"

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)