human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"):
  Abstract: We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the practically relevant scenario in which there is no \emph{a priori} channel state information available at the transmitter and at the receiver. An upper bound built upon the min-max converse is compared to two lower bounds: the first one relies on a noncoherent transmission strategy in which the fading channel is not estimated explicitly at the receiver; the second one employs pilot-assisted transmission (PAT) followed by maximum-likelihood channel estimation and scaled mismatched nearest-neighbor decoding at the receiver. Our bounds are tight enough to unveil the optimum number of diversity branches that a packet should span so that the energy per bit required to achieve a target packet error probability is minimized, for a given constraint on the code rate and the packet size. Furthermore, the bounds reveal that noncoherent transmission is more energy efficient than PAT, even when the number of pilot symbols and their power is optimized. For example, for the case when a coded packet of $168$ symbols is transmitted using a channel code of rate $0.48$ bits/channel use, over a block-fading channel with block size equal to $8$ symbols, PAT requires an additional $1.2$ dB of energy per information bit to achieve a packet error probability of $10^{-3}$ compared to a suitably designed noncoherent transmission scheme. Finally, we devise a PAT scheme based on punctured tail-biting quasi-cyclic codes and ordered statistics decoding, whose performance are close ($1$ dB gap at $10^{-3}$ packet error probability) to the ones predicted by our PAT lower bound. This shows that the PAT lower bound provides useful guidelines on the design of actual PAT schemes.

Includes members:
  Member "short codes with mismatched channel state information a case study":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low complexity joint channel estimation and list decoding of short codes")
  Member "finite blocklength bounds on the maximum coding rate of rician fading channels with applications to pilot assisted transmission":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "superimposed frame synchronization optimization for finite block length regime")
  Member "code design for short blocks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "decoder tailored polar code design using the genetic algorithm")
  Member "short packet communications over multiple antenna rayleigh fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "the third order term in the normal approximation for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "mismatched decoding error exponents second order rates and saddlepoint approximations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "on the capacity of large mimo block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi user detection based on expectation propagation for the non coherent simo multiple access channel")
  Member "on the gain of joint processing of pilot and data symbols in stationary rayleigh fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "massive mimo with low resolution adcs")

Question: Please tell me which class the source paper 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)