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 estimation in lte systems with the general framework of standard interference mappings"
  Abstract: We devise novel techniques to obtain the downlink power inducing a given load in long-term evolution (LTE) systems, where we define load as the fraction of resource blocks in the time-frequency grid being requested by users from a given base station. These techniques are particularly important because previous studies have proved that the data rate requirement of users can be satisfied with lower transmit energy if we allow the load to increase. Those studies have also shown that obtaining the power assignment inducing a desired load profile can be posed as a fixed point problem involving standard interference mappings, but so far the mappings have not been obtained explicitly. One of our main contributions in this study is to close this gap. We derive an interference mapping having as its fixed point the power assignment inducing a desired load, assuming that such an assignment exists. Having this mapping in closed form, we simplify the proof of the aforementioned known results, and we also devise novel iterative algorithms for power computation that have many numerical advantages over previous methods.

Connected through hyperedge HE-1 (induced by source paper "traffic demand aware topology control for enhanced energy efficiency of cellular networks"):
  with members:
    - "kernel based adaptive online reconstruction of coverage maps with side information"
    - "power and load coupling in cellular networks for energy optimization"
    - "analysis of cell load coupling for lte network planning and optimization"
    - "base station selection for energy efficient network operation with the majorization minimization algorithm"
    - "enhanced intercell interference coordination challenges in heterogeneous networks"

Connected through hyperedge HE-2 (induced by source paper "spatial mappings for planning and optimization of cellular networks"):
  with members:
    - "elementary properties of positive concave mappings with applications to network planning and optimization"
    - "range assignment for power optimization in load coupled heterogeneous networks"
    - "power and load coupling in cellular networks for energy optimization"
    - "an overview of load balancing in hetnets old myths and open problems"
    - "analysis of cell load coupling for lte network planning and optimization"

Connected through hyperedge HE-3 (induced by source paper "elementary properties of positive concave mappings with applications to network planning and optimization"):
  with members:
    - "power and load coupling in cellular networks for energy optimization"
    - "data offloading in load coupled networks a utility maximization framework"
    - "analysis of cell load coupling for lte network planning and optimization"

Connected through hyperedge HE-4 (induced by source paper "fundamental properties of solutions to utility maximization problems in wireless networks"):
  with members:
    - "elementary properties of positive concave mappings with applications to network planning and optimization"
    - "joint beamforming and power control in coordinated multicell max min duality effective network and large system transition"

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)