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: "movement efficient sensor deployment in wireless sensor networks"
  Abstract: We study a mobile wireless sensor network (MWSN) consisting of multiple mobile sensors or robots. Two key issues in MWSNs - energy consumption, which is dominated by sensor movement, and sensing coverage - have attracted plenty of attention, but the interaction of these issues is not well studied. To take both sensing coverage and movement energy consumption into consideration, we model the sensor deployment problem as a constrained source coding problem. %, which can be applied to different coverage tasks, such as area coverage, target coverage, and barrier coverage. Our goal is to find an optimal sensor deployment to maximize the sensing coverage with specific energy constraints. We derive necessary conditions to the optimal sensor deployment with (i) total energy constraint and (ii) network lifetime constraint. Using these necessary conditions, we design Lloyd-like algorithms to provide a trade-off between sensing coverage and energy consumption. Simulation results show that our algorithms outperform the existing relocation algorithms.

Connected through hyperedge HE-1 (induced by source paper "energy efficient node deployment in wireless ad hoc sensor networks"):
  with members:
    - "using quantization to deploy heterogeneous nodes in two tier wireless sensor networks"
    - "sensor deployment with limited communication range in homogeneous and heterogeneous wireless sensor networks"

Connected through hyperedge HE-2 (induced by source paper "power efficient deployment of uavs as relays"):
  with members:
    - "placement optimization of uav mounted mobile base stations"
    - "providing wireless coverage to high rise buildings using uavs"
    - "deployment and trajectory optimization for uavs a quantization theory approach"
    - "energy efficient uav communication with trajectory optimization"
    - "optimal transport theory for power efficient deployment of unmanned aerial vehicles"
    - "the new frontier in ran heterogeneity multi tier drone cells"
    - "wireless communications with unmanned aerial vehicles opportunities and challenges"
    - "performance analysis of micro unmanned airborne communication relays for cellular networks"

Connected through hyperedge HE-3 (induced by source paper "movement efficient sensor deployment in wireless sensor networks with limited communication range"):
  with members:
    - "sensor deployment with limited communication range in homogeneous and heterogeneous wireless sensor networks"
    - "algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain"

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)