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: "analysis and comparison of coverage probability in the presence of correlated nakagami m interferers and non identical independent nakagami m interferers"
  Abstract: In this work, coverage probability expressions are derived in terms of special functions for the following cases: $(i).$ Both the user channel and the $N$ interferers are independent and non identical Nakagami-m distributed random variables (RVs). $(ii).$ The $N$ interferers are correlated Nakagami-m RVs. Using the properties of special functions, the coverage probability expressions are further simplified. The coverage probability expressions for case $(i)$ and $(ii)$ are compared, and it is analytically shown that the coverage probability in the presence of correlated interferers is greater than or equal to the coverage probability in the presence of non-identical independent interferers when the shape parameter of the channel between the user and its base station is not greater than one. We also provide simulation results and these match with the derived theoretical results.

Connected through hyperedge HE-1 (induced by source paper "spectrum allocation for icic based picocell"):
  with members:
    - "optimal thresholds for coverage and rate in ffr schemes for planned cellular networks"
    - "power control factor selection in uplink ofdma cellular networks"
    - "modeling heterogeneous network interference using poisson point processes"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"
    - "analytical evaluation of fractional frequency reuse for heterogeneous cellular networks"
    - "a tractable approach to coverage and rate in cellular networks"
    - "analytical evaluation of fractional frequency reuse for ofdma 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)