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: "access point density and bandwidth partitioning in ultra dense wireless networks"
  Abstract: This paper examines the impact of system parameters such as access point density and bandwidth partitioning on the performance of randomly deployed, interference-limited, dense wireless networks. While much progress has been achieved in analyzing randomly deployed networks via tools from stochastic geometry, most existing works either assume a very large user density compared to that of access points which does not hold in a dense network, and/or consider only the user signal-to-interference-ratio as the system figure of merit which provides only partial insight on user rate, as the effect of multiple access is ignored. In this paper, the user rate distribution is obtained analytically, taking into account the effects of multiple access as well as the SIR outage. It is shown that user rate outage probability is dependent on the number of bandwidth partitions (subchannels) and the way they are utilized by the multiple access scheme. The optimal number of partitions is lower bounded for the case of large access point density. In addition, an upper bound of the minimum access point density required to provide an asymptotically small rate outage probability is provided in closed form.

Connected through hyperedge HE-1 (induced by source paper "reliability and local delay in wireless networks does bandwidth partitioning help"):
  with members:
    - "the spatial outage capacity of wireless networks"
    - "the meta distribution of the sir in poisson bipolar and cellular networks"
    - "managing interference correlation through random medium access"
    - "a new phase transitions for local delays in manets"
    - "bandwidth partitioning in decentralized wireless networks"

Connected through hyperedge HE-2 (induced by source paper "cross mode interference characterization in cellular networks with voronoi guard regions"):
  with members:
    - "user point processes in cellular networks"
    - "the intensity matching approach a tractable stochastic geometry approximation to system level analysis of cellular networks"
    - "poisson hole process theory and applications to wireless networks"
    - "modeling cellular networks with full duplex d2d communication a stochastic geometry approach"
    - "decentralized opportunistic access for d2d underlaid cellular networks"
    - "an analytical framework for device to device communication in cellular networks"
    - "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"
    - "operational region of d2d communications for enhancing cellular network performance"

Connected through hyperedge HE-3 (induced by source paper "5g ultra dense networks with non uniform distributed users"):
  with members:
    - "ultra dense small cell networks turning density into energy efficiency"
    - "tractable resource management with uplink decoupled millimeter wave overlay in ultra dense cellular networks"
    - "performance impact of los and nlos transmissions in dense cellular networks"
    - "ambient rf energy harvesting in ultra dense small cell networks performance and trade offs"
    - "spatial spectrum and energy efficiency of random cellular networks"
    - "towards 1 gbps ue in cellular systems understanding ultra dense small cell deployments"
    - "user mobility evaluation for 5g small cell networks based on individual mobility model"
    - "5g ultra dense cellular networks"

Connected through hyperedge HE-4 (induced by source paper "ultra dense networks the new wireless frontier for enabling 5g access"):
  with members:
    - "spatial coordination strategies in future ultra dense wireless networks"
    - "what will 5g be"
    - "on coordinating ultra dense wireless access networks optimization modeling algorithms and insights"
    - "a tractable approach to coverage and rate in 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)