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: "distributive power control algorithm for multicarrier interference network over time varying fading channels tracking performance analysis and optimization"
  Abstract: Distributed power control over interference limited network has received an increasing intensity of interest over the past few years. Distributed solutions (like the iterative water-filling, gradient projection, etc.) have been intensively investigated under quasi-static channels. However, as such distributed solutions involve iterative updating and explicit message passing, it is unrealistic to assume that the wireless channel remains unchanged during the iterations. Unfortunately, the behavior of those distributed solutions under time-varying channels is in general unknown. In this paper, we shall investigate the distributed scaled gradient projection algorithm (DSGPA) in a K pairs multicarrier interference network under a finite-state Markov channel (FSMC) model. We shall analyze the convergence property as well as tracking performance of the proposed DSGPA. Our analysis shows that the proposed DSGPA converges to a limit region rather than a single point under the FSMC model. We also show that the order of growth of the tracking errors is given by O(1/N), where N is the average sojourn time of the FSMC. Based on the analysis, we shall derive the tracking error optimal scaling matrices via Markov decision process modeling. We shall show that the tracking error optimal scaling matrices can be implemented distributively at each transmitter. The numerical results show the superior performance of the proposed DSGPA over three baseline schemes, such as the gradient projection algorithm with a constant stepsize.

Connected through hyperedge HE-1 (induced by source paper "averaged iterative water filling algorithm robustness and convergence"):
  with members:
    - "game theory and the frequency selective interference channel"
    - "optimal linear precoding strategies for wideband noncooperative systems based on game theory part i nash equilibria"
    - "optimal linear precoding strategies for wideband non cooperative systems based on game theory part ii algorithms"

Connected through hyperedge HE-2 (induced by source paper "learning equilibrium play for stochastic parallel gaussian interference channels"):
  with members:
    - "online reinforcement learning for dynamic multimedia systems"
    - "optimal linear precoding strategies for wideband noncooperative systems based on game theory part i nash equilibria"

Connected through hyperedge HE-3 (induced by source paper "distributive network utility maximization over time varying fading channels"):
  with members:
    - "distributed large scale network utility maximization"

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)