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: "power optimization for network localization"
  Abstract: Reliable and accurate localization of mobile objects is essential for many applications in wireless networks. In range-based localization, the position of the object can be inferred using the distance measurements from wireless signals exchanged with active objects or reflected by passive ones. Power allocation for ranging signals is important since it affects not only network lifetime and throughput but also localization accuracy. In this paper, we establish a unifying optimization framework for power allocation in both active and passive localization networks. In particular, we first determine the functional properties of the localization accuracy metric, which enable us to transform the power allocation problems into second-order cone programs (SOCPs). We then propose the robust counterparts of the problems in the presence of parameter uncertainty and develop asymptotically optimal and efficient near-optimal SOCP-based algorithms. Our simulation results validate the efficiency and robustness of the proposed algorithms.

Connected through hyperedge HE-1 (induced by source paper "cooperative network synchronization asymptotic analysis"):
  with members:
    - "on the outage probability of localization in randomly deployed wireless networks"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "wireless optimisation via convex bandits unlicensed lte wifi coexistence"):
  with members:
    - "introduction to online convex optimization"
    - "distributed user association in energy harvesting small cell networks a probabilistic bandit model"
    - "fair coexistence of scheduled and random access wireless networks unlicensed lte wifi"
    - "multi armed bandits with application to 5g small cells"
    - "kernel based methods for bandit convex optimization"
    - "an optimal algorithm for bandit convex optimization"
    - "analysis and optimization of caching and multicasting in large scale cache enabled heterogeneous wireless networks"
    - "combinatorial bandits revisited"

Connected through hyperedge HE-3 (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"
    - "on the outage probability of localization in randomly deployed wireless networks"
    - "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"
    - "fundamental limits of wideband localization part ii cooperative networks"
    - "fundamental limits of wideband localization part i a general framework"

Connected through hyperedge HE-4 (induced by source paper "optimal and robust power allocation for visible light positioning systems under illumination constraints"):
  with members:
    - "multi element vlc networks led assignment power control and optimum combining"
    - "joint transceiver and offset design for visible light communications with input dependent shot noise"

Connected through hyperedge HE-5 (induced by source paper "performance limits and geometric properties of array localization"):
  with members:
    - "resource allocation in mimo radar with multiple targets for non coherent localization"
    - "on the performance limits of map aware localization"
    - "beamforming design for joint localization and data transmission in distributed antenna system"
    - "target localization accuracy gain in mimo radar based systems"
    - "fundamental limits of wideband localization part ii cooperative networks"
    - "fundamental limits of wideband localization part i a general framework"
    - "distributed sensor localization in random environments using minimal number of anchor nodes"

Connected through hyperedge HE-6 (induced by source paper "optimal jammer placement in wireless localization systems"):
  with members:
    - "worst case jamming on mimo gaussian channels"
    - "fundamental limits of wideband localization part ii cooperative networks"
    - "fundamental limits of wideband localization part i a general framework"

Connected through hyperedge HE-7 (induced by source paper "optimal fronthaul quantization for cloud radio positioning"):
  with members:
    - "beamforming design for joint localization and data transmission in distributed antenna system"

Connected through hyperedge HE-8 (induced by source paper "beamforming design for joint localization and data transmission in distributed antenna system"):
  with members:
    - "robust power allocation for energy efficient location aware networks"
    - "fundamental limits of wideband localization part ii cooperative networks"
    - "fundamental limits of wideband localization part i a general framework"

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)