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: "on the gain of joint processing of pilot and data symbols in stationary rayleigh fading channels"
  Abstract: In many typical mobile communication receivers the channel is estimated based on pilot symbols to allow for a coherent detection and decoding in a separate processing step. Currently much work is spent on receivers which break up this separation, e.g., by enhancing channel estimation based on reliability information on the data symbols. In the present work, we evaluate the possible gain of a joint processing of data and pilot symbols in comparison to the case of a separate processing in the context of stationary Rayleigh flat-fading channels. Therefore, we discuss the nature of the possible gain of a joint processing of pilot and data symbols. We show that the additional information that can be gained by a joint processing is captured in the temporal correlation of the channel estimation error of the solely pilot based channel estimation, which is not retrieved by the channel decoder in case of separate processing. In addition, we derive a new lower bound on the achievable rate for joint processing of pilot and data symbols.

Connected through hyperedge HE-1 (induced by source paper "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"):
  with members:
    - "short codes with mismatched channel state information a case study"
    - "finite blocklength bounds on the maximum coding rate of rician fading channels with applications to pilot assisted transmission"
    - "code design for short blocks a survey"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "the third order term in the normal approximation for the awgn channel"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "on the capacity of large mimo block fading channels"
    - "error exponents and cutoff rate for noncoherent rician fading channels"

Connected through hyperedge HE-2 (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-3 (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"
    - "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"
    - "massive mimo with 1 bit adc"
    - "at low snr asymmetric quantizers are better"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "on the achievable rate of stationary rayleigh flat fading channels with gaussian inputs"):
  with members:
    - "mutual information of iid complex gaussian signals on block rayleigh faded channels"
    - "low snr capacity of noncoherent fading channels"
    - "on multipath fading channels at high snr"
    - "capacity results for block stationary gaussian fading channels with a peak power constraint"
    - "capacity per unit energy of fading channels with a peak constraint"

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)