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: "dmt optimality of lr aided linear decoders for a general class of channels lattice designs and system models"
  Abstract: This paper identifies the first general, explicit, and nonrandom MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive maximum-likelihood (ML) receiver. Specifically, the work establishes the DMT optimality of a class of regularized lattice decoders, and more importantly the DMT optimality of their lattice-reduction (LR)-aided linear counterparts. The results hold for all channel statistics, for all channel dimensions, and most interestingly, irrespective of the particular lattice-code applied. As a special case, it is established that the LLL-based LR-aided linear implementation of the MMSE-GDFE lattice decoder facilitates DMT optimal decoding of any lattice code at a worst-case complexity that grows at most linearly in the data rate. This represents a fundamental reduction in the decoding complexity when compared to ML decoding whose complexity is generally exponential in the rate. The results' generality lends them applicable to a plethora of pertinent communication scenarios such as quasi-static MIMO, MIMO-OFDM, ISI, cooperative-relaying, and MIMO-ARQ channels, in all of which the DMT optimality of the LR-aided linear decoder is guaranteed. The adopted approach yields insight, and motivates further study, into joint transceiver designs with an improved SNR gap to ML decoding.

Connected through hyperedge HE-1 (induced by source paper "deterministic sampling decoding where sphere decoding meets lattice gaussian distribution"):
  with members:
    - "lattice gaussian sampling by markov chain monte carlo bounded distance decoding and trapdoor sampling"
    - "on the geometric ergodicity of metropolis hastings algorithms for lattice gaussian sampling"
    - "discrete gaussian sampling reduces to cvp and svp"
    - "optimized markov chain monte carlo for signal detection in mimo systems an analysis of the stationary distribution and mixing time"
    - "markov chain monte carlo algorithms for lattice gaussian sampling"
    - "massive mimo for next generation wireless systems"
    - "decoding by embedding correct decoding radius and dmt optimality"
    - "scaling up mimo opportunities and challenges with very large arrays"

Connected through hyperedge HE-2 (induced by source paper "an approximate ml detector for mimo channels corrupted by phase noise"):
  with members:
    - "models and information rates for wiener phase noise channels"
    - "capacity bounds for mimo microwave backhaul links affected by phase noise"
    - "constellation optimization in the presence of strong phase noise"

Connected through hyperedge HE-3 (induced by source paper "hardware architecture of complex k best mimo decoder"):
  with members:
    - "fixed point realization of iterative lr aided soft mimo decoding algorithm"
    - "an improved lr aided k best algorithm for mimo detection"
    - "on the limitations of the naive lattice decoding"

Connected through hyperedge HE-4 (induced by source paper "fifty years of mimo detection the road to large scale mimos"):
  with members:
    - "large scale mimo detection for 3gpp lte algorithms and fpga implementations"
    - "an esprit based approach for 2 d localization of incoherently distributed sources in massive mimo systems"
    - "massive mimo for next generation wireless systems"
    - "what will 5g be"
    - "approximate bayesian probabilistic data association aided iterative detection for mimo systems using arbitrary m ary modulation"
    - "channel hardening exploiting message passing chemp receiver in large scale mimo systems"
    - "five disruptive technology directions for 5g"
    - "scaling up mimo opportunities and challenges with very large arrays"

Connected through hyperedge HE-5 (induced by source paper "an error event sensitive tradeoff between rate and coding gain in mimo mac"):
  with members:
    - "sphere decoding complexity exponent for decoding full rate codes over the quasi static mimo channel"
    - "remarks on the criteria of constructing mimo mac dmt optimal codes"
    - "performance of mmse mimo receivers a large n analysis for correlated channels"
    - "on the decay of the determinants of multiuser mimo lattice codes"
    - "distributed space time block codes for the mimo multiple access channel"
    - "maximal orders in the design of dense space time lattice codes"
    - "diversity multiplexing tradeoff in selective fading multiple access mimo channels"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-6 (induced by source paper "performance complexity analysis for mac ml based decoding with user selection"):
  with members:
    - "achieving a vanishing snr gap to exact lattice decoding at a subexponential complexity"
    - "sphere decoding complexity exponent for decoding full rate codes over the quasi static mimo channel"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "lr aided mmse lattice decoding is dmt optimal for all approximately universal codes"
    - "approximately universal optimality over several dynamic and non dynamic cooperative diversity schemes for wireless networks"

Connected through hyperedge HE-7 (induced by source paper "fixed point realization of iterative lr aided soft mimo decoding algorithm"):
  with members:
    - "an improved lr aided k best algorithm for mimo detection"
    - "on the limitations of the naive lattice decoding"

Connected through hyperedge HE-8 (induced by source paper "uplink downlink duality for integer forcing"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "lattices over eisenstein integers for compute and forward"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "integer forcing source coding"
    - "an algebraic approach to physical layer network coding"
    - "reverse compute and forward a low complexity architecture for downlink distributed antenna systems"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

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)