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: "optimizing orthogonal multiple access based on quantized channel state information"
  Abstract: The performance of systems where multiple users communicate over wireless fading links benefits from channel-adaptive allocation of the available resources. Different from most existing approaches that allocate resources based on perfect channel state information, this work optimizes channel scheduling along with per user rate and power loadings over orthogonal fading channels, when both terminals and scheduler rely on quantized channel state information. Channel-adaptive policies are designed to optimize an average transmit-performance criterion subject to average quality of service requirements. While the resultant optimal policy per fading realization shows that the individual rate and power loadings can be obtained separately for each user, the optimal scheduling is slightly more complicated. Specifically, per fading realization each channel is allocated either to a single (winner) user, or, to a small group of winner users whose percentage of shared resources is found by solving a linear program. A single scheduling scheme combining both alternatives becomes possible by smoothing the original disjoint scheme. The smooth scheduling is asymptotically optimal and incurs reduced computational complexity. Different alternatives to obtain the Lagrange multipliers required to implement the channel-adaptive policies are proposed, including stochastic iterations that are provably convergent and do not require knowledge of the channel distribution. The development of the optimal channel-adaptive allocation is complemented with discussions on the overhead required to implement the novel policies.

Connected through hyperedge HE-1 (induced by source paper "underlay cognitive radios with capacity guarantees for primary users"):
  with members:
    - "cross layer designs in coded wireless fading networks with multicast"
    - "power control with imperfect exchanges and applications to spectrum sharing"
    - "optimal bandwidth and power allocation for sum ergodic capacity under fading channels in cognitive radio networks"
    - "dynamic resource allocation in cognitive radio networks"
    - "optimal power allocation for fading channels in cognitive radio networks ergodic capacity and outage capacity"
    - "on peak versus average interference power constraints for protecting primary users in cognitive radio networks"
    - "joint design and separation principle for opportunistic spectrum access in the presence of sensing errors"

Connected through hyperedge HE-2 (induced by source paper "jointly optimal sensing and resource allocation for multiuser overlay cognitive radios"):
  with members:
    - "dynamic resource allocation in cognitive radio networks"
    - "joint design and separation principle for opportunistic spectrum access in the presence of sensing errors"

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)