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: "rate of channel hardening of antenna selection diversity schemes and its implication on scheduling"
  Abstract: For a multiple-antenna system, we find a simple and accurate expression for the asymptotic distribution of the antenna selection gain when the transmitter selects the transmit antenna with the strongest channel. We use this to estimate the underlying channel capacity distributions and obtain the approximate ergodic capacity. This estimate is compared with upper and lower bounds. This analysis demonstrates that unlike multiple-input/multiple-output (MIMO) systems, the channel for antenna selection systems hardens at a slower rate, and thus a significant multiuser scheduling gain can exist-Theta (1/logm) for channel selection as opposed to Theta (1/radicm) for MIMO, where m is the number of transmit antennas.

Connected through hyperedge HE-1 (induced by source paper "on robustness of massive mimo systems against passive eavesdropping under antenna selection"):
  with members:
    - "stepwise transmit antenna selection in downlink massive multiuser mimo"
    - "iterative antenna selection for secrecy enhancement in massive mimo wiretap channels"
    - "asymptotics of nonlinear lse precoders with applications to transmit antenna selection"
    - "asymptotics of transmit antenna selection impact of multiple receive antennas"
    - "asymptotic performance analysis of spatially reconfigurable antenna arrays"
    - "optimal number of transmit antennas for secrecy enhancement in massive mimome channels"
    - "secrecy and energy efficiency in massive mimo aided heterogeneous c ran a new look at interference"
    - "on secrecy performance of antenna selection aided mimo systems against eavesdropping"

Connected through hyperedge HE-2 (induced by source paper "impact of angular spread in moderately large mimo systems under pilot contamination"):
  with members:
    - "non orthogonal multiple access for mmwave drone networks with limited feedback"
    - "robust pilot decontamination based on joint angle and power domain discrimination"
    - "millimeter wave vehicular communication to support massive automotive sensing"
    - "directional training and fast sector based processing schemes for mmwave channels"
    - "no downlink pilots are needed in tdd massive mimo"
    - "massive mimo ten myths and one critical question"
    - "the impact of beamwidth on temporal channel variation in vehicular channels and its implications"
    - "massive mimo for next generation wireless systems"

Connected through hyperedge HE-3 (induced by source paper "asymptotic performance analysis of spatially reconfigurable antenna arrays"):
  with members:
    - "asymptotics of transmit antenna selection impact of multiple receive antennas"

Connected through hyperedge HE-4 (induced by source paper "secure communication in uplink transmissions user selection and multiuser secrecy gain"):
  with members:
    - "secure massive mimo transmission with an active eavesdropper"
    - "the ergodic capacity of the multiple access channel under distributed scheduling order optimality of linear receivers"
    - "exact joint distribution analysis of zero forcing v blast gains with greedy ordering"
    - "multiuser diversity for secrecy communications using opportunistic jammer selection secure dof and jammer scaling law"
    - "energy and spectral efficiency of very large multiuser mimo systems"
    - "secure diversity multiplexing tradeoff of zero forcing transmit scheme at finite snr"
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"
    - "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation"

Connected through hyperedge HE-5 (induced by source paper "asymptotic analysis of multi antenna cognitive radio systems using extreme value theory"):
  with members:
    - "optimal power allocation for fading channels in cognitive radio networks ergodic capacity and outage capacity"

Connected through hyperedge HE-6 (induced by source paper "asymptotic scheduling gains in point to multipoint cognitive networks"):
  with members:
    - "joint design and separation principle for opportunistic spectrum access in the presence of sensing errors"
    - "cognitive medium access exploration exploitation and competition"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "interference channels with common information"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-7 (induced by source paper "power loading in parallel diversity channels based on statistical channel information"):
  with members:
    - "statistical eigenmode transmission over jointly correlated mimo channels"

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)