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: "finite snr diversity multiplexing tradeoff via asymptotic analysis of large mimo systems"
  Abstract: Diversity-multiplexing tradeoff (DMT) was characterized asymptotically (SNR- > infinity) for i.i.d. Rayleigh fading channel by Zheng and Tse . The SNR-asymptotic DMT overestimates the finite-SNR one . This paper outlines a number of additional limitations and difficulties of the DMT framework and discusses their implications. Using the recent results on the size-asymptotic (in the number of antennas) outage capacity distribution, the finite-SNR, size-asymptotic DMT is derived for a broad class of fading distributions. The SNR range over which the finite-SNR DMT is accurately approximated by the SNR-asymptotic one is characterized. The multiplexing gain definition is shown to affect critically this range and thus should be carefully selected, so that the SNR-asymptotic DMT is an accurate approximation at realistic SNR values and thus has operational significance to be used as a design criterion. The finite-SNR diversity gain is shown to decrease with correlation and power imbalance in a broad class of fading channels, and such an effect is described in a compact, closed form. Complete characterization of the outage probability (or outage capacity) requires not only the finite-SNR DMT, but also the SNR offset, which is introduced and investigated as well. This offset, which is not accounted for in the DMT framework, is shown to have a significant impact on the outage probability for a broad class of fading channels, especially when the multiplexing gain is small. The analytical results and conclusions are validated via extensive Monte Carlo simulations. Overall, the size-asymptotic DMT represents a valuable alternative to the SNR-asymptotic one.

Connected through hyperedge HE-1 (induced by source paper "short packet communications over multiple antenna rayleigh fading channels"):
  with members:
    - "towards massive ultra reliable and low latency wireless the art of sending short packets"
    - "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"
    - "closed form output statistics of mimo block fading channels"
    - "diversity versus multiplexing at finite blocklength"
    - "ultra reliable communication in 5g wireless systems"
    - "five disruptive technology directions for 5g"
    - "quasi static multiple antenna fading channels at finite blocklength"
    - "diversity versus channel knowledge at finite block length"

Connected through hyperedge HE-2 (induced by source paper "asymptotic analysis of random lattices in high dimensions"):
  with members:
    - "fifty years of mimo detection the road to large scale mimos"
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"
    - "sphere decoding complexity exponent for decoding full rate codes over the quasi static mimo channel"
    - "faster recursions in sphere decoding"
    - "asymptotic performance of linear receivers in mimo fading channels"
    - "on the limitations of the naive lattice decoding"

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"
    - "bounds on the second order coding rate of the mimo rayleigh block fading channel"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "the secrecy capacity of compound gaussian mimo wiretap channels"):
  with members:
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "secrecy results for compound wiretap channels"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "on the compound mimo broadcast channels with confidential messages"
    - "transmitter optimization for achieving secrecy capacity in gaussian mimo wiretap channels"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "outage capacity of rayleigh product channels a free probability approach"):
  with members:
    - "from multi keyholes to measure of correlation and power imbalance in mimo channels outage capacity analysis"
    - "asymptotic capacity and optimal precoding in mimo multi hop relay networks"
    - "living at the edge a large deviations approach to the outage mimo capacity"
    - "asymptotic analysis of double scattering channels"
    - "diversity multiplexing tradeoff of double scattering mimo channels"
    - "capacity and character expansions moment generating function and other exact results for mimo correlated channels"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-6 (induced by source paper "achieving a vanishing snr gap to exact lattice decoding at a subexponential complexity"):
  with members:
    - "on the proximity factors of lattice reduction aided decoding"
    - "efficient soft input soft output tree detection via an improved path metric"
    - "sphere decoding complexity exponent for decoding full rate codes over the quasi static mimo channel"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"
    - "faster recursions in sphere decoding"
    - "mimo detection for high order qam based on a gaussian tree approximation"
    - "dmt optimality of lr aided linear decoders for a general class of channels lattice designs and system models"
    - "soft input soft output single tree search sphere decoding"

Connected through hyperedge HE-7 (induced by source paper "the jacobi mimo channel"):
  with members:
    - "fundamental limits of infinite constellations in mimo fading channels"
    - "random matrix model for nakagami hoyt fading"
    - "impact of spatial correlation on the finite snr diversity multiplexing tradeoff"

Connected through hyperedge HE-8 (induced by source paper "from multi keyholes to measure of correlation and power imbalance in mimo channels outage capacity analysis"):
  with members:
    - "diversity multiplexing tradeoff and outage probability in mimo relay channels"
    - "diversity multiplexing tradeoff via asymptotic analysis of large mimo systems"
    - "on the capacity of doubly correlated mimo channels"
    - "mimo diversity in the presence of double scattering"

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)