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: "connection between system parameters and localization probability in network of randomly distributed nodes"
  Abstract: This article deals with localization probability in a network of randomly distributed communication nodes contained in a bounded domain. A fraction of the nodes denoted as L-nodes are assumed to have localization information while the rest of the nodes denoted as NL nodes do not. The basic model assumes each node has a certain radio coverage within which it can make relative distance measurements. We model both the case radio coverage is fixed and the case radio coverage is determined by signal strength measurements in a Log-Normal Shadowing environment. We apply the probabilistic method to determine the probability of NL-node localization as a function of the coverage area to domain area ratio and the density of L-nodes. We establish analytical expressions for this probability and the transition thresholds with respect to key parameters whereby marked change in the probability behavior is observed. The theoretical results presented in the article are supported by simulations.

Connected through hyperedge HE-1 (induced by source paper "towards a tractable analysis of localization fundamentals in cellular networks"):
  with members:
    - "sinr based k coverage probability in cellular networks with arbitrary shadowing"
    - "quality of service in wireless cellular networks subject to log normal shadowing"
    - "downlink rate distribution in heterogeneous cellular networks under generalized cell selection"
    - "load aware modeling and analysis of heterogeneous cellular networks"
    - "modeling heterogeneous network interference using poisson point processes"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"
    - "a tractable approach to coverage and rate in cellular networks"
    - "the effect of fading channel inversion and threshold scheduling on ad hoc networks"

Connected through hyperedge HE-2 (induced by source paper "a tractable analysis of the improvement in unique localizability through collaboration"):
  with members:
    - "towards a tractable analysis of localization fundamentals in cellular networks"
    - "sinr based k coverage probability in cellular networks with arbitrary shadowing"
    - "analytical modeling of uplink cellular networks"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"
    - "a tractable approach to coverage and rate in cellular networks"
    - "fundamental limits of wideband localization part ii cooperative networks"
    - "connectivity of heterogeneous wireless 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.NI(Networking and Internet Architecture)