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: "joint power control and user scheduling in multicell wireless networks capacity scaling laws"
  Abstract: We address the optimization of the sum rate performance in multicell interference-limited singlehop networks where access points are allowed to cooperate in terms of joint resource allocation. The resource allocation policies considered here combine power control and user scheduling. Although very promising from a conceptual point of view, the optimization of the sum of per-link rates hinges, in principle, on tough issues such as computational complexity and the requirement for heavy receiver-to-transmitter channel information feedback across all network cells. In this paper, we show that, in fact, distributed algorithms are actually obtainable in the asymptotic regime where the numbers of users per cell is allowed to grow large. Additionally, using extreme value theory, we provide scaling laws for upper and lower bounds for the network capacity (sum of single user rates over all cells), corresponding to zero-interference and worst-case interference scenarios. We show that the scaling is either dominated by path loss statistics or by small-scale fading, depending on the regime and user location scenario. We show that upper and lower rate bounds behave in fact identically, asymptotically. This remarkable result suggests not only that distributed resource allocation is practically possible but also that the impact of multicell interference on the capacity (in terms of scaling) actually vanishes asymptotically.

Connected through hyperedge HE-1 (induced by source paper "nearly optimal resource allocation for downlink ofdma in 2 d cellular networks"):
  with members:
    - "resource allocation for downlink cellular ofdma systems part ii practical algorithms and optimal reuse factor"
    - "resource allocation for downlink cellular ofdma systems part i optimal allocation"

Connected through hyperedge HE-2 (induced by source paper "resource allocation for downlink cellular ofdma systems part ii practical algorithms and optimal reuse factor"):
  with members:
    - "resource allocation for downlink cellular ofdma systems part i optimal allocation"

Connected through hyperedge HE-3 (induced by source paper "sinr analysis of opportunistic mimo sdma downlink systems with linear combining"):
  with members:
    - "opportunistic scheduling and beamforming for mimo sdma downlink systems with linear combining"

Connected through hyperedge HE-4 (induced by source paper "to decode the interference or to consider it as noise"):
  with members:
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "throughput scaling laws for wireless networks with fading channels"
    - "the effect of fading channel inversion and threshold scheduling on ad hoc networks"
    - "optimal order of decoding for max min fairness in k user memoryless interference channels"

Connected through hyperedge HE-5 (induced by source paper "rate constrained wireless networks with fading channels interference limited and noise limited regimes"):
  with members:
    - "fractional power control for decentralized wireless networks"
    - "throughput scaling laws for wireless networks with fading channels"
    - "the effect of fading channel inversion and threshold scheduling on ad hoc 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.IT(Information Theory)