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: "downlink coverage probability in cellular networks with poisson poisson cluster deployed base stations"
  Abstract: Poisson-Poisson cluster processes (PPCPs) are a class of point processes exhibiting attractive point patterns. Recently, PPCPs are actively studied for modeling and analysis of heterogeneous cellular networks or device-to-device networks. However, surprisingly, to the best knowledge of the author, there is no exact derivation of downlink coverage probability in a numerically computable form for a cellular network with base stations (BSs) deployed according to a PPCP within the most fundamental setup such as single-tier, Rayleigh fading and nearest BS association. In this paper, we consider this fundamental model and derive a numerically computable form of coverage probability. To validate the analysis, we compare the results of numerical computations with those by Monte Carlo simulations and confirm the good agreement.

Connected through hyperedge HE-1 (induced by source paper "coverage analysis of integrated sub 6ghz mmwave cellular networks with hotspots"):
  with members:
    - "cache enabled hetnets with millimeter wave small cells"
    - "equi coverage contours in cellular networks"
    - "3gpp inspired hetnet model using poisson cluster process sum product functionals and downlink coverage"
    - "modeling and analyzing millimeter wave cellular systems"
    - "coverage analysis for millimeter wave networks the impact of directional antenna arrays"
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "downlink and uplink cell association with traditional macrocells and millimeter wave small cells"
    - "nearest neighbor and contact distance distributions for thomas cluster process"

Connected through hyperedge HE-2 (induced by source paper "on the contact and nearest neighbor distance distributions for the n dimensional matern cluster process"):
  with members:
    - "equi coverage contours in cellular networks"
    - "3gpp inspired hetnet model using poisson cluster process sum product functionals and downlink coverage"
    - "stochastic geometry modeling and analysis of single and multi cluster wireless networks"
    - "a primer on cellular network analysis using stochastic geometry"
    - "enriched k tier hetnet model to enable the analysis of user centric small cell deployments"
    - "poisson cluster process based analysis of hetnets with correlated user and base station locations"
    - "nearest neighbor and contact distance distributions for thomas cluster process"
    - "modeling and performance analysis of clustered device to device networks"

Connected through hyperedge HE-3 (induced by source paper "unified analysis of hetnets using poisson cluster process under max power association"):
  with members:
    - "equi coverage contours in cellular networks"
    - "3gpp inspired hetnet model using poisson cluster process sum product functionals and downlink coverage"
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "stochastic geometry modeling and analysis of single and multi cluster wireless networks"
    - "enriched k tier hetnet model to enable the analysis of user centric small cell deployments"
    - "poisson cluster process based analysis of hetnets with correlated user and base station locations"
    - "interference functionals in poisson networks"
    - "nearest neighbor and contact distance distributions for thomas cluster process"

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)