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: "intervention in power control games with selfish users"
  Abstract: We study the power control problem in single-hop wireless ad hoc networks with selfish users. Without incentive schemes, selfish users tend to transmit at their maximum power levels, causing excessive interference to each other. In this paper, we study a class of incentive schemes based on intervention to induce selfish users to transmit at desired power levels. In a power control scenario, an intervention scheme can be implemented by introducing an intervention device that can monitor the power levels of users and then transmit power to cause interference to users if necessary. Focusing on first-order intervention rules based on individual transmit powers, we derive conditions on the intervention rates and the power budget to achieve a desired outcome as a (unique) Nash equilibrium with intervention and propose a dynamic adjustment process to guide users and the intervention device to the desired outcome. We also analyze the effect of using aggregate receive power instead of individual transmit powers. Our results show that intervention schemes can be designed to achieve any positive power profile while using interference from the intervention device only as a threat. Lastly, simulation results are presented to illustrate the performance improvement from using intervention schemes and the theoretical results.

Connected through hyperedge HE-1 (induced by source paper "energy efficient nonstationary spectrum sharing"):
  with members:
    - "quality of service provisioning in decentralized networks a satisfaction equilibrium approach"

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)