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 bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"
  Abstract: We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the set up where  a priori  channel state information is not available. The upper bound relies on a dual formula for channel capacity and on the assumption that the users can cooperate perfectly. The lower bound is derived assuming a noncooperative scenario where each user employs unitary space-time modulation (independently from the other users). Numerical results show that the gap between the upper and the lower bound is small already at moderate SNR values. This suggests that the sum-rate capacity gains obtainable through user cooperation are minimal for the scenarios considered in the paper.

Connected through hyperedge HE-1 (induced by source paper "throughput analysis of massive mimo uplink with low resolution adcs"):
  with members:
    - "uplink performance of wideband massive mimo with one bit adcs"
    - "bayes optimal joint channel and data estimation for massive mimo with low precision adcs"
    - "mixed adc massive mimo"
    - "on the spectral efficiency of massive mimo systems with low resolution adcs"
    - "channel estimation and uplink achievable rates in one bit massive mimo systems"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "massive mimo ten myths and one critical question"
    - "one bit massive mimo channel estimation and high order modulations"

Connected through hyperedge HE-2 (induced by source paper "finite blocklength bounds on the maximum coding rate of rician fading channels with applications to pilot assisted transmission"):
  with members:
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "the third order term in the normal approximation for the awgn channel"
    - "on the capacity of large mimo block fading channels"
    - "what is the value of joint processing of pilots and data in block fading channels"

Connected through hyperedge HE-3 (induced by source paper "massive mimo with low resolution adcs"):
  with members:
    - "channel estimation and performance analysis of one bit massive mimo systems"
    - "uplink performance of wideband massive mimo with one bit adcs"
    - "bayes optimal joint channel and data estimation for massive mimo with low precision adcs"
    - "mixed adc massive mimo"
    - "channel estimation and uplink achievable rates in one bit massive mimo systems"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "mixed adc massive mimo detectors performance analysis and design optimization"
    - "quantized precoding for massive mu mimo"

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

Connected through hyperedge HE-5 (induced by source paper "optimal energy allocation for delay constrained traffic over fading multiple access channels"):
  with members:
    - "iterative dynamic water filling for fading multiple access channels with energy harvesting"
    - "power allocation for energy harvesting transmitter with causal information"
    - "on the capacity of multiple access and broadcast fading channels with full channel state information at low snr"
    - "energy efficient scheduling of delay constrained traffic over fading channels"

Connected through hyperedge HE-6 (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 length scaling for polar codes"
    - "diversity versus multiplexing at finite blocklength"
    - "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-7 (induced by source paper "towards massive ultra reliable and low latency wireless communication with short packets"):
  with members:
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "variable length convolutional coding for short blocklengths with decision feedback"
    - "finite length scaling for polar codes"
    - "ultra reliable communication in 5g wireless systems"
    - "feedback communication systems with limitations on incremental redundancy"
    - "improved bounds on the finite length scaling of polar codes"

Connected through hyperedge HE-8 (induced by source paper "one bit massive mimo channel estimation and high order modulations"):
  with members:
    - "capacity analysis of one bit quantized mimo systems with transmitter channel state information"
    - "joint channel and data estimation for large mimo systems with low precision adcs"
    - "massive mimo with 1 bit adc"
    - "at low snr asymmetric quantizers are better"
    - "on the gain of joint processing of pilot and data symbols in stationary rayleigh fading channels"
    - "mutual information of iid complex gaussian signals on block rayleigh faded channels"
    - "increased capacity per unit cost by oversampling"
    - "what is the value of joint processing of pilots and data in block fading 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)