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: "bounds on the second order coding rate of the mimo rayleigh block fading channel"
  Abstract: We study the second-order coding rate of the multiple-input multiple-output (MIMO) Rayleigh block-fading channel via statistical bounds from information spectrum methods and random matrix theory. Based on an asymptotic analysis of the mutual information density which considers the simultaneous growth of the block length n and the number of transmit and receive antennas K and N, we derive closed-form upper and lower bounds on the optimal average error probability when the code rate is within O(1/√nK) of the asymptotic capacity. A Gaussian approximation is then used to establish an upper bound on the error probability for arbitrary code rates which is shown by simulations to be accurate for small N, K, and n.

Connected through hyperedge HE-1 (induced by source paper "coherent multiple antenna block fading channels at finite blocklength"):
  with members:
    - "a beta beta achievability bound with applications"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "minimum energy to send k bits over multiple antenna fading channels"
    - "optimum power control at finite blocklength"
    - "dispersion analysis of infinite constellations in ergodic fading channels"
    - "diversity versus channel knowledge at finite block length"

Connected through hyperedge HE-2 (induced by source paper "asymptotic estimates in information theory with non vanishing error probabilities"):
  with members:
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "the third order term in the normal approximation for the awgn channel"
    - "strong converse and second order asymptotics of channel resolvability"
    - "channels with cost constraints strong converse and dispersion"
    - "secret key agreement general capacity and second order asymptotics"
    - "second order coding rates for channels with state"
    - "unequal message protection asymptotic and non asymptotic tradeoffs"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"

Connected through hyperedge HE-3 (induced by source paper "backing off from infinity performance bounds via concentration of spectral measure for random mimo channels"):
  with members:
    - "massive mimo for next generation wireless systems"
    - "shannon meets nyquist capacity of sampled gaussian channels"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "on the distribution of mimo mutual information an in depth painleve based characterization"
    - "outage capacity for the optical mimo channel"
    - "network mimo with linear zero forcing beamforming large system analysis impact of channel estimation and reduced complexity scheduling"
    - "achieving massive mimo spectral efficiency with a not so large number of antennas"
    - "signal processing in large systems a new paradigm"

Connected through hyperedge HE-4 (induced by source paper "second order coding rates for channels with state"):
  with members:
    - "on the dispersions of three network information theory problems"
    - "quasi static simo fading channels at finite blocklength"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "a formula for the capacity of the general gel fand pinsker channel"
    - "information spectrum approach to second order coding rate in channel coding"
    - "simple channel coding bounds"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

Connected through hyperedge HE-5 (induced by source paper "quasi static multiple antenna fading channels at finite blocklength"):
  with members:
    - "the third order term in the normal approximation for the awgn channel"
    - "quasi static simo fading channels at finite blocklength"
    - "diversity versus channel knowledge at finite block length"
    - "proof of the outage probability conjecture for miso 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)