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: "quasi static simo fading channels at finite blocklength"
  Abstract: We investigate the maximal achievable rate for a given blocklength and error probability over quasi-static single-input multiple-output (SIMO) fading channels. Under mild conditions on the channel gains, it is shown that the channel dispersion is zero regardless of whether the fading realizations are available at the transmitter and/or the receiver. The result follows from computationally and analytically tractable converse and achievability bounds. Through numerical evaluation, we verify that, in some scenarios, zero dispersion indeed entails fast convergence to outage capacity as the blocklength increases. In the example of a particular 1*2 SIMO Rician channel, the blocklength required to achieve 90% of capacity is about an order of magnitude smaller compared to the blocklength required for an AWGN channel with the same capacity.

Connected through hyperedge HE-1 (induced by source paper "joint power control and rate allocation enabling ultra reliability and energy efficiency in simo wireless networks"):
  with members:
    - "distributed rate control in downlink noma networks with reliability constraints"
    - "rate control under finite blocklength for downlink cellular networks with reliability constraints"
    - "distributed optimization for energy efficient fog computing in the tactile internet"
    - "energy latency tradeoff in ultra reliable low latency communication with retransmissions"
    - "joint uplink and downlink resource configuration for ultra reliable and low latency communications"
    - "ultra reliable and low latency communications in 5g downlink physical layer aspects"
    - "ultra reliable cooperative short packet communications with wireless energy transfer"
    - "on the effective energy efficiency of ultra reliable networks in the finite blocklength regime"

Connected through hyperedge HE-2 (induced by source paper "energy efficient coded random access for the wireless uplink"):
  with members:
    - "fundamental limits of many user mac with finite payloads and fading"
    - "a joint graph based coding scheme for the unsourced random access gaussian channel"
    - "massive mimo unsourced random access"
    - "massive random access with common alarm messages"
    - "improved scaling law for activity detection in massive mimo systems"
    - "sparse activity detection for massive connectivity"
    - "sparse signal processing for grant free massive iot connectivity"
    - "sparse signal processing for grant free massive connectivity a future paradigm for random access protocols in the internet of things"

Connected through hyperedge HE-3 (induced by source paper "on the performance of non orthogonal multiple access in the finite blocklength regime"):
  with members:
    - "on the effective energy efficiency of ultra reliable networks in the finite blocklength regime"
    - "short packet communications in non orthogonal multiple access systems"
    - "on the effective capacity of mtc networks in the finite blocklength regime"
    - "ultra reliable communication via optimum power allocation for type i arq in finite block length"
    - "non orthogonal multiple access noma in cellular uplink and downlink challenges and enabling techniques"
    - "low latency ultra reliable 5g communications finite blocklength bounds and coding schemes"
    - "finite block length analysis of the incremental redundancy harq"
    - "ultra reliable communication in 5g wireless systems"

Connected through hyperedge HE-4 (induced by source paper "fundamental limits of many user mac with finite payloads and fading"):
  with members:
    - "on the fundamental limits of mimo massive multiple access channels"
    - "compressed neighbour discovery using sparse kerdock matrices"
    - "capacity of gaussian many access channels"
    - "quasi static multiple antenna fading channels at finite blocklength"
    - "approximate sparsity pattern recovery information theoretic lower bounds"
    - "the sampling rate distortion tradeoff for sparsity pattern recovery in compressed sensing"

Connected through hyperedge HE-5 (induced by source paper "short packet transmission over a bidirectional massive mimo link"):
  with members:
    - "massive mimo for internet of things iot connectivity"
    - "pilot assisted short packet transmission over multiantenna fading channels a 5g case study"
    - "performance of in band transmission of system information in massive mimo systems"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "the dispersion of nearest neighbor decoding for additive non gaussian channels"
    - "five disruptive technology directions for 5g"

Connected through hyperedge HE-6 (induced by source paper "delay performance of wireless communications with imperfect csi and finite length coding"):
  with members:
    - "on the delay performance of interference channels"
    - "green communication via type i arq finite block length analysis"
    - "finite block length analysis of the incremental redundancy harq"
    - "throughput of cognitive radio systems with finite blocklength codes"
    - "diversity versus channel knowledge at finite block length"
    - "multiuser mimo achievable rates with downlink training and channel state feedback"

Connected through hyperedge HE-7 (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-8 (induced by source paper "variable length convolutional coding for short blocklengths with decision feedback"):
  with members:
    - "convolutional code specific crc code design"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "green communication via type i arq finite block length analysis"
    - "finite block length analysis of the incremental redundancy harq"
    - "reliability output decoding of tail biting convolutional codes"
    - "a hybrid arq scheme based on polar codes"
    - "feedback communication systems with limitations on incremental redundancy"
    - "reliability based error detection for feedback communication with low latency"

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)