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: "downlink transmit power setting in lte hetnets with carrier aggregation"
  Abstract: Carrier aggregation, which allows users to aggregate several component carriers to obtain up to 100 MHz of bandwidth, is one of the central features envisioned for next generation cellular networks. While this feature will enable support for higher data rates and improve quality of service, it may also be employed as an effective interference mitigation technique, especially in multi-tier heterogeneous networks. Having in mind that the aggregated component carriers may belong to different frequency bands and, hence, have varying propagation profiles, we argue that it is not necessary, indeed even harmful, to transmit at maximum power at all carriers, at all times. Rather, by using game theory, we design a distributed algorithm that lets eNodeBs and micro base stations dynamically adjust the downlink transmit power for the different component carriers. We compare our scheme to different power strategies combined with popular interference mitigation techniques, in a typical large-scale scenario, and show that our solution significantly outperforms the other strategies in terms of global network utility, power consumption and user throughput.

Connected through hyperedge HE-1 (induced by source paper "distributed downlink power control for dense networks with carrier aggregation"):
  with members:
    - "ultra dense small cell networks turning density into energy efficiency"
    - "algorithms for enhanced inter cell interference coordination eicic in lte hetnets"
    - "what will 5g be"
    - "coalitional games with overlapping coalitions for interference management in small cell 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)