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: "a stochastic geometry approach to coverage in cellular networks with multi cell cooperation"
  Abstract: Multi-cell cooperation is a promising approach for mitigating inter-cell interference in dense cellular networks. Quantifying the performance of multi-cell cooperation is challenging as it integrates physical-layer techniques and network topologies. For tractability, existing work typically relies on the over-simplified Wyner-type models. In this paper, we propose a new stochastic-geometry model for a cellular network with multi-cell cooperation, which accounts for practical factors including the irregular locations of base stations (BSs) and the resultant path-losses. In particular, the proposed network-topology model has three key features: i) the cells are modeled using a Poisson random tessellation generated by Poisson distributed BSs, ii) multi-antenna BSs are clustered using a hexagonal lattice and BSs in the same cluster mitigate mutual interference by spatial interference avoidance, iii) BSs near cluster edges access a different sub-channel from that by other BSs, shielding cluster-edge mobiles from strong interference. Using this model and assuming sparse scattering, we analyze the shapes of the outage probabilities of mobiles served by cluster-interior BSs as the average number $K$ of BSs per cluster increases. The outage probability of a mobile near a cluster center is shown to be proportional to $e^{-c(2-\sqrt{\nu})^2K}$ where $\nu$ is the fraction of BSs lying in the interior of clusters and $c$ is a constant. Moreover, the outage probability of a typical mobile is proved to scale proportionally with $e^{-c' (1-\sqrt{\nu})^2K}$ where $c'$ is a constant.

Connected through hyperedge HE-1 (induced by source paper "wireless node cooperation with resource availability constraints"):
  with members:
    - "fundamentals of cluster centric content placement in cache enabled device to device networks"
    - "cooperative base station coloring for pair wise multi cell coordination"
    - "coverage gains from the static cooperation of mutually nearest neighbours"
    - "a stochastic geometry framework for analyzing pairwise cooperative cellular networks"
    - "analyzing interference from static cellular cooperation using the nearest neighbour model"
    - "a tractable model for noncoherent joint transmission base station cooperation"
    - "interference coordination random clustering and adaptive limited feedback"
    - "robust methods for lte and wimax dimensioning"

Connected through hyperedge HE-2 (induced by source paper "a tractable model for noncoherent joint transmission base station cooperation"):
  with members:
    - "a stochastic geometry framework for analyzing pairwise cooperative cellular networks"
    - "analysis of non coherent joint transmission cooperation in heterogeneous cellular networks"
    - "effect of spatial interference correlation on the performance of maximum ratio combining"
    - "worst case user analysis in poisson voronoi cells"
    - "cooperative relaying in a poisson field of interferers a diversity order analysis"
    - "offloading in heterogeneous networks modeling analysis and design insights"
    - "modeling heterogeneous network interference using poisson point processes"
    - "fundamental limits of cooperation"

Connected through hyperedge HE-3 (induced by source paper "analysis of non coherent joint transmission cooperation in heterogeneous cellular networks"):
  with members:
    - "a stochastic geometry framework for analyzing pairwise cooperative cellular networks"
    - "an overview of load balancing in hetnets old myths and open problems"
    - "a tractable model for noncoherent joint transmission base station cooperation"
    - "offloading in heterogeneous networks modeling analysis and design insights"
    - "modeling heterogeneous network interference using poisson point processes"
    - "fundamental limits of cooperation"

Connected through hyperedge HE-4 (induced by source paper "required base station density in coordinated multi point uplink with rate constraints"):
  with members:
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-5 (induced by source paper "downlink capacity and base station density in cellular networks"):
  with members:
    - "analytical modeling of uplink cellular networks"
    - "protocol level understanding of the aggregate interference in random csma ca networks"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"
    - "a tractable approach to coverage and rate in cellular networks"
    - "power control in cognitive radio networks how to cross a multi lane highway"
    - "femtocell networks a survey"
    - "uplink capacity and interference avoidance for two tier femtocell 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)