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: "on the boundedness of the support of optimal input measures for rayleigh fading channels"
  Abstract: We consider transmission over a wireless multiple antenna communication system operating in a Rayleigh flat fading environment with no channel state information at the receiver and the transmitter with coherence time T=1. We show that, subject to the average power constraint, the support of the capacity achieving input distribution is bounded. Moreover, we show by a simple example concerning the identity theorem (or uniqueness theorem) from the complex analysis in several variables that some of the existing results in the field are not rigorous.

Connected through hyperedge HE-1 (induced by source paper "upper and lower bounds on the capacity of amplitude constrained mimo channels"):
  with members:
    - "the capacity of gaussian mimo channels under total and per antenna power constraints"
    - "an upper bound for the capacity of amplitude constrained scalar awgn channel"
    - "interference as noise friend or foe"
    - "capacity bounds for discrete time amplitude constrained additive white gaussian noise channels"
    - "on the capacity of vector gaussian channels with bounded inputs"
    - "miso capacity with per antenna power constraint"

Connected through hyperedge HE-2 (induced by source paper "on the capacity of the awgn channel with additive radar interference"):
  with members:
    - "capacity of gaussian channels with duty cycle and power constraints"

Connected through hyperedge HE-3 (induced by source paper "on the capacity of vector gaussian channels with bounded inputs"):
  with members:
    - "the noncoherent rician fading channel part i structure of the capacity achieving input"

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)