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: "the kappa mu shadowed fading model unifying the kappa mu and eta mu distributions"
  Abstract: This paper shows that the recently proposed $\kappa$-$\mu$ shadowed fading model includes, besides the $\kappa$-$\mu$ model, the $\eta$-$\mu$ fading model as a particular case. This has important relevance in practice, as it allows for the unification of these popular fading distributions through a more general, yet equally tractable, model. The convenience of new underlying physical models is discussed. Then, we derive simple and novel closed-form expressions for the asymptotic ergodic capacity in $\kappa$-$\mu$ shadowed fading channels, which illustrate the effects of the different fading parameters on the system performance. By exploiting the unification here unveiled, the asymptotic capacity expressions for the $\kappa$-$\mu$ and $\eta$-$\mu$ fading models are also obtained in closed-form as special cases.

Connected through hyperedge HE-1 (induced by source paper "modeling and analysis of wireless channels via the mixture of gaussian distribution"):
  with members:
    - "on the capacity of the underwater acoustic channel with dominant noise sources"
    - "statistical characterization of kappa mu shadowed fading"

Connected through hyperedge HE-2 (induced by source paper "on some unifications arising from the mimo rician shadowed model"):
  with members:
    - "statistical characterization of kappa mu shadowed fading"
    - "mimo networks the effects of interference"
    - "random matrix model for nakagami hoyt fading"
    - "mimo multichannel beamforming ser and outage using new eigenvalue distributions of complex noncentral wishart matrices"

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)