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: "on the outage probability of localization in randomly deployed wireless networks"
  Abstract: This letter analyzes the localization outage probability (LOP), the probability that the position error exceeds a given threshold, in randomly deployed wireless networks. Two typical cases are considered: a mobile agent uses all the neighboring anchors or selects the best pair of anchors for self-localization. We derive the exact LOP for the former case and tight bounds for the LOP for the latter case. The comparison between the two cases reveals the advantage of anchor selection in terms of LOP versus complexity tradeoff, providing insights into the design of efficient localization systems.

Connected through hyperedge HE-1 (induced by source paper "cooperative network synchronization asymptotic analysis"):
  with members:
    - "a scalable algorithm for tracking an unknown number of targets using multiple sensors"
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "cooperative simultaneous localization and synchronization in mobile agent networks"
    - "cooperative joint localization and clock synchronization based on gaussian message passing in asynchronous wireless networks"
    - "performance limits and geometric properties of array localization"
    - "distributed clock skew and offset estimation in wireless sensor networks asynchronous algorithm and convergence analysis"
    - "on stochastic geometry modeling of cellular uplink transmission with truncated channel inversion power control"
    - "power optimization for network localization"

Connected through hyperedge HE-2 (induced by source paper "characterizing the impact of snr heterogeneity on time of arrival based localization outage probability"):
  with members:
    - "a tractable analysis of the blind spot probability in localization networks under correlated blocking"
    - "asymptotic blind spot analysis of localization networks under correlated blocking using a poisson line process"
    - "a tractable analysis of the improvement in unique localizability through collaboration"
    - "a tractable metric for evaluating base station geometries in cellular network localization"
    - "power optimization for network localization"
    - "fundamental limits of wideband localization part ii cooperative networks"
    - "fundamental limits of wideband localization part i a general framework"

Connected through hyperedge HE-3 (induced by source paper "a statistical characterization of localization performance in wireless networks"):
  with members:
    - "a tractable metric for evaluating base station geometries in cellular network localization"
    - "performance limits in sensor localization"
    - "downlink rate distribution in heterogeneous cellular networks under generalized cell selection"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"
    - "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.NI(Networking and Internet Architecture)