human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "robust power allocation for energy efficient location aware networks"):
  Abstract: In wireless location-aware networks, mobile nodes (agents) typically obtain their positions through ranging with respect to nodes with known positions (anchors). Transmit power allocation not only affects network lifetime, throughput, and interference, but also determines localization accuracy. In this paper, we present an optimization framework for robust power allocation in network localization to tackle imperfect knowledge of network parameters. In particular, we formulate power allocation problems to minimize the squared position error bound (SPEB) and the maximum directional position error bound (mDPEB), respectively, for a given power budget. We show that such formulations can be efficiently solved via conic programming. Moreover, we design an efficient power allocation scheme that allows distributed computations among agents. The simulation results show that the proposed schemes significantly outperform uniform power allocation, and the robust schemes outperform their non-robust counterparts when the network parameters are subject to uncertainty.

Includes members:
  Member "performance analysis of heterogeneous feedback design in an ofdma downlink with partial and imperfect feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "throughput analysis and energy efficiency optimization for standalone lte u networks with randomly delayed csi")
  Member "target localization accuracy gain in mimo radar based systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "suboptimum low complexity joint multi target detection and localization for noncoherent mimo radar with widely separated antennas")
  Member "slow adaptive ofdma systems through chance constrained programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy efficient scheduling and power allocation in downlink ofdma networks with base station coordination")
  Member "fundamental limits of wideband localization part ii cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "peregrine network localization and navigation with scalable inference and efficient operation")
  Member "fundamental limits of wideband localization part i a general framework":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hybrid lifi and wifi networks a survey")
  Member "distributed sensor localization in random environments using minimal number of anchor nodes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed joint sensor registration and multitarget tracking via sensor network")

Question: Please tell me which class the source paper 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)