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: "diversity versus multiplexing at finite blocklength"
  Abstract: A finite blocklenth analysis of the diversity-multiplexing tradeoff is presented, based on nonasymptotic bounds on the maximum channel coding rate of multiple-antenna block-memoryless Rayleigh-fading channels. The bounds in this paper allow one to numerically assess for which packet size, number of antennas, and degree of channel selectivity, diversity-exploiting schemes are close to optimal, and when instead the available spatial degrees of freedom should be used to provide spatial multiplexing. This finite blocklength view on the diversity-multiplexing tradeoff provides insights on the design of delay-sensitive ultra-reliable communication links.

Connected through hyperedge HE-1 (induced by source paper "on single antenna rayleigh block fading channels at finite blocklength"):
  with members:
    - "low complexity joint channel estimation and list decoding of short codes"
    - "low latency short packet transmissions fixed length or harq"
    - "efficient error correcting codes in the short blocklength regime"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "coherent multiple antenna block fading channels at finite blocklength"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "the third order term in the normal approximation for the awgn channel"
    - "optimum power control at finite blocklength"

Connected through hyperedge HE-2 (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"
    - "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"
    - "on the capacity of large mimo block fading channels"

Connected through hyperedge HE-3 (induced by source paper "towards massive ultra reliable and low latency wireless the art of sending short packets"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "variable length convolutional coding for short blocklengths with decision feedback"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"
    - "finite length scaling for polar codes"
    - "optimum power control at finite blocklength"
    - "ultra reliable communication in 5g wireless systems"
    - "feedback communication systems with limitations on incremental redundancy"

Connected through hyperedge HE-4 (induced by source paper "optimum power control at finite blocklength"):
  with members:
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "quasi static multiple antenna fading channels at finite blocklength"
    - "diversity versus channel knowledge at finite block length"
    - "lossy joint source channel coding in the finite blocklength regime"

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)